oj.uz

답안 #774836

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
774836 2023-07-06T04:02:31 Z ono_de206 카니발 티켓 (IOI20_tickets) C++14
100 / 100
 895 ms 125604 KB 
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

// #define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

long long find_maximum(int k, vector<vector<int>> a) {
	int n = a.size();
	int m = a[0].size();
	vector<vector<int>> ans(n, vector<int>(m, -1));
	vector<vector<int>> neg(n), pos(n);

	long long ret = 0;
	priority_queue<pair<long long, pair<int, int>>> q;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < k; j++) {
			ret -= 1LL * a[i][j];
			neg[i].pb(j);
			q.push({1LL * (a[i][j] + a[i][m - k + j]), {i, m - k + j}});
		}
	}

	for(int t = 0; t < n * k / 2; t++) {
		auto val = q.top();
		q.pop();
		ret += val.ff;
		int i = val.ss.ff;
		int j = val.ss.ss;
		neg[i].pop_back();
		pos[i].pb(j);
	}

	for(int i = 0; i < n; i++) {
		reverse(all(pos[i]));
	}

	for(int t = 0; t < k; t++) {
		vector<int> v(n);
		iota(all(v), 0);
		sort(all(v), [&](int x, int y) {
			return pos[x].size() > pos[y].size();
		});
		for(int j = 0; j < n / 2; j++) {
			int i = v[j];
			ans[i][pos[i].back()] = t;
			pos[i].pop_back();
		}
		for(int j = n / 2; j < n; j++) {
			int i = v[j];
			ans[i][neg[i].back()] = t;
			neg[i].pop_back();
		}
	}

	allocate_tickets(ans);
	return ret;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 1 ms 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 16 ms 3272 KB Output is correct
6 Correct 390 ms 53904 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 0 ms 304 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 18 ms 3432 KB Output is correct
6 Correct 466 ms 75748 KB Output is correct
7 Correct 544 ms 82640 KB Output is correct
8 Correct 3 ms 724 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 5 ms 1080 KB Output is correct
13 Correct 17 ms 3140 KB Output is correct
14 Correct 21 ms 3292 KB Output is correct
15 Correct 541 ms 95080 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 620 KB Output is correct
5 Correct 26 ms 5356 KB Output is correct
6 Correct 5 ms 1060 KB Output is correct
7 Correct 6 ms 1408 KB Output is correct
8 Correct 750 ms 125552 KB Output is correct
9 Correct 715 ms 123176 KB Output is correct
10 Correct 717 ms 122348 KB Output is correct
11 Correct 895 ms 125604 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 572 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 592 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 564 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 572 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 592 KB Output is correct
13 Correct 18 ms 3276 KB Output is correct
14 Correct 20 ms 3252 KB Output is correct
15 Correct 21 ms 4128 KB Output is correct
16 Correct 29 ms 5300 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 27 ms 3816 KB Output is correct
21 Correct 27 ms 4168 KB Output is correct
22 Correct 28 ms 4564 KB Output is correct
23 Correct 26 ms 5076 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 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 1 ms 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 296 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 16 ms 3272 KB Output is correct
12 Correct 390 ms 53904 KB Output is correct
13 Correct 1 ms 296 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 0 ms 304 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 18 ms 3432 KB Output is correct
18 Correct 466 ms 75748 KB Output is correct
19 Correct 544 ms 82640 KB Output is correct
20 Correct 3 ms 724 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 5 ms 1080 KB Output is correct
25 Correct 17 ms 3140 KB Output is correct
26 Correct 21 ms 3292 KB Output is correct
27 Correct 541 ms 95080 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 620 KB Output is correct
32 Correct 26 ms 5356 KB Output is correct
33 Correct 5 ms 1060 KB Output is correct
34 Correct 6 ms 1408 KB Output is correct
35 Correct 750 ms 125552 KB Output is correct
36 Correct 715 ms 123176 KB Output is correct
37 Correct 717 ms 122348 KB Output is correct
38 Correct 895 ms 125604 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 3 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 3 ms 564 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 1 ms 304 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 572 KB Output is correct
48 Correct 2 ms 564 KB Output is correct
49 Correct 2 ms 596 KB Output is correct
50 Correct 3 ms 592 KB Output is correct
51 Correct 18 ms 3276 KB Output is correct
52 Correct 20 ms 3252 KB Output is correct
53 Correct 21 ms 4128 KB Output is correct
54 Correct 29 ms 5300 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 27 ms 3816 KB Output is correct
59 Correct 27 ms 4168 KB Output is correct
60 Correct 28 ms 4564 KB Output is correct
61 Correct 26 ms 5076 KB Output is correct
62 Correct 48 ms 8376 KB Output is correct
63 Correct 56 ms 8516 KB Output is correct
64 Correct 73 ms 13428 KB Output is correct
65 Correct 287 ms 40996 KB Output is correct
66 Correct 312 ms 52256 KB Output is correct
67 Correct 8 ms 1428 KB Output is correct
68 Correct 4 ms 1104 KB Output is correct
69 Correct 388 ms 73300 KB Output is correct
70 Correct 591 ms 93364 KB Output is correct
71 Correct 797 ms 125600 KB Output is correct
72 Correct 666 ms 112108 KB Output is correct
73 Correct 705 ms 113152 KB Output is correct
74 Correct 549 ms 79244 KB Output is correct
75 Correct 545 ms 91188 KB Output is correct