oj.uz

Submission #337268

# Submission time Handle Problem Language Result Execution time Memory
337268 2020-12-19T06:16:53 Z Register Carnival Tickets (IOI20_tickets) C++14
100 / 100
 993 ms 72212 KB 
#include <bits/stdc++.h>
#include "tickets.h"
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vec> vvec;
const int N=1505;
int n,m,d[N],s[N];
ll sum;
vector<pair<int,int> > v,l;
ll find_maximum(int k,vvec x){
	n=x.size();m=x[0].size();
	vvec ans(n,vec(m,-1));
	for(int i=0;i<n;i++)
		for(int j=0;j<k;j++) {sum+=x[i][m-1-j];v.push_back(make_pair(x[i][j]+x[i][m-k+j],i));}
	sort(v.begin(),v.end());
	for(int i=0;i<n*k/2;i++) {sum-=v[i].fi;d[v[i].se]++;}
	for(int i=0;i<n;i++){
		l.clear();
		for(int j=0;j<k;j++) l.push_back(make_pair(s[j],j));
		sort(l.begin(),l.end());
		for(int j=0;j<k;j++)
			if(j<d[i]) {ans[i][j]=l[j].se;s[l[j].se]++;}
			else ans[i][m-k+j]=l[j].se;
	}
	allocate_tickets(ans);return sum;
}

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 0 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 492 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 512 KB Output is correct
5 Correct 26 ms 2412 KB Output is correct
6 Correct 637 ms 51436 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 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 26 ms 2788 KB Output is correct
6 Correct 672 ms 61624 KB Output is correct
7 Correct 711 ms 64864 KB Output is correct
8 Correct 4 ms 768 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 11 ms 1004 KB Output is correct
13 Correct 23 ms 2532 KB Output is correct
14 Correct 24 ms 2540 KB Output is correct
15 Correct 721 ms 67768 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 492 KB Output is correct
5 Correct 37 ms 3168 KB Output is correct
6 Correct 7 ms 876 KB Output is correct
7 Correct 7 ms 1004 KB Output is correct
8 Correct 993 ms 71984 KB Output is correct
9 Correct 901 ms 67216 KB Output is correct
10 Correct 903 ms 67352 KB Output is correct
11 Correct 970 ms 72212 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 2 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 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 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 2 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 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 492 KB Output is correct
13 Correct 26 ms 2412 KB Output is correct
14 Correct 28 ms 2412 KB Output is correct
15 Correct 32 ms 2788 KB Output is correct
16 Correct 37 ms 3168 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 1 ms 492 KB Output is correct
20 Correct 32 ms 2796 KB Output is correct
21 Correct 33 ms 2916 KB Output is correct
22 Correct 36 ms 3176 KB Output is correct
23 Correct 35 ms 3040 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 0 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 492 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 512 KB Output is correct
11 Correct 26 ms 2412 KB Output is correct
12 Correct 637 ms 51436 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 26 ms 2788 KB Output is correct
18 Correct 672 ms 61624 KB Output is correct
19 Correct 711 ms 64864 KB Output is correct
20 Correct 4 ms 768 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 11 ms 1004 KB Output is correct
25 Correct 23 ms 2532 KB Output is correct
26 Correct 24 ms 2540 KB Output is correct
27 Correct 721 ms 67768 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 492 KB Output is correct
32 Correct 37 ms 3168 KB Output is correct
33 Correct 7 ms 876 KB Output is correct
34 Correct 7 ms 1004 KB Output is correct
35 Correct 993 ms 71984 KB Output is correct
36 Correct 901 ms 67216 KB Output is correct
37 Correct 903 ms 67352 KB Output is correct
38 Correct 970 ms 72212 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 2 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 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 492 KB Output is correct
51 Correct 26 ms 2412 KB Output is correct
52 Correct 28 ms 2412 KB Output is correct
53 Correct 32 ms 2788 KB Output is correct
54 Correct 37 ms 3168 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 1 ms 492 KB Output is correct
58 Correct 32 ms 2796 KB Output is correct
59 Correct 33 ms 2916 KB Output is correct
60 Correct 36 ms 3176 KB Output is correct
61 Correct 35 ms 3040 KB Output is correct
62 Correct 72 ms 6252 KB Output is correct
63 Correct 71 ms 6124 KB Output is correct
64 Correct 104 ms 8292 KB Output is correct
65 Correct 351 ms 27628 KB Output is correct
66 Correct 426 ms 31820 KB Output is correct
67 Correct 7 ms 1004 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 637 ms 51564 KB Output is correct
70 Correct 800 ms 61240 KB Output is correct
71 Correct 987 ms 72084 KB Output is correct
72 Correct 895 ms 68632 KB Output is correct
73 Correct 915 ms 68404 KB Output is correct
74 Correct 741 ms 60220 KB Output is correct
75 Correct 781 ms 59956 KB Output is correct