oj.uz

Submission #676415

# Submission time Handle Problem Language Result Execution time Memory
676415 2022-12-30T20:45:13 Z ProCallerAJ Knapsack (NOI18_knapsack) C++17
17 / 100
 1 ms 1108 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, e) for (int i = 0; i < (e); i++)
#define FOR1(i, e) for (int i = 1; i <= (e); i++)
#define ull unsigned long long int
#define pii pair <int, int>
#define value first.first
#define weight first.second
#define quantity second
int n, s;
pair<pii, int> items[100000];
int dp[100001][2001];
int main(){
    cin >> s >> n;
    FOR(i, n){
        cin >> items[i].value >> items[i].weight >> items[i].quantity;
    }
    FOR1(i, n) {
        for (int j = 0; j <= s; j++) {
            dp[i][j] = dp[i - 1][j];
            if (j >= items[i - 1].weight){
                dp[i][j] = max(dp[i][j], dp[i - 1][j - items[i - 1].weight] + items[i - 1].value);
            }
        }
    }
    cout << dp[n][s];
    return 0;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 692 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 692 KB Output is correct
2 Correct 1 ms 1032 KB Output is correct
3 Correct 1 ms 980 KB Output is correct
4 Correct 1 ms 980 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 980 KB Output is correct
7 Correct 1 ms 980 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Incorrect 1 ms 980 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 304 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 304 KB Output isn't correct
2 Halted 0 ms 0 KB -