oj.uz

Submission #300932

# Submission time Handle Problem Language Result Execution time Memory
300932 2020-09-17T15:16:27 Z Sorting Carnival Tickets (IOI20_tickets) C++17
100 / 100
 931 ms 54264 KB 
#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> c(n, vector<int>(m, -1));

	int iter = n / 2 * k;
	priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>> pq;
	long long ans = 0;
	vector<int> pos(n, 0);

	for(int i = 0; i < n; ++i)
		for(int j = m - k; j < m; ++j)
			ans += x[i][j];

	for(int i = 0; i < n; ++i)
		pq.push({x[i][0] + x[i][m - k], i});

	for(int i = 0; i < iter; ++i){
		auto [sub, idx] = pq.top();
		pq.pop();

		ans -= sub;
		pos[idx]++;
		if(pos[idx] + m - k < m)
			pq.push({x[idx][pos[idx]] + x[idx][pos[idx] + m - k], idx});
	}

	int idx = 0;
	for(int i = 0; i < n; ++i){
		int j1 = 0, j2 = pos[i] + m - k;
		while(j1 != pos[i]){
			c[i][j1] = idx;
			idx++, j1++;
			if(idx == k) idx = 0;
		}
		int idx2 = idx;
		while(j2 != m){
			c[i][j2] = idx2;
			idx2++, j2++;
			if(idx2 == k) idx2 = 0;
		}
	}
	
	allocate_tickets(c);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 4 ms 512 KB Output is correct
5 Correct 41 ms 2424 KB Output is correct
6 Correct 762 ms 51404 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 25 ms 2432 KB Output is correct
6 Correct 697 ms 52344 KB Output is correct
7 Correct 670 ms 52816 KB Output is correct
8 Correct 3 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 10 ms 896 KB Output is correct
13 Correct 21 ms 2080 KB Output is correct
14 Correct 21 ms 2048 KB Output is correct
15 Correct 662 ms 53384 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 2484 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 9 ms 896 KB Output is correct
8 Correct 931 ms 54264 KB Output is correct
9 Correct 899 ms 50600 KB Output is correct
10 Correct 872 ms 50688 KB Output is correct
11 Correct 897 ms 54256 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 416 KB Output is correct
7 Correct 1 ms 384 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 2 ms 512 KB Output is correct
12 Correct 4 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 416 KB Output is correct
7 Correct 1 ms 384 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 2 ms 512 KB Output is correct
12 Correct 4 ms 512 KB Output is correct
13 Correct 30 ms 2464 KB Output is correct
14 Correct 30 ms 2424 KB Output is correct
15 Correct 32 ms 2424 KB Output is correct
16 Correct 34 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 41 ms 2296 KB Output is correct
21 Correct 38 ms 2424 KB Output is correct
22 Correct 29 ms 2432 KB Output is correct
23 Correct 36 ms 2424 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 4 ms 512 KB Output is correct
11 Correct 41 ms 2424 KB Output is correct
12 Correct 762 ms 51404 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 25 ms 2432 KB Output is correct
18 Correct 697 ms 52344 KB Output is correct
19 Correct 670 ms 52816 KB Output is correct
20 Correct 3 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 10 ms 896 KB Output is correct
25 Correct 21 ms 2080 KB Output is correct
26 Correct 21 ms 2048 KB Output is correct
27 Correct 662 ms 53384 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 2484 KB Output is correct
33 Correct 6 ms 640 KB Output is correct
34 Correct 9 ms 896 KB Output is correct
35 Correct 931 ms 54264 KB Output is correct
36 Correct 899 ms 50600 KB Output is correct
37 Correct 872 ms 50688 KB Output is correct
38 Correct 897 ms 54256 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 416 KB Output is correct
45 Correct 1 ms 384 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 2 ms 512 KB Output is correct
50 Correct 4 ms 512 KB Output is correct
51 Correct 30 ms 2464 KB Output is correct
52 Correct 30 ms 2424 KB Output is correct
53 Correct 32 ms 2424 KB Output is correct
54 Correct 34 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 41 ms 2296 KB Output is correct
59 Correct 38 ms 2424 KB Output is correct
60 Correct 29 ms 2432 KB Output is correct
61 Correct 36 ms 2424 KB Output is correct
62 Correct 83 ms 6008 KB Output is correct
63 Correct 100 ms 6008 KB Output is correct
64 Correct 107 ms 6392 KB Output is correct
65 Correct 405 ms 23548 KB Output is correct
66 Correct 406 ms 24068 KB Output is correct
67 Correct 10 ms 896 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 747 ms 51380 KB Output is correct
70 Correct 834 ms 52348 KB Output is correct
71 Correct 908 ms 54264 KB Output is correct
72 Correct 739 ms 52280 KB Output is correct
73 Correct 846 ms 52200 KB Output is correct
74 Correct 665 ms 50840 KB Output is correct
75 Correct 788 ms 50692 KB Output is correct