oj.uz

Submission #578296

# Submission time Handle Problem Language Result Execution time Memory
578296 2022-06-16T10:30:44 Z Vanilla Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1524 ms 195356 KB 
#include <bits/stdc++.h>
#include "tickets.h"
using namespace std;
 
struct el {
	long long x, y, idx;
 
	bool operator < (const el &oth) const {
		return y + x < oth.x + oth.y;
	}
};

struct val {
	long long v, x, y;

	bool operator < (const val &oth) const {
		if (v == oth.v) return x < oth.x;
		return v < oth.v;
	}
};
 
// bool comp (pair <long, long> a, pair <long, long> b) {
// 	if (a.first != b.first) return a.first < 
// }
 
long long find_maximum(int k, vector<vector<int>> x) {
	long long n = x.size();
	long long m = x[0].size();
	long long rs = 0;
	vector <int> times (n, 1);
	vector <vector <int> > answer (n, vector <int> (m, -1));
	vector <vector <bool> > take (n, vector <bool> (m, 0));
	priority_queue <el> pq;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < k; j++){
			rs-=x[i][j];
			take[i][j] = 1;
		}
		pq.push({x[i][k-1], x[i][m-1], i});
	}
	for (int z = 0; z < n * k / 2; z++){
		el now = pq.top();
		pq.pop();
		rs+=now.x + now.y;
		take[now.idx][k - times[now.idx]] = 0;
		take[now.idx][m - times[now.idx]] = 1;
		if (times[now.idx] != k) {
			times[now.idx]++;
			now.x = x[now.idx][k - times[now.idx]];
			now.y = x[now.idx][m - times[now.idx]];
			pq.push(now);
		}
	}
	vector <val> v;
	for (int i = 0; i < n; i++){
		for (int j = 0; j < m; j++){
			if (take[i][j]) {
				v.push_back({x[i][j], i, j});
			}
		}
	}
	sort(v.begin(), v.end());
	// for (auto i: v){
	// 	cout << i.v << " "  <<i.x << " " << i.y << "\n";
	// }
	vector <int> col (n);
	vector <set <int> > nt (n, set <int> ());
	vector <pair <int, int> > suka;
	for (int i = 0; i < n * k / 2; i++){
		suka.push_back({v[i].x, v[i].y});
	}
	sort(suka.begin(), suka.end());
	for (int i = 0; i < n; i++){
		for (int j = 0; j < k; j++){
			nt[i].insert(j);
		}
	}
	for (int i = 0; i < n * k / 2; i++){
		answer[suka[i].first][suka[i].second] = i % k;
		nt[suka[i].first].erase(i % k);
	}
	for (int i = n * k / 2; i < n * k; i++){
		answer[v[i].x][v[i].y] = *nt[v[i].x].begin();
		nt[v[i].x].erase(nt[v[i].x].begin());

	}
	allocate_tickets(answer);
	return rs;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 2 ms 952 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 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 22 ms 2676 KB Output is correct
6 Correct 511 ms 52068 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 3 ms 596 KB Output is correct
5 Correct 36 ms 4948 KB Output is correct
6 Correct 764 ms 111212 KB Output is correct
7 Correct 824 ms 139288 KB Output is correct
8 Correct 5 ms 1236 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1776 KB Output is correct
13 Correct 26 ms 5128 KB Output is correct
14 Correct 31 ms 5832 KB Output is correct
15 Correct 890 ms 161416 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 4 ms 920 KB Output is correct
5 Correct 57 ms 8556 KB Output is correct
6 Correct 11 ms 1720 KB Output is correct
7 Correct 9 ms 2020 KB Output is correct
8 Correct 1524 ms 195332 KB Output is correct
9 Correct 1418 ms 182420 KB Output is correct
10 Correct 1400 ms 182380 KB Output is correct
11 Correct 1504 ms 195240 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 436 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 820 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 696 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 792 KB Output is correct
12 Correct 4 ms 792 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 436 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 820 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 696 KB Output is correct
10 Correct 3 ms 724 KB Output is correct
11 Correct 3 ms 792 KB Output is correct
12 Correct 4 ms 792 KB Output is correct
13 Correct 21 ms 2864 KB Output is correct
14 Correct 23 ms 2892 KB Output is correct
15 Correct 36 ms 5232 KB Output is correct
16 Correct 54 ms 8528 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 696 KB Output is correct
19 Correct 2 ms 436 KB Output is correct
20 Correct 36 ms 6092 KB Output is correct
21 Correct 40 ms 6172 KB Output is correct
22 Correct 45 ms 7980 KB Output is correct
23 Correct 47 ms 7884 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 2 ms 952 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 300 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 22 ms 2676 KB Output is correct
12 Correct 511 ms 52068 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 3 ms 596 KB Output is correct
17 Correct 36 ms 4948 KB Output is correct
18 Correct 764 ms 111212 KB Output is correct
19 Correct 824 ms 139288 KB Output is correct
20 Correct 5 ms 1236 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 8 ms 1776 KB Output is correct
25 Correct 26 ms 5128 KB Output is correct
26 Correct 31 ms 5832 KB Output is correct
27 Correct 890 ms 161416 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 4 ms 920 KB Output is correct
32 Correct 57 ms 8556 KB Output is correct
33 Correct 11 ms 1720 KB Output is correct
34 Correct 9 ms 2020 KB Output is correct
35 Correct 1524 ms 195332 KB Output is correct
36 Correct 1418 ms 182420 KB Output is correct
37 Correct 1400 ms 182380 KB Output is correct
38 Correct 1504 ms 195240 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 436 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 3 ms 820 KB Output is correct
45 Correct 1 ms 300 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 696 KB Output is correct
48 Correct 3 ms 724 KB Output is correct
49 Correct 3 ms 792 KB Output is correct
50 Correct 4 ms 792 KB Output is correct
51 Correct 21 ms 2864 KB Output is correct
52 Correct 23 ms 2892 KB Output is correct
53 Correct 36 ms 5232 KB Output is correct
54 Correct 54 ms 8528 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 696 KB Output is correct
57 Correct 2 ms 436 KB Output is correct
58 Correct 36 ms 6092 KB Output is correct
59 Correct 40 ms 6172 KB Output is correct
60 Correct 45 ms 7980 KB Output is correct
61 Correct 47 ms 7884 KB Output is correct
62 Correct 56 ms 6552 KB Output is correct
63 Correct 56 ms 6588 KB Output is correct
64 Correct 152 ms 22472 KB Output is correct
65 Correct 424 ms 50008 KB Output is correct
66 Correct 677 ms 87184 KB Output is correct
67 Correct 9 ms 2176 KB Output is correct
68 Correct 8 ms 1752 KB Output is correct
69 Correct 479 ms 52400 KB Output is correct
70 Correct 1014 ms 111480 KB Output is correct
71 Correct 1512 ms 195356 KB Output is correct
72 Correct 1196 ms 183096 KB Output is correct
73 Correct 1364 ms 178140 KB Output is correct
74 Correct 849 ms 116236 KB Output is correct
75 Correct 996 ms 113320 KB Output is correct