oj.uz

답안 #823016

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823016 2023-08-12T07:03:54 Z ymm 카니발 티켓 (IOI20_tickets) C++17
100 / 100
 695 ms 83592 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
typedef long long ll;
typedef std::pair<int,int> pii;
typedef std::pair<ll,ll> pll;
using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> _x) {
	priority_queue<pll> pq;
	int n = _x.size();
	int m = _x[0].size();
	vector<vector<pii>> x;
	Loop (i,0,n) {
		x.emplace_back();
		Loop (j,0,m)
			x.back().push_back({_x[i][j], j});
		sort(x.back().begin(), x.back().end());
	}
	ll sum = 0;
	Loop (i,0,n) {
		Loop (j,0,k)
			sum -= x[i][j].first;
		pq.push({x[i][k-1].first + x[i][m-1].first, i});
	}
	vector<int> nxt(n, k);
	Loop (_,0,n*k/2) {
		auto [val, i] = pq.top();
		pq.pop();
		sum += val;
		--nxt[i];
		if (nxt[i])
			pq.push({x[i][nxt[i]-1].first + x[i][nxt[i]+m-k-1].first, i});
	}
	std::vector<std::vector<int>> ans(n, vector<int>(m, -1));
	vector<int> neg(n), pos(n);
	Loop (r,0,k) {
		vector<int> ne, po, bo;
		Loop (i,0,n) {
			if (neg[i] == nxt[i])
				po.push_back(i);
			else if (pos[i] == k - nxt[i])
				ne.push_back(i);
			else
				bo.push_back(i);
		}
		Loop (_,0,n/2) {
			auto &vec = ne.size()? ne: bo;
			int i = vec.back();
			vec.pop_back();
			ans[i][x[i][neg[i]++].second] = r;
		}
		Loop (_,0,n/2) {
			auto &vec = po.size()? po: bo;
			int i = vec.back();
			vec.pop_back();
			ans[i][x[i][m-1-(pos[i]++)].second] = r;
		}
	}
	allocate_tickets(ans);
	return sum;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 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 2 ms 468 KB Output is correct
5 Correct 19 ms 3616 KB Output is correct
6 Correct 474 ms 75060 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 3 ms 468 KB Output is correct
5 Correct 20 ms 3856 KB Output is correct
6 Correct 478 ms 80436 KB Output is correct
7 Correct 492 ms 80812 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 1108 KB Output is correct
13 Correct 16 ms 3164 KB Output is correct
14 Correct 16 ms 2740 KB Output is correct
15 Correct 537 ms 81296 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 596 KB Output is correct
5 Correct 34 ms 4412 KB Output is correct
6 Correct 5 ms 872 KB Output is correct
7 Correct 7 ms 1208 KB Output is correct
8 Correct 695 ms 83104 KB Output is correct
9 Correct 614 ms 80996 KB Output is correct
10 Correct 599 ms 81644 KB Output is correct
11 Correct 666 ms 82848 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 3 ms 492 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 3 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 572 KB Output is correct
13 Correct 19 ms 4388 KB Output is correct
14 Correct 20 ms 4356 KB Output is correct
15 Correct 21 ms 4428 KB Output is correct
16 Correct 24 ms 4520 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 2 ms 596 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 20 ms 3820 KB Output is correct
21 Correct 21 ms 4292 KB Output is correct
22 Correct 21 ms 3916 KB Output is correct
23 Correct 22 ms 4340 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 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 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 724 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 2 ms 468 KB Output is correct
11 Correct 19 ms 3616 KB Output is correct
12 Correct 474 ms 75060 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 20 ms 3856 KB Output is correct
18 Correct 478 ms 80436 KB Output is correct
19 Correct 492 ms 80812 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 5 ms 1108 KB Output is correct
25 Correct 16 ms 3164 KB Output is correct
26 Correct 16 ms 2740 KB Output is correct
27 Correct 537 ms 81296 KB Output is correct
28 Correct 1 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 2 ms 596 KB Output is correct
32 Correct 34 ms 4412 KB Output is correct
33 Correct 5 ms 872 KB Output is correct
34 Correct 7 ms 1208 KB Output is correct
35 Correct 695 ms 83104 KB Output is correct
36 Correct 614 ms 80996 KB Output is correct
37 Correct 599 ms 81644 KB Output is correct
38 Correct 666 ms 82848 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 3 ms 596 KB Output is correct
42 Correct 3 ms 596 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 2 ms 596 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 572 KB Output is correct
51 Correct 19 ms 4388 KB Output is correct
52 Correct 20 ms 4356 KB Output is correct
53 Correct 21 ms 4428 KB Output is correct
54 Correct 24 ms 4520 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 2 ms 596 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 20 ms 3820 KB Output is correct
59 Correct 21 ms 4292 KB Output is correct
60 Correct 21 ms 3916 KB Output is correct
61 Correct 22 ms 4340 KB Output is correct
62 Correct 52 ms 10376 KB Output is correct
63 Correct 59 ms 10384 KB Output is correct
64 Correct 66 ms 10652 KB Output is correct
65 Correct 241 ms 41120 KB Output is correct
66 Correct 276 ms 41576 KB Output is correct
67 Correct 5 ms 1236 KB Output is correct
68 Correct 4 ms 852 KB Output is correct
69 Correct 476 ms 80024 KB Output is correct
70 Correct 601 ms 81048 KB Output is correct
71 Correct 664 ms 82984 KB Output is correct
72 Correct 563 ms 83592 KB Output is correct
73 Correct 652 ms 80660 KB Output is correct
74 Correct 514 ms 82156 KB Output is correct
75 Correct 576 ms 79116 KB Output is correct