제출 #965112

#제출 시각아이디문제언어결과실행 시간메모리
965112Elliot_7002Knapsack (NOI18_knapsack)C++14
37 / 100
1062 ms604 KiB
#include <iostream> #include <bits/stdc++.h> using namespace std; typedef tuple<int,int,int> triad; #define int long long #define INF 1e9 int s,n,val,weight,occ; vector<int> dp; void update(int value, int w){ for(int i = dp.size()-w-1; i >= 0; i--){ dp[i + w] = max(dp[i+w], dp[i] + value); } return; } int32_t main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin >> s >> n; dp.resize(s+1); int mod = 1e9+7; dp[0] = 0; for(int i = 0; i < n; i++){ cin >> val >> weight >> occ; while(occ--){ update(val,weight); } } int ans = dp[s]; cout << ans; return 0; }

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

knapsack.cpp: In function 'int32_t main()':
knapsack.cpp:21:9: warning: unused variable 'mod' [-Wunused-variable]
   21 |     int mod = 1e9+7;
      |         ^~~
#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...