oj.uz

Submission #586541

# Submission time Handle Problem Language Result Execution time Memory
586541 2022-06-30T11:31:22 Z Drew_ Carnival Tickets (IOI20_tickets) C++17
100 / 100
 859 ms 84376 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define f1 first
#define s2 second

using ii = pair<int, int>;
using ll = long long;

ll find_maximum(int K, vector<vector<int>> V)
{
	int N = (int)V.size(), M = (int)V[0].size();

	ll sum = 0;
	vector<vector<int>> ans(N, vector<int> (M, -1));

	vector<ii> vec;
	vector<int> lt(N, 0), rt(N, K);
	for (int i = 0; i < N; ++i)
	{
		for (int j = M-K; j < M; ++j)
		{
			sum += V[i][j];
			vec.pb({-V[i][j] - V[i][j - (M-K)], i});
		}
	}
	sort(vec.rbegin(), vec.rend());

	for (int i = 0; i < N*K/2; ++i)
		sum += vec[i].f1, lt[vec[i].s2]++, rt[vec[i].s2]--;
	
	vector<vector<bool>> used(N, vector<bool>(K, false));
	for (int i = 0, ctr = 0; i < N; ++i)
	{
		for (int j = 0; j < lt[i]; ++j)
		{
			ans[i][j] = ctr; used[i][ctr] = true;
			ctr = (ctr + 1) % K;
		}
	}

	for (int i = 0; i < N; ++i)
	{
		for (int j = M - rt[i], k = 0; j < M; ++j)
		{
			while (used[i][k]) ++k;
			ans[i][j] = k++;
		}
	}

	allocate_tickets(ans);
	return sum;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 20 ms 3252 KB Output is correct
6 Correct 467 ms 73180 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 18 ms 2636 KB Output is correct
6 Correct 451 ms 58088 KB Output is correct
7 Correct 456 ms 60960 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 17 ms 2380 KB Output is correct
14 Correct 15 ms 2384 KB Output is correct
15 Correct 458 ms 63316 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 28 ms 3656 KB Output is correct
6 Correct 5 ms 808 KB Output is correct
7 Correct 7 ms 1116 KB Output is correct
8 Correct 715 ms 84300 KB Output is correct
9 Correct 660 ms 78736 KB Output is correct
10 Correct 643 ms 78752 KB Output is correct
11 Correct 722 ms 84376 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 440 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 3 ms 440 KB Output is correct
5 Correct 2 ms 496 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 18 ms 3156 KB Output is correct
14 Correct 19 ms 3248 KB Output is correct
15 Correct 24 ms 3308 KB Output is correct
16 Correct 28 ms 3652 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 25 ms 2800 KB Output is correct
21 Correct 23 ms 3268 KB Output is correct
22 Correct 24 ms 2992 KB Output is correct
23 Correct 29 ms 3512 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 824 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 20 ms 3252 KB Output is correct
12 Correct 467 ms 73180 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 436 KB Output is correct
17 Correct 18 ms 2636 KB Output is correct
18 Correct 451 ms 58088 KB Output is correct
19 Correct 456 ms 60960 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 860 KB Output is correct
25 Correct 17 ms 2380 KB Output is correct
26 Correct 15 ms 2384 KB Output is correct
27 Correct 458 ms 63316 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 28 ms 3656 KB Output is correct
33 Correct 5 ms 808 KB Output is correct
34 Correct 7 ms 1116 KB Output is correct
35 Correct 715 ms 84300 KB Output is correct
36 Correct 660 ms 78736 KB Output is correct
37 Correct 643 ms 78752 KB Output is correct
38 Correct 722 ms 84376 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 3 ms 468 KB Output is correct
42 Correct 3 ms 440 KB Output is correct
43 Correct 2 ms 496 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 304 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 18 ms 3156 KB Output is correct
52 Correct 19 ms 3248 KB Output is correct
53 Correct 24 ms 3308 KB Output is correct
54 Correct 28 ms 3652 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 25 ms 2800 KB Output is correct
59 Correct 23 ms 3268 KB Output is correct
60 Correct 24 ms 2992 KB Output is correct
61 Correct 29 ms 3512 KB Output is correct
62 Correct 60 ms 8396 KB Output is correct
63 Correct 51 ms 8504 KB Output is correct
64 Correct 74 ms 9668 KB Output is correct
65 Correct 289 ms 33760 KB Output is correct
66 Correct 300 ms 37816 KB Output is correct
67 Correct 5 ms 1116 KB Output is correct
68 Correct 4 ms 852 KB Output is correct
69 Correct 458 ms 73376 KB Output is correct
70 Correct 582 ms 75440 KB Output is correct
71 Correct 859 ms 84340 KB Output is correct
72 Correct 690 ms 68188 KB Output is correct
73 Correct 741 ms 80456 KB Output is correct
74 Correct 629 ms 61056 KB Output is correct
75 Correct 559 ms 73604 KB Output is correct