oj.uz

Submission #861378

# Submission time Handle Problem Language Result Execution time Memory
861378 2023-10-16T04:48:02 Z anarch_y Knapsack (NOI18_knapsack) C++17
73 / 100
 210 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define all(x) begin(x), end(x)
#define pb push_back
#define int long long

signed main(){
    ios::sync_with_stdio(false);
	cin.tie(nullptr);

    int S, N; cin >> S >> N;
    vector<int> V(N+1, 0), W(N+1, 0), K(N+1, 0);
    for(int i=1; i<=N; i++){
        cin >> V[i] >> W[i] >> K[i];
        K[i] = min(K[i], S/W[i]);
    }

    vector<vector<int>> dp(N+1, vector<int>(S+1, 0));
    for(int i=1; i<=N; i++){
        for(int j=1; j<=S; j++){
            dp[i][j] = dp[i-1][j];
            for(int k=1; k<=K[i]; k++){
                int w = k*W[i];
                if(j>=w){
                    dp[i][j] = max(dp[i][j], dp[i-1][j-w]+k*V[i]);
                }
            }
        }
    }
    cout << dp[N][S];
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 1932 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 2000 KB Output is correct
8 Correct 1 ms 1836 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 1932 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Correct 1 ms 1884 KB Output is correct
5 Correct 1 ms 1884 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 2000 KB Output is correct
8 Correct 1 ms 1836 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 2016 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 1 ms 1884 KB Output is correct
16 Correct 1 ms 1884 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 2 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 1932 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 1 ms 2000 KB Output is correct
12 Correct 1 ms 1836 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 2016 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 210 ms 2052 KB Output is correct
27 Correct 1 ms 1880 KB Output is correct
28 Correct 2 ms 1884 KB Output is correct
29 Correct 1 ms 1884 KB Output is correct
30 Correct 3 ms 1884 KB Output is correct
31 Correct 1 ms 1884 KB Output is correct
32 Correct 1 ms 1884 KB Output is correct
33 Correct 1 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 1932 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Correct 1 ms 1884 KB Output is correct
9 Correct 1 ms 1884 KB Output is correct
10 Correct 1 ms 1884 KB Output is correct
11 Correct 1 ms 2000 KB Output is correct
12 Correct 1 ms 1836 KB Output is correct
13 Correct 1 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 2016 KB Output is correct
17 Correct 1 ms 1884 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Correct 1 ms 1884 KB Output is correct
20 Correct 1 ms 1884 KB Output is correct
21 Correct 1 ms 1884 KB Output is correct
22 Correct 1 ms 1884 KB Output is correct
23 Correct 2 ms 1884 KB Output is correct
24 Correct 1 ms 1884 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 210 ms 2052 KB Output is correct
27 Correct 1 ms 1880 KB Output is correct
28 Correct 2 ms 1884 KB Output is correct
29 Correct 1 ms 1884 KB Output is correct
30 Correct 3 ms 1884 KB Output is correct
31 Correct 1 ms 1884 KB Output is correct
32 Correct 1 ms 1884 KB Output is correct
33 Correct 1 ms 1884 KB Output is correct
34 Correct 2 ms 1884 KB Output is correct
35 Correct 20 ms 9308 KB Output is correct
36 Runtime error 117 ms 262144 KB Execution killed with signal 9
37 Halted 0 ms 0 KB -