oj.uz

Submission #382567

# Submission time Handle Problem Language Result Execution time Memory
382567 2021-03-27T17:43:34 Z maximath_1 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1277 ms 147088 KB 
#include "tickets.h"
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long

ll find_maximum(int k, vector<vector<int> > x){
	int n = x.size(), m = x[0].size();
	ll ans = 0ll;

	vector<vector<pair<ll, int> > > x2;
	x2.resize(n);
	for(int i = 0; i < n; i ++) for(int j = 0; j < m; j ++)
		x2[i].push_back({(ll)x[i][j], j});

	vector<pair<ll, pair<int, int> > > V;

	for(int i = 0; i < n; i ++){
		sort(x2[i].begin(), x2[i].end());
		for(int j = 0; j < k; j ++){
			V.push_back({x2[i][m - j - 1].first + x2[i][k - j - 1].first, {i, j}});	
			ans -= x2[i][j].first;
		}
	}

	sort(V.begin(), V.end(), [&](pair<ll, pair<int, int> > a, pair<ll, pair<int, int> > b){
		if(a.first == b.first) return a.second < b.second;
		return a.first > b.first;
	});

	vector<int> sum(n, 0);
	for(int i = 0; i < n * k / 2; i ++){
		ans += V[i].first;
		sum[V[i].second.first] = V[i].second.second + 1;
	}

	vector<vector<int> > res(n, vector<int>(m, -1));
	vector<int> fr(n, 0), bc(n, 0);
	for(int i = 0; i < k; i ++){
		vector<pair<int, int> > v;
		for(int j = 0; j < n; j ++) v.push_back({sum[j], j});
		sort(v.begin(), v.end());

		for(int j = 0; j < n / 2; j ++){
			res[v[j].second][x2[v[j].second][fr[v[j].second]].second] = i;
			fr[v[j].second] ++;
		}
		for(int j = n / 2; j < n; j ++){
			res[v[j].second][x2[v[j].second][m - bc[v[j].second] - 1].second] = i;
			bc[v[j].second] ++;
			sum[v[j].second] --;
		}
	}

	allocate_tickets(res);
	return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 876 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 30 ms 5740 KB Output is correct
6 Correct 760 ms 96364 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 34 ms 5472 KB Output is correct
6 Correct 892 ms 107920 KB Output is correct
7 Correct 950 ms 113848 KB Output is correct
8 Correct 6 ms 1004 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 9 ms 1648 KB Output is correct
13 Correct 29 ms 4840 KB Output is correct
14 Correct 38 ms 4064 KB Output is correct
15 Correct 1069 ms 118544 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 4 ms 988 KB Output is correct
5 Correct 45 ms 6876 KB Output is correct
6 Correct 7 ms 1292 KB Output is correct
7 Correct 10 ms 1648 KB Output is correct
8 Correct 1254 ms 146960 KB Output is correct
9 Correct 1234 ms 141968 KB Output is correct
10 Correct 1173 ms 141824 KB Output is correct
11 Correct 1272 ms 147088 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 5 ms 872 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 5 ms 748 KB Output is correct
11 Correct 4 ms 896 KB Output is correct
12 Correct 4 ms 872 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 748 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 3 ms 748 KB Output is correct
5 Correct 3 ms 748 KB Output is correct
6 Correct 5 ms 872 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 4 ms 748 KB Output is correct
10 Correct 5 ms 748 KB Output is correct
11 Correct 4 ms 896 KB Output is correct
12 Correct 4 ms 872 KB Output is correct
13 Correct 30 ms 5748 KB Output is correct
14 Correct 31 ms 5740 KB Output is correct
15 Correct 36 ms 6112 KB Output is correct
16 Correct 45 ms 6876 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 4 ms 748 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 38 ms 5728 KB Output is correct
21 Correct 39 ms 6120 KB Output is correct
22 Correct 54 ms 6108 KB Output is correct
23 Correct 49 ms 6500 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 876 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 3 ms 748 KB Output is correct
11 Correct 30 ms 5740 KB Output is correct
12 Correct 760 ms 96364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 3 ms 748 KB Output is correct
17 Correct 34 ms 5472 KB Output is correct
18 Correct 892 ms 107920 KB Output is correct
19 Correct 950 ms 113848 KB Output is correct
20 Correct 6 ms 1004 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 9 ms 1648 KB Output is correct
25 Correct 29 ms 4840 KB Output is correct
26 Correct 38 ms 4064 KB Output is correct
27 Correct 1069 ms 118544 KB Output is correct
28 Correct 2 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 4 ms 988 KB Output is correct
32 Correct 45 ms 6876 KB Output is correct
33 Correct 7 ms 1292 KB Output is correct
34 Correct 10 ms 1648 KB Output is correct
35 Correct 1254 ms 146960 KB Output is correct
36 Correct 1234 ms 141968 KB Output is correct
37 Correct 1173 ms 141824 KB Output is correct
38 Correct 1272 ms 147088 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 748 KB Output is correct
41 Correct 3 ms 748 KB Output is correct
42 Correct 3 ms 748 KB Output is correct
43 Correct 3 ms 748 KB Output is correct
44 Correct 5 ms 872 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 4 ms 748 KB Output is correct
48 Correct 5 ms 748 KB Output is correct
49 Correct 4 ms 896 KB Output is correct
50 Correct 4 ms 872 KB Output is correct
51 Correct 30 ms 5748 KB Output is correct
52 Correct 31 ms 5740 KB Output is correct
53 Correct 36 ms 6112 KB Output is correct
54 Correct 45 ms 6876 KB Output is correct
55 Correct 2 ms 492 KB Output is correct
56 Correct 4 ms 748 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 38 ms 5728 KB Output is correct
59 Correct 39 ms 6120 KB Output is correct
60 Correct 54 ms 6108 KB Output is correct
61 Correct 49 ms 6500 KB Output is correct
62 Correct 80 ms 12524 KB Output is correct
63 Correct 81 ms 12524 KB Output is correct
64 Correct 122 ms 15712 KB Output is correct
65 Correct 413 ms 53704 KB Output is correct
66 Correct 521 ms 61492 KB Output is correct
67 Correct 9 ms 1648 KB Output is correct
68 Correct 8 ms 1292 KB Output is correct
69 Correct 751 ms 114648 KB Output is correct
70 Correct 980 ms 125504 KB Output is correct
71 Correct 1277 ms 146972 KB Output is correct
72 Correct 1191 ms 131932 KB Output is correct
73 Correct 1245 ms 136072 KB Output is correct
74 Correct 979 ms 110516 KB Output is correct
75 Correct 963 ms 122528 KB Output is correct