oj.uz

Submission #370947

# Submission time Handle Problem Language Result Execution time Memory
370947 2021-02-25T07:30:37 Z pit4h Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1091 ms 93088 KB 
#include "tickets.h"
#include<bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
using namespace std;
using ll = long long;
using pii = pair<int, int>;

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

	ll ans = 0;

	vector<vector<int>> vec(n, vector<int>(m));
	vector<pii> all;

	for(int i=0; i<n; ++i) {
		for(int j=m-k; j<m; ++j) {
			ans += x[i][j];
			vec[i][j-(m-k)] = x[i][j] + x[i][j-(m-k)];
			all.push_back(mp(vec[i][j-(m-k)], i));
		}
	}

	sort(all.begin(), all.end());

	vector<int> cnt(n), l(n), r(n, m-1);

	for(int i=0; i<k*n/2; ++i) {
		cnt[all[i].nd]++;	
		ans -= all[i].st;
	}

	for(int i=0; i<k; ++i) {
		vector<pii> v;
		for(int j=0; j<n; ++j) {
			v.push_back(mp(cnt[j], j));
		}
		sort(v.begin(), v.end());
		for(int j=0; j<n/2; ++j) {
			int it = v[j].nd;			
			answer[it][r[it]] = i;
			r[it]--;
		}
		for(int j=n/2; j<n; ++j) {
			int it = v[j].nd;
			answer[it][l[it]] = i;
			l[it]++;
			cnt[it]--;
		}
	}

	allocate_tickets(answer);
	
	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 364 KB Output is correct
6 Correct 2 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 4 ms 620 KB Output is correct
5 Correct 27 ms 3692 KB Output is correct
6 Correct 657 ms 82044 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 620 KB Output is correct
5 Correct 27 ms 3044 KB Output is correct
6 Correct 687 ms 66740 KB Output is correct
7 Correct 754 ms 69684 KB Output is correct
8 Correct 4 ms 748 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 8 ms 1132 KB Output is correct
13 Correct 25 ms 2660 KB Output is correct
14 Correct 25 ms 2660 KB Output is correct
15 Correct 765 ms 72244 KB Output is correct

Subtask #4
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 620 KB Output is correct
5 Correct 39 ms 4064 KB Output is correct
6 Correct 9 ms 1004 KB Output is correct
7 Correct 8 ms 1260 KB Output is correct
8 Correct 1022 ms 93088 KB Output is correct
9 Correct 989 ms 86860 KB Output is correct
10 Correct 992 ms 86924 KB Output is correct
11 Correct 1091 ms 93072 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 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 4 ms 620 KB Output is correct
12 Correct 5 ms 620 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 620 KB Output is correct
3 Correct 3 ms 620 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 5 ms 768 KB Output is correct
6 Correct 4 ms 620 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 4 ms 620 KB Output is correct
12 Correct 5 ms 620 KB Output is correct
13 Correct 28 ms 3692 KB Output is correct
14 Correct 29 ms 3692 KB Output is correct
15 Correct 32 ms 3716 KB Output is correct
16 Correct 39 ms 4064 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 33 ms 3308 KB Output is correct
21 Correct 35 ms 3692 KB Output is correct
22 Correct 37 ms 3432 KB Output is correct
23 Correct 38 ms 3904 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 364 KB Output is correct
6 Correct 2 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 4 ms 620 KB Output is correct
11 Correct 27 ms 3692 KB Output is correct
12 Correct 657 ms 82044 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 620 KB Output is correct
17 Correct 27 ms 3044 KB Output is correct
18 Correct 687 ms 66740 KB Output is correct
19 Correct 754 ms 69684 KB Output is correct
20 Correct 4 ms 748 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 8 ms 1132 KB Output is correct
25 Correct 25 ms 2660 KB Output is correct
26 Correct 25 ms 2660 KB Output is correct
27 Correct 765 ms 72244 KB Output is correct
28 Correct 1 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 3 ms 620 KB Output is correct
32 Correct 39 ms 4064 KB Output is correct
33 Correct 9 ms 1004 KB Output is correct
34 Correct 8 ms 1260 KB Output is correct
35 Correct 1022 ms 93088 KB Output is correct
36 Correct 989 ms 86860 KB Output is correct
37 Correct 992 ms 86924 KB Output is correct
38 Correct 1091 ms 93072 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 620 KB Output is correct
41 Correct 3 ms 620 KB Output is correct
42 Correct 3 ms 620 KB Output is correct
43 Correct 5 ms 768 KB Output is correct
44 Correct 4 ms 620 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 3 ms 620 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 4 ms 620 KB Output is correct
50 Correct 5 ms 620 KB Output is correct
51 Correct 28 ms 3692 KB Output is correct
52 Correct 29 ms 3692 KB Output is correct
53 Correct 32 ms 3716 KB Output is correct
54 Correct 39 ms 4064 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 620 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 33 ms 3308 KB Output is correct
59 Correct 35 ms 3692 KB Output is correct
60 Correct 37 ms 3432 KB Output is correct
61 Correct 38 ms 3904 KB Output is correct
62 Correct 74 ms 9580 KB Output is correct
63 Correct 75 ms 9580 KB Output is correct
64 Correct 108 ms 10864 KB Output is correct
65 Correct 366 ms 37592 KB Output is correct
66 Correct 435 ms 41532 KB Output is correct
67 Correct 8 ms 1260 KB Output is correct
68 Correct 6 ms 1004 KB Output is correct
69 Correct 663 ms 82172 KB Output is correct
70 Correct 825 ms 84212 KB Output is correct
71 Correct 1000 ms 92964 KB Output is correct
72 Correct 946 ms 76568 KB Output is correct
73 Correct 1038 ms 88828 KB Output is correct
74 Correct 790 ms 69436 KB Output is correct
75 Correct 830 ms 82124 KB Output is correct