oj.uz

Submission #337267

# Submission time Handle Problem Language Result Execution time Memory
337267 2020-12-19T06:06:28 Z Register Carnival Tickets (IOI20_tickets) C++14
100 / 100
 974 ms 72084 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;
void allocate_tickets(vvec x);
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 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 26 ms 3308 KB Output is correct
6 Correct 625 ms 51564 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 26 ms 2916 KB Output is correct
6 Correct 677 ms 62876 KB Output is correct
7 Correct 693 ms 66104 KB Output is correct
8 Correct 5 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 7 ms 1004 KB Output is correct
13 Correct 25 ms 2532 KB Output is correct
14 Correct 24 ms 2540 KB Output is correct
15 Correct 709 ms 67640 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 38 ms 4192 KB Output is correct
6 Correct 7 ms 1004 KB Output is correct
7 Correct 7 ms 1260 KB Output is correct
8 Correct 973 ms 72032 KB Output is correct
9 Correct 902 ms 67244 KB Output is correct
10 Correct 904 ms 67224 KB Output is correct
11 Correct 965 ms 72084 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 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 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 492 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 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 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 620 KB Output is correct
5 Correct 3 ms 620 KB Output is correct
6 Correct 3 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 492 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 3 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 28 ms 3308 KB Output is correct
14 Correct 26 ms 3308 KB Output is correct
15 Correct 32 ms 3700 KB Output is correct
16 Correct 37 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 32 ms 3180 KB Output is correct
21 Correct 32 ms 3684 KB Output is correct
22 Correct 35 ms 3560 KB Output is correct
23 Correct 35 ms 3884 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 26 ms 3308 KB Output is correct
12 Correct 625 ms 51564 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 26 ms 2916 KB Output is correct
18 Correct 677 ms 62876 KB Output is correct
19 Correct 693 ms 66104 KB Output is correct
20 Correct 5 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 7 ms 1004 KB Output is correct
25 Correct 25 ms 2532 KB Output is correct
26 Correct 24 ms 2540 KB Output is correct
27 Correct 709 ms 67640 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 38 ms 4192 KB Output is correct
33 Correct 7 ms 1004 KB Output is correct
34 Correct 7 ms 1260 KB Output is correct
35 Correct 973 ms 72032 KB Output is correct
36 Correct 902 ms 67244 KB Output is correct
37 Correct 904 ms 67224 KB Output is correct
38 Correct 965 ms 72084 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 620 KB Output is correct
43 Correct 3 ms 620 KB Output is correct
44 Correct 3 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 492 KB Output is correct
48 Correct 3 ms 620 KB Output is correct
49 Correct 3 ms 620 KB Output is correct
50 Correct 3 ms 620 KB Output is correct
51 Correct 28 ms 3308 KB Output is correct
52 Correct 26 ms 3308 KB Output is correct
53 Correct 32 ms 3700 KB Output is correct
54 Correct 37 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 32 ms 3180 KB Output is correct
59 Correct 32 ms 3684 KB Output is correct
60 Correct 35 ms 3560 KB Output is correct
61 Correct 35 ms 3884 KB Output is correct
62 Correct 71 ms 6124 KB Output is correct
63 Correct 71 ms 6124 KB Output is correct
64 Correct 104 ms 8292 KB Output is correct
65 Correct 353 ms 27408 KB Output is correct
66 Correct 426 ms 31820 KB Output is correct
67 Correct 7 ms 1004 KB Output is correct
68 Correct 7 ms 876 KB Output is correct
69 Correct 639 ms 51532 KB Output is correct
70 Correct 801 ms 61240 KB Output is correct
71 Correct 974 ms 72020 KB Output is correct
72 Correct 891 ms 68712 KB Output is correct
73 Correct 903 ms 68216 KB Output is correct
74 Correct 759 ms 60276 KB Output is correct
75 Correct 767 ms 59956 KB Output is correct