oj.uz

Submission #612220

# Submission time Handle Problem Language Result Execution time Memory
612220 2022-07-29T11:42:40 Z DanShaders Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1670 ms 120472 KB 
//Cgrader.cpp
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define x first
#define y second
using ll = long long;
using ld = long double;
#define all(x) begin(x), end(x)
#define sz(x) ((int) (x).size())

const int N = 2100;

vector<int> pw[2][N];
vector<int> sorted[N];

ll find_maximum(int k, vector<vector<int>> d) {
	int n = sz(d), m = sz(d[0]);

	vector<tuple<int, int, int>> a;
	for (int i = 0; i < n; ++i) {
		sorted[i] = vector(m, 0);
		iota(all(sorted[i]), 0);
		sort(all(sorted[i]), [&](int x, int y) {
			return tie(d[i][x], x) < tie(d[i][y], y);
		});
		for (int j = 0; j < m; ++j) {
			a.push_back({d[i][j], i, j});
		}
	}	
	stable_sort(all(a));

	ll ans = 0;

	for (int i = 0; i < n * m; ++i) {
		auto [val, x, y] = a[i];
		if (sz(pw[0][x]) < k) {
			ans -= val;
			pw[0][x].push_back(y);
		}
	}

	set<pair<int, int>> cands;
	for (int j = 0; j < n; ++j) {
		if (!sz(pw[0][j])) {
			continue;
		}
		int cval = d[j][sorted[j][m - sz(pw[1][j]) - 1]] + d[j][pw[0][j].back()];
		cands.insert({cval, j});
	}

	for (int i = 0; i < n * k / 2; ++i) {
		auto [value, j] = *cands.rbegin();
		ans += value;

		pw[1][j].push_back(sorted[j][m - sz(pw[1][j]) - 1]);
		pw[0][j].pop_back();

		cands.erase(--cands.end());

		if (sz(pw[0][j])) {
			int cval = d[j][sorted[j][m - sz(pw[1][j]) - 1]] + d[j][pw[0][j].back()];
			cands.insert({cval, j});
		}
	}

	// int sz0 = 0, sz1 = 0;
	// for (int i = 0; i < n; ++i) {
	// 	vector<int> indexes = pw[0][i];
	// 	indexes.insert(end(indexes), all(pw[1][i]));
	// 	sort(all(indexes));
	// 	assert(unique(all(indexes)) == end(indexes));
	// 	assert(sz(pw[0][i]) + sz(pw[1][i]) == k);
	// 	sz0 += sz(pw[0][i]);
	// 	sz1 += sz(pw[1][i]);
	// }
	// assert(sz0 == n * k / 2 && sz1 == n * k / 2);

	set<pair<int, int>> where;
	for (int i = 0; i < n; ++i) {
		where.insert({sz(pw[0][i]), i});
	}

	vector s(n, vector(m, -1));

	for (int i = 0; i < k; ++i) {
		set<pair<int, int>> nwhere;
		
		auto it = where.begin();
		for (int j = 0; j < n; ++j, ++it) {
			auto [val, x] = *it;
			if (2 * j >= n) {
				s[x][pw[0][x].back()] = i;
				pw[0][x].pop_back();
				nwhere.insert({val - 1, x});
			} else {
				s[x][pw[1][x].back()] = i;
				pw[1][x].pop_back();
				nwhere.insert({val, x});
			}
		}
		where = nwhere;
	}

	// vector<int> good(m, -1);
	// iota(end(good) - k, end(good), 0);
	// for (int i = 0; i < n; ++i) {
	// 	auto c = s[i];
	// 	sort(all(c));
	// 	assert(good == c);
	// }
	allocate_tickets(s);
	return ans;	
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 4 ms 980 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 30 ms 3656 KB Output is correct
6 Correct 790 ms 80160 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 29 ms 4160 KB Output is correct
6 Correct 900 ms 89328 KB Output is correct
7 Correct 989 ms 90156 KB Output is correct
8 Correct 5 ms 828 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 11 ms 1384 KB Output is correct
13 Correct 27 ms 3700 KB Output is correct
14 Correct 27 ms 3680 KB Output is correct
15 Correct 1000 ms 102628 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 53 ms 4668 KB Output is correct
6 Correct 7 ms 1076 KB Output is correct
7 Correct 11 ms 1548 KB Output is correct
8 Correct 1593 ms 98804 KB Output is correct
9 Correct 1375 ms 92668 KB Output is correct
10 Correct 1427 ms 91264 KB Output is correct
11 Correct 1670 ms 97724 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 772 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 724 KB Output is correct
3 Correct 3 ms 724 KB Output is correct
4 Correct 3 ms 724 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 4 ms 772 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 4 ms 724 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 4 ms 724 KB Output is correct
12 Correct 4 ms 724 KB Output is correct
13 Correct 30 ms 3652 KB Output is correct
14 Correct 50 ms 3728 KB Output is correct
15 Correct 46 ms 4120 KB Output is correct
16 Correct 57 ms 4588 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 5 ms 724 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 41 ms 4028 KB Output is correct
21 Correct 44 ms 4008 KB Output is correct
22 Correct 46 ms 4452 KB Output is correct
23 Correct 46 ms 4452 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 468 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 30 ms 3656 KB Output is correct
12 Correct 790 ms 80160 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 0 ms 352 KB Output is correct
16 Correct 3 ms 724 KB Output is correct
17 Correct 29 ms 4160 KB Output is correct
18 Correct 900 ms 89328 KB Output is correct
19 Correct 989 ms 90156 KB Output is correct
20 Correct 5 ms 828 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 11 ms 1384 KB Output is correct
25 Correct 27 ms 3700 KB Output is correct
26 Correct 27 ms 3680 KB Output is correct
27 Correct 1000 ms 102628 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 3 ms 724 KB Output is correct
32 Correct 53 ms 4668 KB Output is correct
33 Correct 7 ms 1076 KB Output is correct
34 Correct 11 ms 1548 KB Output is correct
35 Correct 1593 ms 98804 KB Output is correct
36 Correct 1375 ms 92668 KB Output is correct
37 Correct 1427 ms 91264 KB Output is correct
38 Correct 1670 ms 97724 KB Output is correct
39 Correct 1 ms 340 KB Output is correct
40 Correct 2 ms 724 KB Output is correct
41 Correct 3 ms 724 KB Output is correct
42 Correct 3 ms 724 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 4 ms 772 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 4 ms 724 KB Output is correct
48 Correct 4 ms 724 KB Output is correct
49 Correct 4 ms 724 KB Output is correct
50 Correct 4 ms 724 KB Output is correct
51 Correct 30 ms 3652 KB Output is correct
52 Correct 50 ms 3728 KB Output is correct
53 Correct 46 ms 4120 KB Output is correct
54 Correct 57 ms 4588 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 5 ms 724 KB Output is correct
57 Correct 3 ms 596 KB Output is correct
58 Correct 41 ms 4028 KB Output is correct
59 Correct 44 ms 4008 KB Output is correct
60 Correct 46 ms 4452 KB Output is correct
61 Correct 46 ms 4452 KB Output is correct
62 Correct 86 ms 11820 KB Output is correct
63 Correct 78 ms 11880 KB Output is correct
64 Correct 153 ms 13540 KB Output is correct
65 Correct 543 ms 49072 KB Output is correct
66 Correct 644 ms 52444 KB Output is correct
67 Correct 14 ms 1632 KB Output is correct
68 Correct 7 ms 1208 KB Output is correct
69 Correct 785 ms 102100 KB Output is correct
70 Correct 1215 ms 111184 KB Output is correct
71 Correct 1523 ms 120472 KB Output is correct
72 Correct 1317 ms 103260 KB Output is correct
73 Correct 1472 ms 115500 KB Output is correct
74 Correct 1102 ms 94692 KB Output is correct
75 Correct 1260 ms 107200 KB Output is correct