oj.uz

Submission #470878

# Submission time Handle Problem Language Result Execution time Memory
470878 2021-09-06T03:08:52 Z huukhang Knapsack (NOI18_knapsack) C++17
100 / 100
 103 ms 36248 KB 
/*
						   Khangnh's code

"You can either experience the pain of discipline or the pain of regret. 
						The choice is yours."
*/

// - Only when necessary :d
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define fileopen(a, b) freopen(((string)a + ".inp").c_str(), "r", stdin); freopen(((string)b + ".out").c_str(), "w", stdout);

#define ll long long
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define eb emplace_back
typedef pair<int, int> pii;

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double pi = acos(-1);
const double eps = 1e-9;

inline bool ckmax(int &x, const int &y) {return x < y ? x = y, 1 : 0;}

int s, n;
map<int, vector<pii>> a;
int dp[2005][2005];
// dp[i][j]: maximum cost with items of the first i weight types, using j weight

void solve() {
	cin >> s >> n;
	for (int i = 1, v, w, k; i <= n; ++i) {
		cin >> v >> w >> k;
		a[w].pb({v, k});
	}

	for (int i = 0; i <= a.size(); ++i)
		for (int j = 0; j <= s; ++j)
			dp[i][j] = -inf;
	dp[0][0] = 0;

	int idx = 0;
	for (auto &cur : a) {
		int w = cur.fi;
		vector<pii> &item = cur.se;
		sort(item.begin(), item.end(), greater<pii>());

		++idx;
		for (int i = 0; i <= s; ++i) {
			// - We don't take any items of this weight type:
			dp[idx][i] = dp[idx - 1][i];

			// - We take some items of this weight type:
			int copies = 0,		// copies: number of items of this weight type we've used
				type = 0,		// type: current index of this weight type
				used = 0,		// used: number of the current item we've used
				cost = 0;		// cost: current cost
			while ((copies + 1)*w <= i && type < item.size()) {
				++copies;
				cost += item[type].fi;
				if (dp[idx - 1][i - copies*w] != -inf)
					ckmax(dp[idx][i], dp[idx - 1][i - copies*w] + cost);
			
				++used;
				if (used == item[type].se) used = 0, ++type;
			}
		}
	}

	int ans = -inf;
	for (int i = 0; i <= s; ++i) ckmax(ans, dp[idx][i]);
	cout << ans;
}

signed main() {
	#ifdef LOCAL
		fileopen("input", "output");
		auto start = clock();
	#endif
	#ifndef LOCAL
//		fileopen("LAH", "LAH");
	#endif
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int test = 1;
//	cin >> test;
	for (int tc = 1; tc <= test; ++tc) solve();
	#ifdef LOCAL
		auto end = clock();
		cout << "\n\nExecution time : " << double(end - start)/CLOCKS_PER_SEC << "[s]";
	#endif
	return 0;
}

Compilation message

knapsack.cpp: In function 'void solve()':
knapsack.cpp:49:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::map<long long int, std::vector<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |  for (int i = 0; i <= a.size(); ++i)
      |                  ~~^~~~~~~~~~~
knapsack.cpp:70:39: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |    while ((copies + 1)*w <= i && type < item.size()) {
      |                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 1740 KB Output is correct
7 Correct 3 ms 1868 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 2 ms 1740 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 3 ms 1740 KB Output is correct
7 Correct 3 ms 1868 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 2 ms 1740 KB Output is correct
10 Correct 2 ms 1740 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 1868 KB Output is correct
17 Correct 2 ms 1728 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 2 ms 1740 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 1740 KB Output is correct
11 Correct 3 ms 1868 KB Output is correct
12 Correct 2 ms 1740 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct
21 Correct 2 ms 1728 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 2 ms 1740 KB Output is correct
24 Correct 2 ms 1868 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 1856 KB Output is correct
31 Correct 2 ms 1868 KB Output is correct
32 Correct 2 ms 1740 KB Output is correct
33 Correct 2 ms 1740 KB Output is correct
34 Correct 3 ms 1868 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 3 ms 1740 KB Output is correct
11 Correct 3 ms 1868 KB Output is correct
12 Correct 2 ms 1740 KB Output is correct
13 Correct 2 ms 1740 KB Output is correct
14 Correct 2 ms 1740 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 3 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 1868 KB Output is correct
21 Correct 2 ms 1728 KB Output is correct
22 Correct 2 ms 1740 KB Output is correct
23 Correct 2 ms 1740 KB Output is correct
24 Correct 2 ms 1868 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 4 ms 332 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 1856 KB Output is correct
31 Correct 2 ms 1868 KB Output is correct
32 Correct 2 ms 1740 KB Output is correct
33 Correct 2 ms 1740 KB Output is correct
34 Correct 3 ms 1868 KB Output is correct
35 Correct 37 ms 3308 KB Output is correct
36 Correct 49 ms 3436 KB Output is correct
37 Correct 39 ms 3400 KB Output is correct
38 Correct 40 ms 3620 KB Output is correct
39 Correct 48 ms 4360 KB Output is correct
40 Correct 102 ms 36248 KB Output is correct
41 Correct 88 ms 35524 KB Output is correct
42 Correct 86 ms 35492 KB Output is correct
43 Correct 93 ms 35580 KB Output is correct
44 Correct 103 ms 35524 KB Output is correct
45 Correct 52 ms 7908 KB Output is correct
46 Correct 44 ms 3988 KB Output is correct
47 Correct 65 ms 11236 KB Output is correct
48 Correct 74 ms 20420 KB Output is correct
49 Correct 43 ms 5024 KB Output is correct
50 Correct 58 ms 5000 KB Output is correct