oj.uz

Submission #609539

# Submission time Handle Problem Language Result Execution time Memory
609539 2022-07-27T17:00:55 Z penguinhacker Carnival Tickets (IOI20_tickets) C++17
100 / 100
 848 ms 83860 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

long long find_maximum(int k, vector<vector<int>> x) {
	int n=x.size();
	int m=x[0].size();
	ll winnings=0;
	vector<ar<int, 2>> gain;
	for (int i=0; i<n; i++)
		for (int j=0; j<k; ++j) {
			gain.push_back({x[i][j]+x[i][m-k+j], i});
			winnings-=x[i][j];
		}
	sort(gain.rbegin(), gain.rend());
	vector<int> cnt(n);
	for (int i=0; i<n*k/2; ++i) {
		winnings+=gain[i][0];
		++cnt[gain[i][1]];
	}
	vector<vector<int>> ans(n, vector<int>(m, -1));
	for (int r=0; r<k; ++r) {
		vector<ar<int, 2>> v(n);
		for (int i=0; i<n; ++i)
			v[i]={cnt[i], i};
		sort(v.begin(), v.end());
		for (int i=0; i<n/2; ++i) {
			int ind=v[i][1];
			int lft=k-r-cnt[ind];
			assert(lft>0);
			ans[ind][lft-1]=r;
		}
		for (int i=n/2; i<n; ++i) {
			int ind=v[i][1];
			int lft=cnt[ind];
			assert(lft>0);
			ans[ind][m-lft]=r;
			--cnt[ind];
		}
	}
	allocate_tickets(ans);
	return winnings;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 696 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory 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 2 ms 468 KB Output is correct
5 Correct 21 ms 3148 KB Output is correct
6 Correct 493 ms 53104 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory 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 2 ms 444 KB Output is correct
5 Correct 23 ms 2640 KB Output is correct
6 Correct 590 ms 57780 KB Output is correct
7 Correct 617 ms 60716 KB Output is correct
8 Correct 4 ms 596 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 8 ms 860 KB Output is correct
13 Correct 20 ms 2364 KB Output is correct
14 Correct 19 ms 2420 KB Output is correct
15 Correct 648 ms 63060 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory 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 3 ms 468 KB Output is correct
5 Correct 34 ms 3640 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 6 ms 1108 KB Output is correct
8 Correct 812 ms 62640 KB Output is correct
9 Correct 777 ms 58604 KB Output is correct
10 Correct 771 ms 58524 KB Output is correct
11 Correct 848 ms 62636 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 500 KB Output is correct
6 Correct 2 ms 468 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 3 ms 468 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 568 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 500 KB Output is correct
6 Correct 2 ms 468 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 3 ms 468 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 3 ms 568 KB Output is correct
13 Correct 20 ms 3276 KB Output is correct
14 Correct 21 ms 3232 KB Output is correct
15 Correct 27 ms 3268 KB Output is correct
16 Correct 35 ms 3600 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 496 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 33 ms 2828 KB Output is correct
21 Correct 27 ms 3244 KB Output is correct
22 Correct 32 ms 2980 KB Output is correct
23 Correct 31 ms 3488 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 696 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 21 ms 3148 KB Output is correct
12 Correct 493 ms 53104 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 444 KB Output is correct
17 Correct 23 ms 2640 KB Output is correct
18 Correct 590 ms 57780 KB Output is correct
19 Correct 617 ms 60716 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 8 ms 860 KB Output is correct
25 Correct 20 ms 2364 KB Output is correct
26 Correct 19 ms 2420 KB Output is correct
27 Correct 648 ms 63060 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 3 ms 468 KB Output is correct
32 Correct 34 ms 3640 KB Output is correct
33 Correct 5 ms 852 KB Output is correct
34 Correct 6 ms 1108 KB Output is correct
35 Correct 812 ms 62640 KB Output is correct
36 Correct 777 ms 58604 KB Output is correct
37 Correct 771 ms 58524 KB Output is correct
38 Correct 848 ms 62636 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 500 KB Output is correct
44 Correct 2 ms 468 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 3 ms 468 KB Output is correct
49 Correct 3 ms 596 KB Output is correct
50 Correct 3 ms 568 KB Output is correct
51 Correct 20 ms 3276 KB Output is correct
52 Correct 21 ms 3232 KB Output is correct
53 Correct 27 ms 3268 KB Output is correct
54 Correct 35 ms 3600 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 496 KB Output is correct
57 Correct 2 ms 340 KB Output is correct
58 Correct 33 ms 2828 KB Output is correct
59 Correct 27 ms 3244 KB Output is correct
60 Correct 32 ms 2980 KB Output is correct
61 Correct 31 ms 3488 KB Output is correct
62 Correct 58 ms 8324 KB Output is correct
63 Correct 57 ms 8356 KB Output is correct
64 Correct 89 ms 9580 KB Output is correct
65 Correct 289 ms 33640 KB Output is correct
66 Correct 429 ms 37420 KB Output is correct
67 Correct 6 ms 1108 KB Output is correct
68 Correct 5 ms 804 KB Output is correct
69 Correct 472 ms 73052 KB Output is correct
70 Correct 653 ms 75172 KB Output is correct
71 Correct 833 ms 83860 KB Output is correct
72 Correct 815 ms 67916 KB Output is correct
73 Correct 792 ms 80112 KB Output is correct
74 Correct 658 ms 60900 KB Output is correct
75 Correct 698 ms 73368 KB Output is correct