제출 #1015814

#제출 시각아이디문제언어결과실행 시간메모리
1015814asli_bgKnapsack (NOI18_knapsack)C++11
12 / 100
51 ms110416 KiB
#include<bits/stdc++.h> using namespace std; #define all(x) x.begin(),x.end() #define fi first #define se second #define pb push_back #define sp <<' '<< typedef long long ll; typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<pii> vii; typedef vector<ll> vll; typedef vector<bool> vb; #define FOR(i,a) for(int i=0;i<(a);i++) #define FORE(i,a,b) for(int i=(a);i<(b);i++) #define RFOR(i,a) for(int i=(a);i>=0;i--) #define contp(a) for(auto el:a) {cout<<el.fi<<'-'<<el.se<<' ';}cout<<endl #define cont(a) for(auto el:a) {cout<<el<<' ';}cout<<endl const int MAXN=1e5+2; const int MAXS=2e3+2; int dp[MAXS]; vii say[MAXS][MAXS]; //say[i][j][x]=y; //i. weightte j.weigthe x.valuda olan elemandan y tane var int ok[MAXS][MAXS]; bool mycmp(pii a,pii b) { return a.fi>b.fi; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n,mxw; cin>>mxw>>n; vi v(n+1); vi w(n+1); vi k(n+1); FOR(i,n){ cin>>v[i+1]>>w[i+1]>>k[i+1]; } FOR(i,n){ say[0][w[i+1]].pb({v[i+1],k[i+1]}); ok[0][w[i+1]]=0; } FOR(i,n){ sort(all(say[0][w[i+1]]),mycmp); } dp[0]=0; int ind; FORE(i,1,mxw+1){ ind=0; dp[i]=dp[i-1]; FORE(j,1,n+1){ if(i-w[j]>=0 and ok[i-w[j]][w[j]]!=-1 and !say[i-w[j]][w[j]].empty()){ //kullan //cout<<"sz "<<say[i-w[j]][w[j]].size()<<endl; int val=say[i-w[j]][w[j]][ok[i-w[j]][w[j]]].fi; if(dp[i-w[j]]+val>dp[i]){ dp[i]=dp[i-w[j]]+val; ind=j; } } } if(ind>0){ FORE(j,1,i+1){ for(auto el:say[i-w[ind]][j]) say[i][j].pb(el); ok[i][j]=ok[i-w[ind]][j]; } int temp=--say[i][w[ind]][ok[i][w[ind]]].se; if(!temp) { ok[i][w[ind]]++; if(ok[i][w[ind]]>=say[i][w[ind]].size()) ok[i][w[ind]]=-1; } } else{ //kullanmadım FORE(j,1,i+1){ for(auto el:say[i-1][j]) say[i][j].pb(el); ok[i][j]=ok[i-1][j]; } } } //FOR(i,mxw+1) cout<<dp[i]<<' '; //cout<<endl; cout<<dp[mxw]<<endl; }

컴파일 시 표준 에러 (stderr) 메시지

knapsack.cpp: In function 'int main()':
knapsack.cpp:85:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |                 if(ok[i][w[ind]]>=say[i][w[ind]].size()) ok[i][w[ind]]=-1;
      |                    ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...