oj.uz

Submission #489728

# Submission time Handle Problem Language Result Execution time Memory
489728 2021-11-24T04:29:46 Z 8e7 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 627 ms 93880 KB 
#include "tickets.h"
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <random>
#include <chrono>
#include <queue>
using namespace std;
void debug(){cout << endl;}
template<class T, class ...U> void debug(T a, U ... b){cout << a << " ", debug(b...);}
template<class T> void pary (T l, T r) {
	while (l != r) cout << *l << " ", l++;
	cout << endl;
}
#define ll long long
#define maxn 1505
#define pii pair<int, int>
#define ff first
#define ss second
const ll inf = 1LL<<60;
ll cost[maxn][maxn];
int pref[maxn], suf[maxn];
priority_queue<pii, vector<pii>, less<pii> > pq;
long long find_maximum(int k, vector<vector<int> > x) {
	int n = x.size();
	int m = x[0].size();
	ll tot = 0, small = 0;
	for (int i = 0;i < n;i++) {
		for (int j = m - k;j < m;j++) {
			tot += x[i][j];
			cost[i][j - m + k] = -x[i][j - m + k] - x[i][j];
		}	
		//pary(cost[i], cost[i] + k + 1);
	}
	vector<vector<int> > ans(n, vector<int>(m, -1));
	for (int i = 0;i < n;i++) {
		pref[i] = 0, suf[i] = m - k;
		pq.push({cost[i][0], i});
	}
	for (int ti = 0;ti < n * k / 2;ti++) {
		pii best = pq.top();pq.pop();
		int i = best.ss;
		pref[i]++, suf[i]++;
		small += best.ff;
		if (pref[i] < k) pq.push({cost[i][pref[i]], i});
	}
	
	int ord[n];
	for (int i = 0;i < n;i++) ord[i] = i;
	for (int ti = 0;ti < k;ti++) {
		sort(ord, ord + n, [&](int x, int y){return pref[x] > pref[y];});
		int rem = n / 2;
		for (int j = 0;j < n;j++) {
			int i = ord[j];
			if (pref[i] && rem) {
				rem--;
				pref[i]--;
				ans[i][pref[i]] = ti;
			} else {
				ans[i][suf[i]] = ti;
				suf[i]++;
			}
		}
	}	
	allocate_tickets(ans);
	return tot + small;
}
/*
2 3 2
0 2 5
1 1 3


4 2 1
5 9
1 4
3 6
2 7
*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 4 ms 6732 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 23 ms 3584 KB Output is correct
6 Correct 452 ms 57416 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 236 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 18 ms 3916 KB Output is correct
6 Correct 452 ms 71620 KB Output is correct
7 Correct 464 ms 74696 KB Output is correct
8 Correct 3 ms 972 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 0 ms 332 KB Output is correct
12 Correct 5 ms 1572 KB Output is correct
13 Correct 16 ms 4548 KB Output is correct
14 Correct 16 ms 3256 KB Output is correct
15 Correct 483 ms 75348 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 25 ms 4328 KB Output is correct
6 Correct 4 ms 844 KB Output is correct
7 Correct 7 ms 7116 KB Output is correct
8 Correct 627 ms 93544 KB Output is correct
9 Correct 581 ms 88568 KB Output is correct
10 Correct 578 ms 87484 KB Output is correct
11 Correct 627 ms 93880 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 808 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 3 ms 716 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 1 ms 588 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 808 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 3 ms 716 KB Output is correct
13 Correct 19 ms 3552 KB Output is correct
14 Correct 21 ms 4444 KB Output is correct
15 Correct 22 ms 4796 KB Output is correct
16 Correct 26 ms 5196 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 2 ms 1740 KB Output is correct
19 Correct 2 ms 1612 KB Output is correct
20 Correct 20 ms 4280 KB Output is correct
21 Correct 21 ms 4796 KB Output is correct
22 Correct 22 ms 4556 KB Output is correct
23 Correct 22 ms 4940 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 1484 KB Output is correct
6 Correct 4 ms 6732 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 23 ms 3584 KB Output is correct
12 Correct 452 ms 57416 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 236 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 18 ms 3916 KB Output is correct
18 Correct 452 ms 71620 KB Output is correct
19 Correct 464 ms 74696 KB Output is correct
20 Correct 3 ms 972 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 5 ms 1572 KB Output is correct
25 Correct 16 ms 4548 KB Output is correct
26 Correct 16 ms 3256 KB Output is correct
27 Correct 483 ms 75348 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 0 ms 204 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 2 ms 716 KB Output is correct
32 Correct 25 ms 4328 KB Output is correct
33 Correct 4 ms 844 KB Output is correct
34 Correct 7 ms 7116 KB Output is correct
35 Correct 627 ms 93544 KB Output is correct
36 Correct 581 ms 88568 KB Output is correct
37 Correct 578 ms 87484 KB Output is correct
38 Correct 627 ms 93880 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 2 ms 716 KB Output is correct
41 Correct 2 ms 716 KB Output is correct
42 Correct 2 ms 716 KB Output is correct
43 Correct 2 ms 716 KB Output is correct
44 Correct 2 ms 716 KB Output is correct
45 Correct 0 ms 332 KB Output is correct
46 Correct 1 ms 588 KB Output is correct
47 Correct 2 ms 716 KB Output is correct
48 Correct 2 ms 808 KB Output is correct
49 Correct 2 ms 716 KB Output is correct
50 Correct 3 ms 716 KB Output is correct
51 Correct 19 ms 3552 KB Output is correct
52 Correct 21 ms 4444 KB Output is correct
53 Correct 22 ms 4796 KB Output is correct
54 Correct 26 ms 5196 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 2 ms 1740 KB Output is correct
57 Correct 2 ms 1612 KB Output is correct
58 Correct 20 ms 4280 KB Output is correct
59 Correct 21 ms 4796 KB Output is correct
60 Correct 22 ms 4556 KB Output is correct
61 Correct 22 ms 4940 KB Output is correct
62 Correct 57 ms 10472 KB Output is correct
63 Correct 53 ms 10436 KB Output is correct
64 Correct 69 ms 12508 KB Output is correct
65 Correct 234 ms 40956 KB Output is correct
66 Correct 271 ms 45380 KB Output is correct
67 Correct 7 ms 7092 KB Output is correct
68 Correct 4 ms 844 KB Output is correct
69 Correct 470 ms 79172 KB Output is correct
70 Correct 545 ms 88900 KB Output is correct
71 Correct 626 ms 93608 KB Output is correct
72 Correct 540 ms 78236 KB Output is correct
73 Correct 586 ms 90336 KB Output is correct
74 Correct 468 ms 74424 KB Output is correct
75 Correct 543 ms 86636 KB Output is correct