oj.uz

답안 #823167

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823167 2023-08-12T08:45:53 Z fatemetmhr 카니발 티켓 (IOI20_tickets) C++17
100 / 100
 1669 ms 109968 KB 
// :)^2


#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define fi     first
#define se     second
#define mp     make_pair
#define pb     push_back

typedef long long ll;

const int maxn5 = 2e3 + 10;

pair <ll, int> per[maxn5];
int ptl[maxn5], ptr[maxn5], val[maxn5][maxn5], cnt[maxn5];
vector <int> req[maxn5][2], ind[maxn5];
vector <pair<int, pair<int, int>>> av;
priority_queue <pair<ll, int>> mx;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> ret;
	for (int i = 0; i < n; i++) {
		ptl[i] = k - 1;
		ptr[i] = m - 1;
		mx.push({x[i][k - 1] + x[i][m - 1], i});
		vector <int> row(m);
		fill(all(row), -1);
		ret.push_back(row);
	}
	int tt = k * (n / 2);
	while(tt--){
		int v = mx.top().se;
		mx.pop();
		ptl[v]--;
		ptr[v]--;
		if(ptl[v] >= 0)
			mx.push({x[v][ptl[v]] + x[v][ptr[v]], v});
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j <= ptl[i]; j++)
			av.pb({x[i][j], {i, j}});
		for(int j = ptr[i] + 1; j < m; j++)
			av.pb({x[i][j], {i, j}});
	}
	sort(all(av));
	for(int i = 0; i < n; i++) for(int j = 0; j < m; j++) if(j <= ptl[i] || j > ptr[i]){
		int pt = lower_bound(all(av), mp(x[i][j], mp(i, j))) - av.begin();
		ind[i].pb(j);
		if(pt < int(av.size()) / 2){
			val[i][j] = 0;
		}
		else{
			val[i][j] = 1;
		}
		cnt[i] += val[i][j];
	}
	for(int i = 0; i < n; i++){
		ptl[i] = 0;
		ptr[i] = int(ind[i].size()) - 1;
	}
	ll ans = 0;
	int num = 0;
	while(k--){
		for(int i = 0; i < n; i++)
			per[i] = {cnt[i], i};
		sort(per, per + n);
		for(int i = 0; i < n / 2; i++){
			int v = per[i].se;
			ans -= x[v][ind[v][ptl[v]]];
			//cout << "small " << v << ' ' << cnt[v] << ' ' << num << ' ' << ptl[v] << ' ' << x[v][ptl[v]] << ' ' << ans << endl;
			ret[v][ind[v][ptl[v]]] = num;
			cnt[v] -= val[v][ind[v][ptl[v]]];
			ptl[v]++;
		}
		for(int i = n / 2; i < n; i++){
			int v = per[i].se;
			ans += x[v][ind[v][ptr[v]]];
			//cout << "big " << v << ' ' << cnt[v] << ' ' << num << ' ' << ptr[v] << ' ' << x[v][ptr[v]] << ' ' << ans << endl;
			ret[v][ind[v][ptr[v]]] = num;
			cnt[v] -= val[v][ind[v][ptr[v]]];
			ptr[v]--;
		}
		num++;
	}
	allocate_tickets(ret);
	return ans;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 4 ms 6996 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 17 ms 3796 KB Output is correct
