# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
676071 | 2022-12-29T09:45:40 Z | madtuber | Knapsack (NOI18_knapsack) | C++14 | 3 ms | 1876 KB |
#include <bits/stdc++.h> #define all(x) begin(x),end(x) #define fir first #define sec second #define sz(x) x.size() #define pb push_back using namespace std; using ll = long long; using vi = vector<int>; using pi = pair<int,int>; using pdb = pair<double,double>; using pll = pair<ll,ll>; using vll = vector<ll>; const double EPS = (1e-6); void setio(string s){ freopen((s + ".in").c_str(),"r",stdin); freopen((s + ".out").c_str(),"w",stdout); } struct Item{ ll v, w, k; }; const int MXN = 1e5+1; const int MXS = 2001; ll dp[MXN][MXS]; void solve(){ ll s, n; cin >> s >> n; vector<Item> a(n); for(auto& i :a){ cin >> i.v >> i.w >> i.k; } for(int i{1}; i <= n; i++){ for(int j{}; j <= s; j++){ dp[i][j] = max(dp[i][j], dp[i-1][j]); ll mx = min((s-j)/a[i-1].w, a[i-1].k); dp[i][j+mx*a[i-1].w] = max(dp[i][j+mx*a[i-1].w], dp[i-1][j] + mx*a[i-1].v); } } cout << dp[n][s]; } int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int t = 1; while(t--){ solve(); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 724 KB | Output is correct |
2 | Correct | 3 ms | 1876 KB | Output is correct |
3 | Correct | 3 ms | 1748 KB | Output is correct |
4 | Correct | 2 ms | 1876 KB | Output is correct |
5 | Correct | 2 ms | 1748 KB | Output is correct |
6 | Correct | 2 ms | 1748 KB | Output is correct |
7 | Correct | 2 ms | 1876 KB | Output is correct |
8 | Correct | 2 ms | 1748 KB | Output is correct |
9 | Correct | 2 ms | 1748 KB | Output is correct |
10 | Correct | 2 ms | 1876 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 724 KB | Output is correct |
2 | Correct | 3 ms | 1876 KB | Output is correct |
3 | Correct | 3 ms | 1748 KB | Output is correct |
4 | Correct | 2 ms | 1876 KB | Output is correct |
5 | Correct | 2 ms | 1748 KB | Output is correct |
6 | Correct | 2 ms | 1748 KB | Output is correct |
7 | Correct | 2 ms | 1876 KB | Output is correct |
8 | Correct | 2 ms | 1748 KB | Output is correct |
9 | Correct | 2 ms | 1748 KB | Output is correct |
10 | Correct | 2 ms | 1876 KB | Output is correct |
11 | Correct | 1 ms | 596 KB | Output is correct |
12 | Correct | 2 ms | 1748 KB | Output is correct |
13 | Correct | 2 ms | 1748 KB | Output is correct |
14 | Correct | 2 ms | 1876 KB | Output is correct |
15 | Correct | 2 ms | 1876 KB | Output is correct |
16 | Incorrect | 2 ms | 1876 KB | Output isn't correct |
17 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Correct | 0 ms | 724 KB | Output is correct |
6 | Correct | 3 ms | 1876 KB | Output is correct |
7 | Correct | 3 ms | 1748 KB | Output is correct |
8 | Correct | 2 ms | 1876 KB | Output is correct |
9 | Correct | 2 ms | 1748 KB | Output is correct |
10 | Correct | 2 ms | 1748 KB | Output is correct |
11 | Correct | 2 ms | 1876 KB | Output is correct |
12 | Correct | 2 ms | 1748 KB | Output is correct |
13 | Correct | 2 ms | 1748 KB | Output is correct |
14 | Correct | 2 ms | 1876 KB | Output is correct |
15 | Correct | 1 ms | 596 KB | Output is correct |
16 | Correct | 2 ms | 1748 KB | Output is correct |
17 | Correct | 2 ms | 1748 KB | Output is correct |
18 | Correct | 2 ms | 1876 KB | Output is correct |
19 | Correct | 2 ms | 1876 KB | Output is correct |
20 | Incorrect | 2 ms | 1876 KB | Output isn't correct |
21 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 340 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 0 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 340 KB | Output is correct |
5 | Correct | 0 ms | 724 KB | Output is correct |
6 | Correct | 3 ms | 1876 KB | Output is correct |
7 | Correct | 3 ms | 1748 KB | Output is correct |
8 | Correct | 2 ms | 1876 KB | Output is correct |
9 | Correct | 2 ms | 1748 KB | Output is correct |
10 | Correct | 2 ms | 1748 KB | Output is correct |
11 | Correct | 2 ms | 1876 KB | Output is correct |
12 | Correct | 2 ms | 1748 KB | Output is correct |
13 | Correct | 2 ms | 1748 KB | Output is correct |
14 | Correct | 2 ms | 1876 KB | Output is correct |
15 | Correct | 1 ms | 596 KB | Output is correct |
16 | Correct | 2 ms | 1748 KB | Output is correct |
17 | Correct | 2 ms | 1748 KB | Output is correct |
18 | Correct | 2 ms | 1876 KB | Output is correct |
19 | Correct | 2 ms | 1876 KB | Output is correct |
20 | Incorrect | 2 ms | 1876 KB | Output isn't correct |
21 | Halted | 0 ms | 0 KB | - |