oj.uz

Submission #513880

# Submission time Handle Problem Language Result Execution time Memory
513880 2022-01-17T20:36:17 Z AdamGS Carnival Tickets (IOI20_tickets) C++17
100 / 100
 703 ms 93900 KB 
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=1507;
ll T[LIM][LIM], akt[LIM], ilea[LIM], ileb[LIM], n, m;
ll find_maximum(int k, vector<vector<int>>V) {
	n=V.size();
	m=V[0].size();
	rep(i, n) rep(j, m) T[i][j]=V[i][j];
	ll sum=0;
	rep(i, n) rep(j, k) sum+=T[i][m-j-1];
	priority_queue<pair<ll,int>>q;
	rep(i, n) q.push({-T[i][0]-T[i][m-k], i});
	rep(i, n*k/2) {
		ll p=q.top().st, a=q.top().nd; q.pop();
		sum+=p;
		++akt[a];
		if(akt[a]<k) q.push({-T[a][akt[a]]-T[a][m-k+akt[a]], a});
	}
	vector<vector<int>>ans;
	rep(i, n) {
		vector<int>p;
		rep(j, m) p.pb(-1);
		ans.pb(p);
	}
	rep(i, k) {
		vector<pair<int,int>>p;
		rep(j, n) p.pb({akt[j]-ilea[j], j});
		sort(all(p));
		reverse(all(p));
		rep(j, n) {
			int x=p[j].nd;
			if(j<n/2) {
				ans[x][ilea[x]]=i;
				++ilea[x];
			} else {
				++ileb[x];
				ans[x][m-ileb[x]]=i;
			}
		}
	}
	allocate_tickets(ans);
	return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 1580 KB Output is correct
6 Correct 4 ms 6732 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 2 ms 836 KB Output is correct
5 Correct 25 ms 4584 KB Output is correct
6 Correct 458 ms 69348 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 828 KB Output is correct
5 Correct 24 ms 4400 KB Output is correct
6 Correct 489 ms 74524 KB Output is correct
7 Correct 503 ms 74904 KB Output is correct
8 Correct 3 ms 972 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 308 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 6 ms 1644 KB Output is correct
13 Correct 18 ms 4792 KB Output is correct
14 Correct 25 ms 3384 KB Output is correct
15 Correct 513 ms 75416 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 808 KB Output is correct
5 Correct 26 ms 5172 KB Output is correct
6 Correct 4 ms 844 KB Output is correct
7 Correct 10 ms 7116 KB Output is correct
8 Correct 680 ms 93900 KB Output is correct
9 Correct 655 ms 88752 KB Output is correct
10 Correct 669 ms 87652 KB Output is correct
11 Correct 696 ms 93800 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 2 ms 844 KB Output is correct
4 Correct 3 ms 828 KB Output is correct
5 Correct 2 ms 844 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 2 ms 844 KB Output is correct
10 Correct 2 ms 844 KB Output is correct
11 Correct 3 ms 844 KB Output is correct
12 Correct 2 ms 844 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 844 KB Output is correct
3 Correct 2 ms 844 KB Output is correct
4 Correct 3 ms 828 KB Output is correct
5 Correct 2 ms 844 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 2 ms 844 KB Output is correct
10 Correct 2 ms 844 KB Output is correct
11 Correct 3 ms 844 KB Output is correct
12 Correct 2 ms 844 KB Output is correct
13 Correct 20 ms 5160 KB Output is correct
14 Correct 28 ms 5096 KB Output is correct
15 Correct 23 ms 5104 KB Output is correct
16 Correct 25 ms 5196 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 2 ms 1592 KB Output is correct
20 Correct 23 ms 4560 KB Output is correct
21 Correct 24 ms 5036 KB Output is correct
22 Correct 24 ms 4520 KB Output is correct
23 Correct 26 ms 5036 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 1580 KB Output is correct
6 Correct 4 ms 6732 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 300 KB Output is correct
10 Correct 2 ms 836 KB Output is correct
11 Correct 25 ms 4584 KB Output is correct
12 Correct 458 ms 69348 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 828 KB Output is correct
17 Correct 24 ms 4400 KB Output is correct
18 Correct 489 ms 74524 KB Output is correct
19 Correct 503 ms 74904 KB Output is correct
20 Correct 3 ms 972 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 308 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 6 ms 1644 KB Output is correct
25 Correct 18 ms 4792 KB Output is correct
26 Correct 25 ms 3384 KB Output is correct
27 Correct 513 ms 75416 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 2 ms 808 KB Output is correct
32 Correct 26 ms 5172 KB Output is correct
33 Correct 4 ms 844 KB Output is correct
34 Correct 10 ms 7116 KB Output is correct
35 Correct 680 ms 93900 KB Output is correct
36 Correct 655 ms 88752 KB Output is correct
37 Correct 669 ms 87652 KB Output is correct
38 Correct 696 ms 93800 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 2 ms 844 KB Output is correct
41 Correct 2 ms 844 KB Output is correct
42 Correct 3 ms 828 KB Output is correct
43 Correct 2 ms 844 KB Output is correct
44 Correct 2 ms 844 KB Output is correct
45 Correct 1 ms 308 KB Output is correct
46 Correct 1 ms 588 KB Output is correct
47 Correct 2 ms 844 KB Output is correct
48 Correct 2 ms 844 KB Output is correct
49 Correct 3 ms 844 KB Output is correct
50 Correct 2 ms 844 KB Output is correct
51 Correct 20 ms 5160 KB Output is correct
52 Correct 28 ms 5096 KB Output is correct
53 Correct 23 ms 5104 KB Output is correct
54 Correct 25 ms 5196 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 2 ms 1740 KB Output is correct
57 Correct 2 ms 1592 KB Output is correct
58 Correct 23 ms 4560 KB Output is correct
59 Correct 24 ms 5036 KB Output is correct
60 Correct 24 ms 4520 KB Output is correct
61 Correct 26 ms 5036 KB Output is correct
62 Correct 56 ms 12356 KB Output is correct
63 Correct 55 ms 12428 KB Output is correct
64 Correct 72 ms 12568 KB Output is correct
65 Correct 252 ms 45052 KB Output is correct
66 Correct 300 ms 45396 KB Output is correct
67 Correct 9 ms 7116 KB Output is correct
68 Correct 5 ms 876 KB Output is correct
69 Correct 484 ms 90916 KB Output is correct
70 Correct 574 ms 91812 KB Output is correct
71 Correct 662 ms 93736 KB Output is correct
72 Correct 603 ms 78340 KB Output is correct
73 Correct 703 ms 90548 KB Output is correct
74 Correct 506 ms 76804 KB Output is correct
75 Correct 571 ms 89024 KB Output is correct