oj.uz

Submission #320024

# Submission time Handle Problem Language Result Execution time Memory
320024 2020-11-07T09:52:41 Z wildturtle Carnival Tickets (IOI20_tickets) C++14
100 / 100
 963 ms 60772 KB 
#include "tickets.h"
#include<bits/stdc++.h>
using namespace std;
int idx,l,l1,A[500005];
long long ans;
set < pair < int , int > > st;
long long find_maximum(int k, vector< vector < int > > x) {
	int n=x.size();
	int m=x[0].size();
	for(int i=0;i<n;i++) {
	    for(int j=m-k;j<m;j++) {
	        ans+=x[i][j];
	    }
	    st.insert({x[i][m-k]+x[i][0],i});
	}
	for(int i=1;i<=(n*k)/2;i++) {
	    idx=(*st.begin()).second;
	    ans-=(*st.begin()).first;
	    st.erase(*st.begin());
	    A[idx]++;
	    if(A[idx]<k) st.insert({x[idx][m-k+A[idx]]+x[idx][A[idx]],idx});
	}
	vector < vector < int > > answer;
	for (int i = 0; i < n; i++) {
		vector<int> row;
		for (int j = 0; j < A[i]; j++) {
			row.push_back(l);
			l++;
			l%=k;
		}
		for(int j=A[i];j<m-(k-A[i]);j++) {
		    row.push_back(-1);
		}
		l1=l;
		for(int j=m-(k-A[i]);j<m;j++) {
		    row.push_back(l1);
		    l1++;
		    l1%=k;
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);
	return ans;
}
/*int main() {
    cout<<find_maximum(2, { {0, 2, 5}, {1, 1, 3} } );//2, [[0, 2, 5],[1, 1, 3]]
}*/

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 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 27 ms 3308 KB Output is correct
6 Correct 662 ms 52068 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 4 ms 492 KB Output is correct
5 Correct 26 ms 2668 KB Output is correct
6 Correct 634 ms 52964 KB Output is correct
7 Correct 657 ms 53368 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 492 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 7 ms 876 KB Output is correct
13 Correct 23 ms 2316 KB Output is correct
14 Correct 23 ms 2276 KB Output is correct
15 Correct 671 ms 53860 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 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 39 ms 3556 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 8 ms 1132 KB Output is correct
8 Correct 961 ms 55052 KB Output is correct
9 Correct 867 ms 51176 KB Output is correct
10 Correct 866 ms 51304 KB Output is correct
11 Correct 947 ms 54880 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 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 524 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 640 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 636 KB Output is correct
12 Correct 3 ms 492 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 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 524 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 640 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 636 KB Output is correct
12 Correct 3 ms 492 KB Output is correct
13 Correct 27 ms 3308 KB Output is correct
14 Correct 27 ms 3436 KB Output is correct
15 Correct 32 ms 3308 KB Output is correct
16 Correct 37 ms 3428 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 3 ms 620 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 30 ms 2784 KB Output is correct
21 Correct 32 ms 3308 KB Output is correct
22 Correct 32 ms 2788 KB Output is correct
23 Correct 35 ms 3428 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 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 27 ms 3308 KB Output is correct
12 Correct 662 ms 52068 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 4 ms 492 KB Output is correct
17 Correct 26 ms 2668 KB Output is correct
18 Correct 634 ms 52964 KB Output is correct
19 Correct 657 ms 53368 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 492 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 7 ms 876 KB Output is correct
25 Correct 23 ms 2316 KB Output is correct
26 Correct 23 ms 2276 KB Output is correct
27 Correct 671 ms 53860 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 492 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 39 ms 3556 KB Output is correct
33 Correct 6 ms 876 KB Output is correct
34 Correct 8 ms 1132 KB Output is correct
35 Correct 961 ms 55052 KB Output is correct
36 Correct 867 ms 51176 KB Output is correct
37 Correct 866 ms 51304 KB Output is correct
38 Correct 947 ms 54880 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 492 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 ms 524 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 640 KB Output is correct
48 Correct 3 ms 492 KB Output is correct
49 Correct 3 ms 636 KB Output is correct
50 Correct 3 ms 492 KB Output is correct
51 Correct 27 ms 3308 KB Output is correct
52 Correct 27 ms 3436 KB Output is correct
53 Correct 32 ms 3308 KB Output is correct
54 Correct 37 ms 3428 KB Output is correct
55 Correct 1 ms 492 KB Output is correct
56 Correct 3 ms 620 KB Output is correct
57 Correct 2 ms 492 KB Output is correct
58 Correct 30 ms 2784 KB Output is correct
59 Correct 32 ms 3308 KB Output is correct
60 Correct 32 ms 2788 KB Output is correct
61 Correct 35 ms 3428 KB Output is correct
62 Correct 78 ms 8676 KB Output is correct
63 Correct 74 ms 8548 KB Output is correct
64 Correct 108 ms 8804 KB Output is correct
65 Correct 360 ms 32100 KB Output is correct
66 Correct 410 ms 32740 KB Output is correct
67 Correct 8 ms 1132 KB Output is correct
68 Correct 6 ms 908 KB Output is correct
69 Correct 649 ms 51940 KB Output is correct
70 Correct 808 ms 52968 KB Output is correct
71 Correct 963 ms 54924 KB Output is correct
72 Correct 779 ms 60772 KB Output is correct
73 Correct 881 ms 52708 KB Output is correct
74 Correct 690 ms 59376 KB Output is correct
75 Correct 790 ms 51428 KB Output is correct