제출 #501359

#제출 시각아이디문제언어결과실행 시간메모리
501359ala2Knapsack (NOI18_knapsack)C++14
49 / 100
45 ms81160 KiB
/* ID: alaa523 LANG: C++11 PROB: Fruit Feast */ #include <bits/stdc++.h> #define pb push_back #define int long long #define F first #define S second using namespace std; int n,s; int v[1001000]; int w[1001000]; int k[1000100]; vector<pair<int,int>>a; int dp[1005][10005]; int f(int i,int sum) { if(sum>s) return -1e17; if(i==a.size()) return 0; if(dp[i][sum]!=-1) return dp[i][sum]; return dp[i][sum]=max(f(i+1,sum+a[i].S)+a[i].F,f(i+1,sum)); } signed main() { memset(dp,-1,sizeof dp); cin>>s>>n; for(int i=0;i<n;i++) { cin>>v[i]>>w[i]>>k[i]; k[i]=min(k[i],s); } for(int i=0;i<n;i++) { for(int j=0;j<k[i];j++) { a.pb({v[i],w[i]}); } } cout<<f(0,0)<<endl; }

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

knapsack.cpp: In function 'long long int f(long long int, long long int)':
knapsack.cpp:22:9: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     if(i==a.size())
      |        ~^~~~~~~~~~
#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...