提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
114850	2023-10-24 09:00:43	Fysty	G	cpp	16/16	AC	16

#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

const int MOD1=1e9+7;
const int MOD2=998244353;
const ll INF=3e18;

ll fpow(ll a,ll b,ll m)
{
    if(!b) return 1;
    ll tmp=1;
    for(ll cur=a;b;b>>=1,cur=cur*cur%m) if(b&1) tmp=tmp*cur%m;
    return tmp;
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}

#define MottoHayaku ios::sync_with_stdio(false);cin.tie(0);
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define F first
#define S second
#define pb push_back
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end()),uni(c)

ll dp[105];
ll x[20005],y[20005];
void solve()
{
    ll n,m;
    cin>>n>>m;
    rep1(i,n) cin>>x[i];
    rep1(i,n) cin>>y[i];
    rep1(i,n)
    {
        if(y[i]>=m) continue;
        for(int j=m-1;j>=y[i];j--) dp[j]=max(dp[j],dp[j-y[i]]+x[i]);
    }
    ll ans=0;
    rep(j,m) ans=max(ans,dp[j]);
    cout<<ans<<"\n";
}

signed main()
{
    MottoHayaku
    int t;
    //cin>>t;
    t=1;
    while(t--)
    {
        solve();
    }
}

sample1.txt AC 2
case1.txt AC 3
case2.txt AC 16
case3.txt AC 3
case4.txt AC 12
case5.txt AC 10
case6.txt AC 6
case7.txt AC 15
case8.txt AC 14
case9.txt AC 8
case10.txt AC 15
case11.txt AC 13
case12.txt AC 12
case13.txt AC 9
case14.txt AC 15
case15.txt AC 7
16 AC16 AC