oj.uz

Submission #302919

# Submission time Handle Problem Language Result Execution time Memory
302919 2020-09-19T12:11:48 Z FelixMP Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1088 ms 54520 KB 
#include "tickets.h"
#include <vector>
#include <set>
#include <algorithm>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	ll ansv = 0;


	vi curidx = vi(n, 0);

	set<ii> curmin;
	for(int i=0; i < n; ++i) {
		curmin.insert(ii(x[i][0] + x[i][m-k], i));
		for(int j=m-k; j < m; ++j) {
			ansv += x[i][j];
		}
	}

	for(int z=0; z < (n/2)*k; ++z) {
		ii p = *(curmin.begin());
		curmin.erase(curmin.begin());
		ansv -= p.first;
		int i = p.second;
		curidx[i]++;
		if(curidx[i]+m-k < m) {
			curmin.insert(ii(x[i][curidx[i]] + x[i][curidx[i]+m-k], i));
		}
	}

	vvi answer = vvi(n, vi(m, -1));
	vi cnt = vi(curidx);
	vi pi = vi(n, m-1);
	vi ni = vi(n, 0);
	for(int z=0; z < k; ++z) {
		vector<ii> sv (n);
		for(int i=0; i < n; ++i) sv[i] = ii(cnt[i], i);
		sort(sv.begin(), sv.end());
		for(int j=0; j < n; ++j) {
			int i = sv[j].second;
			if(j < n/2) {
				answer[i][pi[i]] = z;
				pi[i]--;
			}
			else {
				answer[i][ni[i]] = z;
				ni[i]++;
				cnt[i]--;
			}
		}
	}

	allocate_tickets(answer);


	return ansv;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 29 ms 2432 KB Output is correct
6 Correct 715 ms 51520 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 26 ms 2424 KB Output is correct
6 Correct 650 ms 52600 KB Output is correct
7 Correct 698 ms 52904 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 23 ms 2048 KB Output is correct
14 Correct 24 ms 2040 KB Output is correct
15 Correct 729 ms 53368 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 40 ms 2424 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 1047 ms 54396 KB Output is correct
9 Correct 1029 ms 50680 KB Output is correct
10 Correct 1012 ms 50808 KB Output is correct
11 Correct 1088 ms 54520 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 29 ms 2400 KB Output is correct
14 Correct 31 ms 2424 KB Output is correct
15 Correct 35 ms 2424 KB Output is correct
16 Correct 40 ms 2424 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 32 ms 2340 KB Output is correct
21 Correct 38 ms 2424 KB Output is correct
22 Correct 36 ms 2424 KB Output is correct
23 Correct 39 ms 2456 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 29 ms 2432 KB Output is correct
12 Correct 715 ms 51520 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 26 ms 2424 KB Output is correct
18 Correct 650 ms 52600 KB Output is correct
19 Correct 698 ms 52904 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 7 ms 768 KB Output is correct
25 Correct 23 ms 2048 KB Output is correct
26 Correct 24 ms 2040 KB Output is correct
27 Correct 729 ms 53368 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 40 ms 2424 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 9 ms 896 KB Output is correct
35 Correct 1047 ms 54396 KB Output is correct
36 Correct 1029 ms 50680 KB Output is correct
37 Correct 1012 ms 50808 KB Output is correct
38 Correct 1088 ms 54520 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 3 ms 512 KB Output is correct
45 Correct 1 ms 256 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 29 ms 2400 KB Output is correct
52 Correct 31 ms 2424 KB Output is correct
53 Correct 35 ms 2424 KB Output is correct
54 Correct 40 ms 2424 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 32 ms 2340 KB Output is correct
59 Correct 38 ms 2424 KB Output is correct
60 Correct 36 ms 2424 KB Output is correct
61 Correct 39 ms 2456 KB Output is correct
62 Correct 81 ms 6192 KB Output is correct
63 Correct 81 ms 6136 KB Output is correct
64 Correct 114 ms 6268 KB Output is correct
65 Correct 384 ms 23544 KB Output is correct
66 Correct 472 ms 24056 KB Output is correct
67 Correct 9 ms 896 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 709 ms 51448 KB Output is correct
70 Correct 892 ms 52600 KB Output is correct
71 Correct 1080 ms 54392 KB Output is correct
72 Correct 842 ms 52416 KB Output is correct
73 Correct 1042 ms 52344 KB Output is correct
74 Correct 727 ms 50808 KB Output is correct
75 Correct 896 ms 50808 KB Output is correct