oj.uz

Submission #300208

# Submission time Handle Problem Language Result Execution time Memory
300208 2020-09-17T01:26:06 Z Yousef_Salama Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1522 ms 109716 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
/*
void allocate_tickets(vector < vector <int> > s){
	int n = (int)s.size(), m = (int)s[0].size();
	
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(j > 0)printf(" ");
			printf("%d", s[i][j]);
		}
		printf("\n");
	}
}
*/
long long find_maximum(int k, vector < vector <int> > x){
	int n = (int)x.size(), m = (int)x[0].size();
	
	long long total = 0;
	vector < pair <int, int> > r;
	vector <int> t(n, 0);
	
	for(int i = 0; i < n; i++){
		for(int j = k - 1; j >= 0; j--){
			r.emplace_back(x[i][j] + x[i][m - (k - 1 - j) - 1], i);
			total -= x[i][j];
		}
	}
	sort(r.rbegin(), r.rend());
	
	for(int i = 0; i < k * (n / 2); i++){
		total += r[i].first;
		t[r[i].second]++;
	}
	
	vector < pair <int, pair <int, int> > > v;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < k - t[i]; j++)
			v.push_back({x[i][j], {i, j}});
		for(int j = 0; j < t[i]; j++)
			v.push_back({x[i][m - j - 1], {i, m - j - 1}});
	}
	sort(v.begin(), v.end());
	sort(v.begin(), v.begin() + k * (n / 2), [&](auto p, auto q){
			return p.second.first < q.second.first;
		});
	
	vector < vector <int> > w(n);
	vector <int> p(n, 0);
	
	for(int i = k * (n / 2); i < k * n; i++)
		w[v[i].second.first].push_back(v[i].second.second);
		
	vector < vector <int> > s(n, vector<int>(m, -1));
	
	for(int i = 0; i < k; i++){
		vector <bool> marked(n, false);
		for(int j = 0; j < n / 2; j++){
			s[v[i + j * k].second.first][v[i + j * k].second.second] = i;
			marked[v[i + j * k].second.first] = true;
		}
		for(int j = 0; j < n; j++)if(!marked[j]){
			s[j][w[j][p[j]++]] = i;
		}
	}
	allocate_tickets(s);
	
	return total;
}
/*
int main(){
	int n, m, k;
	scanf("%d %d %d", &n, &m, &k);
	
	vector < vector <int> > x(n, vector <int>(m));
	for(int i = 0; i < n; i++)
	for(int j = 0; j < m; j++)
		scanf("%d", &x[i][j]);
		
	printf("%lld\n", find_maximum(k, x));

	return 0;
}
*/

Subtask #1
11.0 / 11.0

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

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 32 ms 2432 KB Output is correct
6 Correct 788 ms 51496 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 35 ms 3192 KB Output is correct
6 Correct 930 ms 69760 KB Output is correct
7 Correct 1055 ms 78136 KB Output is correct
8 Correct 5 ms 776 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 12 ms 1088 KB Output is correct
13 Correct 40 ms 2936 KB Output is correct
14 Correct 35 ms 3192 KB Output is correct
15 Correct 973 ms 85776 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 288 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 53 ms 4196 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 12 ms 1280 KB Output is correct
8 Correct 1471 ms 109556 KB Output is correct
9 Correct 1348 ms 107160 KB Output is correct
10 Correct 1386 ms 107172 KB Output is correct
11 Correct 1442 ms 109672 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 4 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 6 ms 588 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 32 ms 2424 KB Output is correct
14 Correct 40 ms 2552 KB Output is correct
15 Correct 47 ms 3184 KB Output is correct
16 Correct 54 ms 4204 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 42 ms 3436 KB Output is correct
21 Correct 44 ms 3312 KB Output is correct
22 Correct 47 ms 4052 KB Output is correct
23 Correct 53 ms 3956 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 32 ms 2432 KB Output is correct
12 Correct 788 ms 51496 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 35 ms 3192 KB Output is correct
18 Correct 930 ms 69760 KB Output is correct
19 Correct 1055 ms 78136 KB Output is correct
20 Correct 5 ms 776 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 12 ms 1088 KB Output is correct
25 Correct 40 ms 2936 KB Output is correct
26 Correct 35 ms 3192 KB Output is correct
27 Correct 973 ms 85776 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 1 ms 288 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 53 ms 4196 KB Output is correct
33 Correct 8 ms 896 KB Output is correct
34 Correct 12 ms 1280 KB Output is correct
35 Correct 1471 ms 109556 KB Output is correct
36 Correct 1348 ms 107160 KB Output is correct
37 Correct 1386 ms 107172 KB Output is correct
38 Correct 1442 ms 109672 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 4 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 5 ms 512 KB Output is correct
44 Correct 6 ms 588 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 5 ms 512 KB Output is correct
49 Correct 4 ms 640 KB Output is correct
50 Correct 4 ms 640 KB Output is correct
51 Correct 32 ms 2424 KB Output is correct
52 Correct 40 ms 2552 KB Output is correct
53 Correct 47 ms 3184 KB Output is correct
54 Correct 54 ms 4204 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 3 ms 640 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 42 ms 3436 KB Output is correct
59 Correct 44 ms 3312 KB Output is correct
60 Correct 47 ms 4052 KB Output is correct
61 Correct 53 ms 3956 KB Output is correct
62 Correct 86 ms 6140 KB Output is correct
63 Correct 88 ms 6136 KB Output is correct
64 Correct 155 ms 10980 KB Output is correct
65 Correct 504 ms 31448 KB Output is correct
66 Correct 640 ms 42472 KB Output is correct
67 Correct 14 ms 1280 KB Output is correct
68 Correct 8 ms 896 KB Output is correct
69 Correct 807 ms 51564 KB Output is correct
70 Correct 1161 ms 70000 KB Output is correct
71 Correct 1522 ms 109716 KB Output is correct
72 Correct 1297 ms 107812 KB Output is correct
73 Correct 1405 ms 88240 KB Output is correct
74 Correct 969 ms 69620 KB Output is correct
75 Correct 1151 ms 68756 KB Output is correct