oj.uz

Submission #648121

# Submission time Handle Problem Language Result Execution time Memory
648121 2022-10-05T12:35:22 Z Lextyle Knapsack (NOI18_knapsack) C++17
100 / 100
 167 ms 236708 KB 
#include <bits/stdc++.h>
#pragma warning(disable : 4996)
#pragma warning(disable : 6031)
#define USACO freopen("feast.in", "r", stdin); freopen("feast.out", "w+", stdout);    
#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long
using namespace std;

/*
*/
ll dp[15519][2001];
pair<int, pair<int, int>> a[100000];
pair<int, int> b[15518];

bool pred(pair<int, pair<int, int>> a1, pair<int, pair<int, int>> a2) {
	if (a1.first < a2.first) return 1;
	else if (a1.first == a2.first) return a1.second.first > a2.second.first;
	return 0;
}

int main() {
	//USACO;
	fastIO;
	int s, n;
	cin >> s >> n;
	for (int i = 0; i < n; i++) cin >> a[i].second.first >> a[i].first >> a[i].second.second;
	sort(a, a + n, pred);
	int cnt = 0, ind = 0;
	for (int i = 0; i < n; i++) {
		if (i == 0 || a[i].first != a[i - 1].first) cnt = 0;
		for (int j = 0; cnt < s / a[i].first && j < a[i].second.second; j++) {
			b[ind++] = { a[i].first, a[i].second.first };
			cnt++;
		}
	}
	for (int i = 1; i <= ind; i++) {
		for (int j = b[i - 1].first; j <= s; j++) {
			dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - b[i - 1].first] + b[i - 1].second);
		}
	}
	cout << dp[ind][s] << "\n";
}

Compilation message

knapsack.cpp:2: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    2 | #pragma warning(disable : 4996)
      | 
knapsack.cpp:3: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    3 | #pragma warning(disable : 6031)
      |

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1748 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 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 2 ms 1364 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1748 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 1364 KB Output is correct
7 Correct 1 ms 1364 KB Output is correct
8 Correct 1 ms 1364 KB Output is correct
9 Correct 2 ms 1364 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 9 ms 15572 KB Output is correct
13 Correct 1 ms 1748 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 3284 KB Output is correct
17 Correct 1 ms 1364 KB Output is correct
18 Correct 1 ms 1748 KB Output is correct
19 Correct 2 ms 3028 KB Output is correct
20 Correct 2 ms 2772 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 1988 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1748 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 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct
14 Correct 1 ms 1484 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 9 ms 15572 KB Output is correct
17 Correct 1 ms 1748 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 3284 KB Output is correct
21 Correct 1 ms 1364 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 2 ms 3028 KB Output is correct
24 Correct 2 ms 2772 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 17 ms 31556 KB Output is correct
27 Correct 1 ms 1748 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 6 ms 10056 KB Output is correct
31 Correct 1 ms 1352 KB Output is correct
32 Correct 1 ms 1620 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 4 ms 3924 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 2 ms 1988 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1748 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 1364 KB Output is correct
11 Correct 1 ms 1364 KB Output is correct
12 Correct 1 ms 1364 KB Output is correct
13 Correct 2 ms 1364 KB Output is correct
14 Correct 1 ms 1484 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 9 ms 15572 KB Output is correct
17 Correct 1 ms 1748 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 2 ms 3284 KB Output is correct
21 Correct 1 ms 1364 KB Output is correct
22 Correct 1 ms 1748 KB Output is correct
23 Correct 2 ms 3028 KB Output is correct
24 Correct 2 ms 2772 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 17 ms 31556 KB Output is correct
27 Correct 1 ms 1748 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 6 ms 10056 KB Output is correct
31 Correct 1 ms 1352 KB Output is correct
32 Correct 1 ms 1620 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 4 ms 3924 KB Output is correct
35 Correct 38 ms 2528 KB Output is correct
36 Correct 59 ms 34004 KB Output is correct
37 Correct 50 ms 33980 KB Output is correct
38 Correct 40 ms 2844 KB Output is correct
39 Correct 60 ms 3624 KB Output is correct
40 Correct 167 ms 236708 KB Output is correct
41 Correct 103 ms 134608 KB Output is correct
42 Correct 108 ms 145128 KB Output is correct
43 Correct 155 ms 236204 KB Output is correct
44 Correct 150 ms 235616 KB Output is correct
45 Correct 53 ms 19948 KB Output is correct
46 Correct 32 ms 3456 KB Output is correct
47 Correct 62 ms 40336 KB Output is correct
48 Correct 115 ms 109432 KB Output is correct
49 Correct 34 ms 4684 KB Output is correct
50 Correct 108 ms 144188 KB Output is correct