6 Correct 391 ms 56920 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 23 ms 4812 KB Output is correct
6 Correct 678 ms 82908 KB Output is correct
7 Correct 723 ms 92756 KB Output is correct
8 Correct 4 ms 1300 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 7 ms 1964 KB Output is correct
13 Correct 22 ms 5400 KB Output is correct
14 Correct 25 ms 4168 KB Output is correct
15 Correct 771 ms 102772 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 3 ms 1068 KB Output is correct
5 Correct 41 ms 5728 KB Output is correct
6 Correct 6 ms 1176 KB Output is correct
7 Correct 10 ms 7364 KB Output is correct
8 Correct 1669 ms 104696 KB Output is correct
9 Correct 1560 ms 99192 KB Output is correct
10 Correct 1436 ms 97780 KB Output is correct
11 Correct 1615 ms 104640 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 3 ms 980 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 3 ms 980 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 584 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 3 ms 980 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 2 ms 980 KB Output is correct
10 Correct 2 ms 980 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 3 ms 980 KB Output is correct
13 Correct 18 ms 3896 KB Output is correct
14 Correct 28 ms 4084 KB Output is correct
15 Correct 28 ms 4860 KB Output is correct
16 Correct 56 ms 5708 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 3 ms 1876 KB Output is correct
19 Correct 2 ms 1784 KB Output is correct
20 Correct 33 ms 5004 KB Output is correct
21 Correct 30 ms 4936 KB Output is correct
22 Correct 39 ms 5568 KB Output is correct
23 Correct 47 ms 5512 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 0 ms 468 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 1748 KB Output is correct
6 Correct 4 ms 6996 KB Output is correct
7 Correct 0 ms 468 KB Output is correct
8 Correct 0 ms 468 KB Output is correct
9 Correct 0 ms 468 KB Output is correct
10 Correct 2 ms 852 KB Output is correct
11 Correct 17 ms 3796 KB Output is correct
12 Correct 391 ms 56920 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct
16 Correct 2 ms 980 KB Output is correct
17 Correct 23 ms 4812 KB Output is correct
18 Correct 678 ms 82908 KB Output is correct
19 Correct 723 ms 92756 KB Output is correct
20 Correct 4 ms 1300 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 7 ms 1964 KB Output is correct
25 Correct 22 ms 5400 KB Output is correct
26 Correct 25 ms 4168 KB Output is correct
27 Correct 771 ms 102772 KB Output is correct
28 Correct 0 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 0 ms 468 KB Output is correct
31 Correct 3 ms 1068 KB Output is correct
32 Correct 41 ms 5728 KB Output is correct
33 Correct 6 ms 1176 KB Output is correct
34 Correct 10 ms 7364 KB Output is correct
35 Correct 1669 ms 104696 KB Output is correct
36 Correct 1560 ms 99192 KB Output is correct
37 Correct 1436 ms 97780 KB Output is correct
38 Correct 1615 ms 104640 KB Output is correct
39 Correct 1 ms 584 KB Output is correct
40 Correct 2 ms 852 KB Output is correct
41 Correct 2 ms 852 KB Output is correct
42 Correct 2 ms 980 KB Output is correct
43 Correct 3 ms 980 KB Output is correct
44 Correct 3 ms 980 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 724 KB Output is correct
47 Correct 2 ms 980 KB Output is correct
48 Correct 2 ms 980 KB Output is correct
49 Correct 3 ms 1024 KB Output is correct
50 Correct 3 ms 980 KB Output is correct
51 Correct 18 ms 3896 KB Output is correct
52 Correct 28 ms 4084 KB Output is correct
53 Correct 28 ms 4860 KB Output is correct
54 Correct 56 ms 5708 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 3 ms 1876 KB Output is correct
57 Correct 2 ms 1784 KB Output is correct
58 Correct 33 ms 5004 KB Output is correct
59 Correct 30 ms 4936 KB Output is correct
60 Correct 39 ms 5568 KB Output is correct
61 Correct 47 ms 5512 KB Output is correct
62 Correct 72 ms 11108 KB Output is correct
63 Correct 73 ms 11648 KB Output is correct
64 Correct 114 ms 15692 KB Output is correct
65 Correct 452 ms 44124 KB Output is correct
66 Correct 585 ms 52560 KB Output is correct
67 Correct 13 ms 7584 KB Output is correct
68 Correct 5 ms 1304 KB Output is correct
69 Correct 510 ms 66144 KB Output is correct
70 Correct 929 ms 88808 KB Output is correct
71 Correct 1642 ms 109968 KB Output is correct
72 Correct 1241 ms 105472 KB Output is correct
73 Correct 1620 ms 108092 KB Output is correct
74 Correct 804 ms 87284 KB Output is correct
75 Correct 1000 ms 90488 KB Output is correct