oj.uz

Submission #354515

# Submission time Handle Problem Language Result Execution time Memory
354515 2021-01-22T02:44:19 Z juggernaut Carnival Tickets (IOI20_tickets) C++14
100 / 100
 891 ms 58860 KB 
//Thank you
#include"tickets.h"
#ifndef EVAL
#include"stub.cpp"
#endif
#include<bits/stdc++.h>
using namespace std;
int l[1505],r[1505];
typedef long long ll;
bool cmp(int x,int y){return (l[x]>l[y]);}
long long find_maximum(int k,vector<vector<int> > arr) {
	priority_queue<pair<ll,int>>q;ll res=0;
	int n=arr.size(),m=arr[0].size();vector<int>ind(n);
	vector<vector<int>>answer(n,vector<int>(m,-1));
	for(int i=0;i<n;i++){ind[i]=i;
		for(int j=0;j<k;j++)res-=arr[i][j];
		q.push({arr[i][l[i]=k-1]+arr[i][r[i]=m-1],i});
	}
	for(int i=0;i<(n*k)>>1;i++){
		int ind=q.top().second;res+=q.top().first;q.pop();--l[ind];--r[ind];
		if(l[ind]>=0)q.push({arr[ind][l[ind]]+arr[ind][r[ind]],ind});
	}
	while(k--){sort(ind.begin(),ind.end(),cmp);	
		for(int i=0;i<n>>1;i++)answer[ind[i]][l[ind[i]]--]=k;
		for(int i=n>>1;i<n;i++)answer[ind[i]][++r[ind[i]]]=k;
	}
	allocate_tickets(answer);
	return res;
}

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 3 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 649 ms 51948 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 3 ms 492 KB Output is correct
5 Correct 25 ms 2668 KB Output is correct
6 Correct 637 ms 55660 KB Output is correct
7 Correct 660 ms 56416 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 23 ms 2284 KB Output is correct
14 Correct 28 ms 2284 KB Output is correct
15 Correct 684 ms 57636 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 34 ms 3308 KB Output is correct
6 Correct 6 ms 876 KB Output is correct
7 Correct 7 ms 1004 KB Output is correct
8 Correct 865 ms 54892 KB Output is correct
9 Correct 841 ms 51052 KB Output is correct
10 Correct 820 ms 51176 KB Output is correct
11 Correct 884 ms 54588 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 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 4 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 620 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 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 4 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 3 ms 620 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 3308 KB Output is correct
15 Correct 30 ms 3308 KB Output is correct
16 Correct 34 ms 3308 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 29 ms 2668 KB Output is correct
21 Correct 30 ms 3180 KB Output is correct
22 Correct 30 ms 2796 KB Output is correct
23 Correct 32 ms 3308 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 3 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 649 ms 51948 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 3 ms 492 KB Output is correct
17 Correct 25 ms 2668 KB Output is correct
18 Correct 637 ms 55660 KB Output is correct
19 Correct 660 ms 56416 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 23 ms 2284 KB Output is correct
26 Correct 28 ms 2284 KB Output is correct
27 Correct 684 ms 57636 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 34 ms 3308 KB Output is correct
33 Correct 6 ms 876 KB Output is correct
34 Correct 7 ms 1004 KB Output is correct
35 Correct 865 ms 54892 KB Output is correct
36 Correct 841 ms 51052 KB Output is correct
37 Correct 820 ms 51176 KB Output is correct
38 Correct 884 ms 54588 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 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 4 ms 492 KB Output is correct
48 Correct 3 ms 492 KB Output is correct
49 Correct 3 ms 620 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 3308 KB Output is correct
53 Correct 30 ms 3308 KB Output is correct
54 Correct 34 ms 3308 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 29 ms 2668 KB Output is correct
59 Correct 30 ms 3180 KB Output is correct
60 Correct 30 ms 2796 KB Output is correct
61 Correct 32 ms 3308 KB Output is correct
62 Correct 73 ms 8556 KB Output is correct
63 Correct 72 ms 8556 KB Output is correct
64 Correct 93 ms 8684 KB Output is correct
65 Correct 341 ms 30120 KB Output is correct
66 Correct 377 ms 30572 KB Output is correct
67 Correct 7 ms 1004 KB Output is correct
68 Correct 6 ms 876 KB Output is correct
69 Correct 649 ms 51792 KB Output is correct
70 Correct 763 ms 52844 KB Output is correct
71 Correct 866 ms 54764 KB Output is correct
72 Correct 731 ms 58860 KB Output is correct
73 Correct 891 ms 52716 KB Output is correct
74 Correct 640 ms 57324 KB Output is correct
75 Correct 740 ms 51180 KB Output is correct