oj.uz

Submission #308316

# Submission time Handle Problem Language Result Execution time Memory
308316 2020-09-30T22:53:32 Z sofapuden Carnival Tickets (IOI20_tickets) C++14
100 / 100
 916 ms 54392 KB 
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll find_maximum(int k, vector<vector<int>> x) {
	priority_queue<pair<int,int>> PQ;
	ll n = x.size();
	ll m = x[0].size();
	vector<vector<int>> ans(n, vector<int> (m,-1));
	vector<int> go(n,0);
	ll out = 0;
	for(int i = 0; i < n; ++i){
		for(int j = 0; j < k; ++j){
			out-=x[i][j];
		}
		PQ.push({x[i][k-1]+x[i][m-1], i});
	}
	ll cn = 0;
	while(cn++ < (n/2)*k){
		auto now = PQ.top();
		out+=now.first;
		PQ.pop();
		if(++go[now.second] != k){
			PQ.push({x[now.second][k-1-go[now.second]]+x[now.second][m-1-go[now.second]],now.second});
		}
	}
	cn = 0;
	for(int i = 0; i < n; ++i){
		for(int j = 0; j < k-go[i]; ++j){
			ans[i][j] = cn++;
			cn%=k;
		}
		if(go[i] == 0)continue;
		int cn2 = cn;
		for(int j = m-go[i]; j < m; ++j){
			ans[i][j] = cn2++;
			cn2%=k;
		}
			
	}
	allocate_tickets(ans);
	
	return out;
}

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 1 ms 256 KB Output is correct
4 Correct 1 ms 384 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 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 32 ms 2456 KB Output is correct
6 Correct 722 ms 51576 KB Output is correct

Subtask #3
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 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 24 ms 2432 KB Output is correct
6 Correct 598 ms 52472 KB Output is correct
7 Correct 632 ms 52856 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 22 ms 2040 KB Output is correct
14 Correct 25 ms 2040 KB Output is correct
15 Correct 670 ms 53436 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 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 35 ms 2516 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 7 ms 896 KB Output is correct
8 Correct 916 ms 54368 KB Output is correct
9 Correct 825 ms 50808 KB Output is correct
10 Correct 804 ms 50808 KB Output is correct
11 Correct 870 ms 54392 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 2 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 2 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 30 ms 2424 KB Output is correct
14 Correct 30 ms 2428 KB Output is correct
15 Correct 32 ms 2552 KB Output is correct
16 Correct 35 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 1 ms 384 KB Output is correct
20 Correct 26 ms 2304 KB Output is correct
21 Correct 32 ms 2424 KB Output is correct
22 Correct 27 ms 2432 KB Output is correct
23 Correct 33 ms 2424 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 1 ms 256 KB Output is correct
4 Correct 1 ms 384 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 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 32 ms 2456 KB Output is correct
12 Correct 722 ms 51576 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 24 ms 2432 KB Output is correct
18 Correct 598 ms 52472 KB Output is correct
19 Correct 632 ms 52856 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 8 ms 896 KB Output is correct
25 Correct 22 ms 2040 KB Output is correct
26 Correct 25 ms 2040 KB Output is correct
27 Correct 670 ms 53436 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 35 ms 2516 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 7 ms 896 KB Output is correct
35 Correct 916 ms 54368 KB Output is correct
36 Correct 825 ms 50808 KB Output is correct
37 Correct 804 ms 50808 KB Output is correct
38 Correct 870 ms 54392 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 2 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 30 ms 2424 KB Output is correct
52 Correct 30 ms 2428 KB Output is correct
53 Correct 32 ms 2552 KB Output is correct
54 Correct 35 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 1 ms 384 KB Output is correct
58 Correct 26 ms 2304 KB Output is correct
59 Correct 32 ms 2424 KB Output is correct
60 Correct 27 ms 2432 KB Output is correct
61 Correct 33 ms 2424 KB Output is correct
62 Correct 84 ms 6128 KB Output is correct
63 Correct 84 ms 6008 KB Output is correct
64 Correct 97 ms 6264 KB Output is correct
65 Correct 355 ms 23436 KB Output is correct
66 Correct 392 ms 24184 KB Output is correct
67 Correct 7 ms 896 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 732 ms 51448 KB Output is correct
70 Correct 815 ms 52600 KB Output is correct
71 Correct 889 ms 54392 KB Output is correct
72 Correct 703 ms 52344 KB Output is correct
73 Correct 835 ms 52180 KB Output is correct
74 Correct 631 ms 50680 KB Output is correct
75 Correct 782 ms 50808 KB Output is correct