oj.uz

Submission #320387

# Submission time Handle Problem Language Result Execution time Memory
320387 2020-11-08T13:05:16 Z tigicha Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1000 ms 60772 KB 
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
long long l, x, y, a[500005], sum, n, m;
set<pair<int, int> >s;
vector<vector<int> >answer;
vector<int>vec;
long long find_maximum(int k, vector<vector<int> >v){
	n=v.size();
	m=v[0].size();
	for(int i=0; i<n; i++){
	    for(int j=m-k; j<m; j++)
	    sum+=v[i][j];
	    s.insert({v[i][m-k]+v[i][0], i});
	}
	for(int i=1; i<=(k*n)/2; i++){
	    l=(*s.begin()).second;
	    sum-=(*s.begin()).first;
	    s.erase(*s.begin());
	    a[l]++;
	    if(a[l]<k) s.insert({v[l][m-k+a[l]]+v[l][a[l]], l});
	}
	for(int i=0; i<n; i++){
		vec.clear();
		for(int j=0; j<a[i]; j++){
			vec.push_back(x);
			x=(x+1)%k;
		}
		for(int j=a[i]; j<m-k+a[i]; j++)
		vec.push_back(-1);
		y=x;
		for(int j=m-k+a[i]; j<m; j++){
		    vec.push_back(y);
		    y=(y+1)%k;
		}
		answer.push_back(vec);
	}
	allocate_tickets(answer);
	return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 0 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 748 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 492 KB Output is correct
5 Correct 28 ms 3300 KB Output is correct
6 Correct 668 ms 52708 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 2 ms 492 KB Output is correct
5 Correct 34 ms 2660 KB Output is correct
6 Correct 666 ms 56832 KB Output is correct
7 Correct 700 ms 57304 KB Output is correct
8 Correct 4 ms 620 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 7 ms 876 KB Output is correct
13 Correct 27 ms 2284 KB Output is correct
14 Correct 23 ms 2284 KB Output is correct
15 Correct 672 ms 57920 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 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 38 ms 3428 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 9 ms 1132 KB Output is correct
8 Correct 994 ms 55396 KB Output is correct
9 Correct 947 ms 51624 KB Output is correct
10 Correct 895 ms 51684 KB Output is correct
11 Correct 1000 ms 55436 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 492 KB Output is correct
3 Correct 3 ms 636 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 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 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 512 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 492 KB Output is correct
3 Correct 3 ms 636 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 3 ms 492 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 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 492 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 29 ms 3300 KB Output is correct
14 Correct 31 ms 3428 KB Output is correct
15 Correct 33 ms 3428 KB Output is correct
16 Correct 39 ms 3428 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 31 ms 2788 KB Output is correct
21 Correct 34 ms 3296 KB Output is correct
22 Correct 33 ms 2788 KB Output is correct
23 Correct 35 ms 3300 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 360 KB Output is correct
2 Correct 0 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 748 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 492 KB Output is correct
11 Correct 28 ms 3300 KB Output is correct
12 Correct 668 ms 52708 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 2 ms 492 KB Output is correct
17 Correct 34 ms 2660 KB Output is correct
18 Correct 666 ms 56832 KB Output is correct
19 Correct 700 ms 57304 KB Output is correct
20 Correct 4 ms 620 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 7 ms 876 KB Output is correct
25 Correct 27 ms 2284 KB Output is correct
26 Correct 23 ms 2284 KB Output is correct
27 Correct 672 ms 57920 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 0 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 38 ms 3428 KB Output is correct
33 Correct 6 ms 876 KB Output is correct
34 Correct 9 ms 1132 KB Output is correct
35 Correct 994 ms 55396 KB Output is correct
36 Correct 947 ms 51624 KB Output is correct
37 Correct 895 ms 51684 KB Output is correct
38 Correct 1000 ms 55436 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 3 ms 492 KB Output is correct
41 Correct 3 ms 636 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 ms 492 KB Output is correct
44 Correct 3 ms 492 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 492 KB Output is correct
48 Correct 3 ms 492 KB Output is correct
49 Correct 3 ms 492 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 29 ms 3300 KB Output is correct
52 Correct 31 ms 3428 KB Output is correct
53 Correct 33 ms 3428 KB Output is correct
54 Correct 39 ms 3428 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 31 ms 2788 KB Output is correct
59 Correct 34 ms 3296 KB Output is correct
60 Correct 33 ms 2788 KB Output is correct
61 Correct 35 ms 3300 KB Output is correct
62 Correct 75 ms 8548 KB Output is correct
63 Correct 78 ms 8548 KB Output is correct
64 Correct 119 ms 8804 KB Output is correct
65 Correct 368 ms 33380 KB Output is correct
66 Correct 438 ms 33796 KB Output is correct
67 Correct 8 ms 1132 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 695 ms 52324 KB Output is correct
70 Correct 848 ms 53556 KB Output is correct
71 Correct 986 ms 55412 KB Output is correct
72 Correct 785 ms 60772 KB Output is correct
73 Correct 919 ms 53220 KB Output is correct
74 Correct 730 ms 59196 KB Output is correct
75 Correct 804 ms 51684 KB Output is correct