답안 #782715

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782715 2023-07-14T08:17:16 Z Josia 카니발 티켓 (IOI20_tickets) C++17
100 / 100
1120 ms 155836 KB
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

#define int long long

int find_maximum(signed k, std::vector<std::vector<signed>> x) {
	
	int colors = x.size();
	int ticketsPerColor = x[0].size();


	priority_queue<array<int, 4>> pq;	// val, col, indO, indN;

	int res = 0;

	for (int i=0; i<colors; i++) {
		for (int j = 0; j<k; j++) {
			res -= x[i][j];
			pq.push({x[i][j] + x[i][ticketsPerColor-(k-j)], i, j, ticketsPerColor-(k-j)});
		}
	}

	vector<pair<int, int>> numused(colors);

	for (int i = 0; i<colors; i++) numused[i].second = i;


	for (int i = 0; i<colors*k/2; i++) {
		res += pq.top()[0];
		numused[pq.top()[1]].first++;
		// used[pq.top()[1]][pq.top()[2]] = 0;
		// used[pq.top()[1]][pq.top()[3]] = 2;
		pq.pop();
	}



	set<pair<int, int>> blub;

	for (auto i: numused) blub.insert(i);

	vector<pair<int, int>> bounds(colors, {0, ticketsPerColor-1});

	vector<vector<signed>> ass(colors, vector<signed>(ticketsPerColor, -1));

	for (int i = 0; i<k; i++) {
		vector<pair<int, int>> round;
		for (int j = 0; j<colors/2; j++) {
			round.push_back(*blub.begin());
			blub.erase(blub.begin());

			ass[round.back().second][bounds[round.back().second].first] = i;
			bounds[round.back().second].first++;
		}
		for (int j = 0; j<colors/2; j++) {
			round.push_back(*blub.rbegin());
			blub.erase(*blub.rbegin());

			ass[round.back().second][bounds[round.back().second].second] = i;
			bounds[round.back().second].second--;

			round.back().first--;
		}

		for (auto i: round) blub.insert(i);
	}
	




	allocate_tickets(ass);


	return res;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 340 KB Output is correct
5 Correct 17 ms 2356 KB Output is correct
6 Correct 410 ms 51460 KB Output is correct
# 결과 실행 시간 메모리 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 640 KB Output is correct
5 Correct 23 ms 3732 KB Output is correct
6 Correct 600 ms 88116 KB Output is correct
7 Correct 693 ms 96124 KB Output is correct
8 Correct 4 ms 980 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 1228 KB Output is correct
13 Correct 22 ms 3540 KB Output is correct
14 Correct 24 ms 3788 KB Output is correct
15 Correct 860 ms 105516 KB Output is correct
# 결과 실행 시간 메모리 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 4 ms 852 KB Output is correct
5 Correct 35 ms 6020 KB Output is correct
6 Correct 5 ms 1204 KB Output is correct
7 Correct 7 ms 1488 KB Output is correct
8 Correct 1047 ms 151300 KB Output is correct
9 Correct 1026 ms 150116 KB Output is correct
10 Correct 1047 ms 150116 KB Output is correct
11 Correct 1054 ms 151412 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 532 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 696 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 700 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 532 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 696 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 2 ms 596 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 700 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 16 ms 3280 KB Output is correct
14 Correct 17 ms 3252 KB Output is correct
15 Correct 25 ms 4360 KB Output is correct
16 Correct 41 ms 6064 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 29 ms 4248 KB Output is correct
21 Correct 28 ms 4696 KB Output is correct
22 Correct 33 ms 5572 KB Output is correct
23 Correct 34 ms 6056 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 17 ms 2356 KB Output is correct
12 Correct 410 ms 51460 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 300 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 640 KB Output is correct
17 Correct 23 ms 3732 KB Output is correct
18 Correct 600 ms 88116 KB Output is correct
19 Correct 693 ms 96124 KB Output is correct
20 Correct 4 ms 980 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 8 ms 1228 KB Output is correct
25 Correct 22 ms 3540 KB Output is correct
26 Correct 24 ms 3788 KB Output is correct
27 Correct 860 ms 105516 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 4 ms 852 KB Output is correct
32 Correct 35 ms 6020 KB Output is correct
33 Correct 5 ms 1204 KB Output is correct
34 Correct 7 ms 1488 KB Output is correct
35 Correct 1047 ms 151300 KB Output is correct
36 Correct 1026 ms 150116 KB Output is correct
37 Correct 1047 ms 150116 KB Output is correct
38 Correct 1054 ms 151412 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 532 KB Output is correct
41 Correct 2 ms 436 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 696 KB Output is correct
44 Correct 3 ms 724 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 2 ms 596 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 3 ms 700 KB Output is correct
50 Correct 3 ms 724 KB Output is correct
51 Correct 16 ms 3280 KB Output is correct
52 Correct 17 ms 3252 KB Output is correct
53 Correct 25 ms 4360 KB Output is correct
54 Correct 41 ms 6064 KB Output is correct
55 Correct 1 ms 312 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 29 ms 4248 KB Output is correct
59 Correct 28 ms 4696 KB Output is correct
60 Correct 33 ms 5572 KB Output is correct
61 Correct 34 ms 6056 KB Output is correct
62 Correct 43 ms 8488 KB Output is correct
63 Correct 46 ms 8360 KB Output is correct
64 Correct 95 ms 15528 KB Output is correct
65 Correct 290 ms 42904 KB Output is correct
66 Correct 440 ms 58660 KB Output is correct
67 Correct 7 ms 1488 KB Output is correct
68 Correct 5 ms 1108 KB Output is correct
69 Correct 409 ms 53416 KB Output is correct
70 Correct 690 ms 85596 KB Output is correct
71 Correct 1120 ms 151408 KB Output is correct
72 Correct 945 ms 155836 KB Output is correct
73 Correct 1012 ms 108736 KB Output is correct
74 Correct 692 ms 90172 KB Output is correct
75 Correct 719 ms 85092 KB Output is correct