oj.uz

Submission #955056

# Submission time Handle Problem Language Result Execution time Memory
955056 2024-03-29T09:48:04 Z Trisanu_Das Carnival Tickets (IOI20_tickets) C++17
100 / 100
 678 ms 95248 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 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 500 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 17 ms 3116 KB Output is correct
6 Correct 413 ms 62508 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 800 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 17 ms 3028 KB Output is correct
6 Correct 442 ms 66776 KB Output is correct
7 Correct 464 ms 69908 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 1120 KB Output is correct
13 Correct 15 ms 2516 KB Output is correct
14 Correct 17 ms 2776 KB Output is correct
15 Correct 481 ms 73540 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 28 ms 4300 KB Output is correct
6 Correct 5 ms 884 KB Output is correct
7 Correct 5 ms 1116 KB Output is correct
8 Correct 678 ms 84296 KB Output is correct
9 Correct 630 ms 79268 KB Output is correct
10 Correct 615 ms 79468 KB Output is correct
11 Correct 663 ms 85044 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 21 ms 3164 KB Output is correct
14 Correct 19 ms 3276 KB Output is correct
15 Correct 21 ms 3540 KB Output is correct
16 Correct 26 ms 3912 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 596 KB Output is correct
20 Correct 21 ms 3292 KB Output is correct
21 Correct 21 ms 3536 KB Output is correct
22 Correct 24 ms 3384 KB Output is correct
23 Correct 24 ms 3780 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 500 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 17 ms 3116 KB Output is correct
12 Correct 413 ms 62508 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 800 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 428 KB Output is correct
17 Correct 17 ms 3028 KB Output is correct
18 Correct 442 ms 66776 KB Output is correct
19 Correct 464 ms 69908 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 5 ms 1120 KB Output is correct
25 Correct 15 ms 2516 KB Output is correct
26 Correct 17 ms 2776 KB Output is correct
27 Correct 481 ms 73540 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 2 ms 600 KB Output is correct
32 Correct 28 ms 4300 KB Output is correct
33 Correct 5 ms 884 KB Output is correct
34 Correct 5 ms 1116 KB Output is correct
35 Correct 678 ms 84296 KB Output is correct
36 Correct 630 ms 79268 KB Output is correct
37 Correct 615 ms 79468 KB Output is correct
38 Correct 663 ms 85044 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 2 ms 600 KB Output is correct
42 Correct 2 ms 600 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 2 ms 604 KB Output is correct
50 Correct 2 ms 604 KB Output is correct
51 Correct 21 ms 3164 KB Output is correct
52 Correct 19 ms 3276 KB Output is correct
53 Correct 21 ms 3540 KB Output is correct
54 Correct 26 ms 3912 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 2 ms 604 KB Output is correct
57 Correct 2 ms 596 KB Output is correct
58 Correct 21 ms 3292 KB Output is correct
59 Correct 21 ms 3536 KB Output is correct
60 Correct 24 ms 3384 KB Output is correct
61 Correct 24 ms 3780 KB Output is correct
62 Correct 46 ms 8532 KB Output is correct
63 Correct 48 ms 8532 KB Output is correct
64 Correct 71 ms 10604 KB Output is correct
65 Correct 233 ms 37236 KB Output is correct
66 Correct 288 ms 41392 KB Output is correct
67 Correct 5 ms 1116 KB Output is correct
68 Correct 4 ms 1040 KB Output is correct
69 Correct 454 ms 73296 KB Output is correct
70 Correct 528 ms 85044 KB Output is correct
71 Correct 673 ms 95248 KB Output is correct
72 Correct 604 ms 78452 KB Output is correct
73 Correct 636 ms 89544 KB Output is correct
74 Correct 489 ms 69372 KB Output is correct
75 Correct 519 ms 81832 KB Output is correct