Submission #602569

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
602569	2022-07-23T08:47:41 Z	hasan_tawsif	Knapsack (NOI18_knapsack)	C++14	73 / 100	1000 ms	2740 KB

knapsack

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#ifdef LOCAL
#include "H:\code\codeforces\debug.h"
#else
#define debug(...)
#define sdebug(...)
#endif

//https://oj.uz/problem/view/NOI18_knapsack

const ll inf = (ll) 1e16;

ll dp[2][2005];

void solve() {
	int capacity, n;
	cin >> capacity >> n;

	int profit[n + 1], weight[n + 1], copy[n + 1];
	for (int i = 1; i <= n; ++i) cin >> profit[i] >> weight[i] >> copy[i];

    for (int i = 1; i <= n; ++i) {
    	for (int rem = 1; rem <= capacity; ++rem) {
    		for (int cnt = 1; cnt <= min(copy[i], 2004); ++cnt) {
    			if (rem - (cnt * weight[i]) >= 0) dp[1][rem] = max(dp[1][rem], dp[0][rem - (cnt * weight[i])] + (profit[i] * cnt));
    			dp[1][rem]= max(dp[1][rem], dp[0][rem]);
    		}
    	}
    	for (int rem = 1; rem <= capacity; ++rem) dp[0][rem] = dp[1][rem];
    }
    cout << dp[1][capacity] << "\n";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1; 
 //   cin >> t;
    while(t--) solve();
}

Subtask #1
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	212 KB	Output is correct
2	Correct	3 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	3 ms	324 KB	Output is correct

Subtask #2
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	320 KB	Output is correct
12	Correct	4 ms	340 KB	Output is correct
13	Correct	1 ms	468 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	2 ms	328 KB	Output is correct
16	Correct	2 ms	340 KB	Output is correct
17	Correct	1 ms	320 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	328 KB	Output is correct

Subtask #4
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	212 KB	Output is correct
2	Correct	3 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	3 ms	324 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	4 ms	340 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	2 ms	328 KB	Output is correct
20	Correct	2 ms	340 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	328 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	349 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	410 ms	340 KB	Output is correct
30	Correct	401 ms	336 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	2 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	2 ms	340 KB	Output is correct

Subtask #5
0 / 27.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	212 KB	Output is correct
2	Correct	3 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	3 ms	324 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	320 KB	Output is correct
16	Correct	4 ms	340 KB	Output is correct
17	Correct	1 ms	468 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	2 ms	328 KB	Output is correct
20	Correct	2 ms	340 KB	Output is correct
21	Correct	1 ms	320 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	328 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	349 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	410 ms	340 KB	Output is correct
30	Correct	401 ms	336 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	2 ms	340 KB	Output is correct
33	Correct	1 ms	340 KB	Output is correct
34	Correct	2 ms	340 KB	Output is correct
35	Correct	20 ms	2556 KB	Output is correct
36	Execution timed out	1082 ms	2740 KB	Time limit exceeded
37	Halted	0 ms	0 KB	-

Submission #602569

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 17.0 / 17.0

Subtask #3 20.0 / 20.0

Subtask #4 24.0 / 24.0

Subtask #5 0 / 27.0

Subtask #1
12.0 / 12.0

Subtask #2
17.0 / 17.0

Subtask #3
20.0 / 20.0

Subtask #4
24.0 / 24.0

Subtask #5
0 / 27.0