oj.uz

Submission #542203

# Submission time Handle Problem Language Result Execution time Memory
542203 2022-03-25T16:44:22 Z NaimSS Carnival Tickets (IOI20_tickets) C++14
100 / 100
 899 ms 74520 KB 
#include "tickets.h"
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
typedef pair<int,int> pii;
const int N = 1550;
int L[N],R[N];
int ptL[N],ptR[N];

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> ans(n,vector<int>(m,-1));
	long long sum=0;
	vector<pii> vals;
	for(int i=0;i<n;i++){
		ptL[i]=0,ptR[i] = m-1;
		L[i] = 0;
		R[i] = k;
		for(int j=0;j<k;j++){
			vals.push_back(pii(x[i][j] + x[i][m-k+j],i));
		}
	}
	sort(vals.begin(),vals.end());
	for(int i=0;i<n*k/2;i++){
		auto it = vals[i];
		L[it.second]++;
		R[it.second]--;
	}
	for(int r=0;r<k;r++){
		vector<pii> pos;
		for(int i=0;i<n;i++){
			pos.push_back(pii(L[i],i));
		}
		sort(pos.begin(),pos.end());
		for(int i=0;i<n;i++){
			int id = pos[i].second;
			if(i < n/2){
				// R:
				R[id]--;
				sum += x[id][ptR[id]];
				ans[id][ptR[id]--] = r;
			}else{
				L[id]--;
				sum -= x[id][ptL[id]];
				ans[id][ptL[id]++] = r;
			}
		}

	}
	allocate_tickets(ans);
	return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 700 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 25 ms 2728 KB Output is correct
6 Correct 513 ms 51736 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 22 ms 2628 KB Output is correct
6 Correct 514 ms 53452 KB Output is correct
7 Correct 551 ms 56444 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 6 ms 860 KB Output is correct
13 Correct 19 ms 2380 KB Output is correct
14 Correct 22 ms 2356 KB Output is correct
15 Correct 589 ms 58888 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 500 KB Output is correct
5 Correct 31 ms 3620 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 6 ms 1108 KB Output is correct
8 Correct 843 ms 69912 KB Output is correct
9 Correct 805 ms 74116 KB Output is correct
10 Correct 809 ms 74520 KB Output is correct
11 Correct 899 ms 67608 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 576 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 436 KB Output is correct
4 Correct 2 ms 500 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 3 ms 576 KB Output is correct
13 Correct 20 ms 3260 KB Output is correct
14 Correct 25 ms 3292 KB Output is correct
15 Correct 28 ms 3288 KB Output is correct
16 Correct 35 ms 3648 KB Output is correct
17 Correct 1 ms 316 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 25 ms 2772 KB Output is correct
21 Correct 30 ms 3440 KB Output is correct
22 Correct 31 ms 2984 KB Output is correct
23 Correct 33 ms 3520 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 700 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 25 ms 2728 KB Output is correct
12 Correct 513 ms 51736 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 22 ms 2628 KB Output is correct
18 Correct 514 ms 53452 KB Output is correct
19 Correct 551 ms 56444 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 6 ms 860 KB Output is correct
25 Correct 19 ms 2380 KB Output is correct
26 Correct 22 ms 2356 KB Output is correct
27 Correct 589 ms 58888 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 3 ms 500 KB Output is correct
32 Correct 31 ms 3620 KB Output is correct
33 Correct 5 ms 852 KB Output is correct
34 Correct 6 ms 1108 KB Output is correct
35 Correct 843 ms 69912 KB Output is correct
36 Correct 805 ms 74116 KB Output is correct
37 Correct 809 ms 74520 KB Output is correct
38 Correct 899 ms 67608 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 436 KB Output is correct
42 Correct 2 ms 500 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 1 ms 340 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 4 ms 468 KB Output is correct
48 Correct 3 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 3 ms 576 KB Output is correct
51 Correct 20 ms 3260 KB Output is correct
52 Correct 25 ms 3292 KB Output is correct
53 Correct 28 ms 3288 KB Output is correct
54 Correct 35 ms 3648 KB Output is correct
55 Correct 1 ms 316 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 2 ms 468 KB Output is correct
58 Correct 25 ms 2772 KB Output is correct
59 Correct 30 ms 3440 KB Output is correct
60 Correct 31 ms 2984 KB Output is correct
61 Correct 33 ms 3520 KB Output is correct
62 Correct 56 ms 8396 KB Output is correct
63 Correct 53 ms 8372 KB Output is correct
64 Correct 92 ms 9660 KB Output is correct
65 Correct 278 ms 33588 KB Output is correct
66 Correct 383 ms 37584 KB Output is correct
67 Correct 10 ms 1128 KB Output is correct
68 Correct 8 ms 832 KB Output is correct
69 Correct 529 ms 59816 KB Output is correct
70 Correct 761 ms 59972 KB Output is correct
71 Correct 864 ms 68840 KB Output is correct
72 Correct 796 ms 67852 KB Output is correct
73 Correct 864 ms 67412 KB Output is correct
74 Correct 642 ms 60860 KB Output is correct
75 Correct 752 ms 60664 KB Output is correct