oj.uz

Submission #777369

# Submission time Handle Problem Language Result Execution time Memory
777369 2023-07-09T07:10:27 Z Trisanu_Das Carnival Tickets (IOI20_tickets) C++17
100 / 100
 549 ms 75144 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
 
#define R(i,n,...) for(int i=__VA_ARGS__+0; i<(n); ++i)
struct pii {
	int x, i;
	bool operator<(const pii b) const { return x<b.x; }
};
ll find_maximum(int K, vector<vector<int>> A) {
	const int N=A.size();
	const int M=A[0].size();
	const int X=N*K/2;
	ll sum=0;
	vector<pii> B(N*K);
	R(i, N) {
		R(j, K) {
			sum+=A[i][M-K+j];
			B[i*K+j]={A[i][M-K+j]+A[i][j], i};
		}
		fill(begin(A[i]), end(A[i]), -1);
	}
	sort(begin(B), end(B));
 
	vector<int> C(N);
	int l=0;
	R(i, X) sum-=B[i].x, C[B[i].i]++;
	R(i, N) {
		R(j, C[i]) A[i][j]=++l%=K;
		int r=l;
		R(j, K-C[i]) A[i][M-j-1]=++r%=K;
	}
	allocate_tickets(A);
	return sum;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 360 KB Output is correct
5 Correct 18 ms 2872 KB Output is correct
6 Correct 408 ms 64256 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 0 ms 212 KB Output is correct
4 Correct 2 ms 388 KB Output is correct
5 Correct 15 ms 2192 KB Output is correct
6 Correct 357 ms 48916 KB Output is correct
7 Correct 449 ms 51816 KB Output is correct
8 Correct 2 ms 468 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 4 ms 764 KB Output is correct
13 Correct 12 ms 1972 KB Output is correct
14 Correct 13 ms 2076 KB Output is correct
15 Correct 378 ms 54212 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 21 ms 3256 KB Output is correct
6 Correct 4 ms 852 KB Output is correct
7 Correct 4 ms 956 KB Output is correct
8 Correct 549 ms 75060 KB Output is correct
9 Correct 502 ms 70172 KB Output is correct
10 Correct 516 ms 70244 KB Output is correct
11 Correct 542 ms 75144 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 444 KB Output is correct
6 Correct 2 ms 444 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 2 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 1 ms 292 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 2 ms 444 KB Output is correct
6 Correct 2 ms 444 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 440 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 21 ms 2816 KB Output is correct
14 Correct 18 ms 2836 KB Output is correct
15 Correct 23 ms 3024 KB Output is correct
16 Correct 27 ms 3240 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 436 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 16 ms 2472 KB Output is correct
21 Correct 19 ms 2900 KB Output is correct
22 Correct 17 ms 2616 KB Output is correct
23 Correct 20 ms 3140 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 360 KB Output is correct
11 Correct 18 ms 2872 KB Output is correct
12 Correct 408 ms 64256 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 388 KB Output is correct
17 Correct 15 ms 2192 KB Output is correct
18 Correct 357 ms 48916 KB Output is correct
19 Correct 449 ms 51816 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 4 ms 764 KB Output is correct
25 Correct 12 ms 1972 KB Output is correct
26 Correct 13 ms 2076 KB Output is correct
27 Correct 378 ms 54212 KB Output is correct
28 Correct 1 ms 296 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 296 KB Output is correct
31 Correct 2 ms 508 KB Output is correct
32 Correct 21 ms 3256 KB Output is correct
33 Correct 4 ms 852 KB Output is correct
34 Correct 4 ms 956 KB Output is correct
35 Correct 549 ms 75060 KB Output is correct
36 Correct 502 ms 70172 KB Output is correct
37 Correct 516 ms 70244 KB Output is correct
38 Correct 542 ms 75144 KB Output is correct
39 Correct 1 ms 292 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 492 KB Output is correct
43 Correct 2 ms 444 KB Output is correct
44 Correct 2 ms 444 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 440 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 21 ms 2816 KB Output is correct
52 Correct 18 ms 2836 KB Output is correct
53 Correct 23 ms 3024 KB Output is correct
54 Correct 27 ms 3240 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 436 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 16 ms 2472 KB Output is correct
59 Correct 19 ms 2900 KB Output is correct
60 Correct 17 ms 2616 KB Output is correct
61 Correct 20 ms 3140 KB Output is correct
62 Correct 48 ms 7332 KB Output is correct
63 Correct 45 ms 7376 KB Output is correct
64 Correct 59 ms 8524 KB Output is correct
65 Correct 207 ms 29652 KB Output is correct
66 Correct 242 ms 33492 KB Output is correct
67 Correct 5 ms 980 KB Output is correct
68 Correct 5 ms 852 KB Output is correct
69 Correct 389 ms 64360 KB Output is correct
70 Correct 472 ms 66220 KB Output is correct
71 Correct 541 ms 75016 KB Output is correct
72 Correct 406 ms 59244 KB Output is correct
73 Correct 507 ms 71448 KB Output is correct
74 Correct 392 ms 52256 KB Output is correct
75 Correct 449 ms 64640 KB Output is correct