oj.uz

Submission #432440

# Submission time Handle Problem Language Result Execution time Memory
432440 2021-06-18T09:55:35 Z arayi Carnival Tickets (IOI20_tickets) C++17
100 / 100
 942 ms 79372 KB 
#include "tickets.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <queue>
#define ad push_back
#define lli long long
#define MP make_pair
#define sc second
#define fr first
using namespace std;

const int N = 2222;
int n, m;
vector<vector<int> > a;
int zr[N], l[N], r[N];
lli sum;
long long find_maximum(int k, std::vector<std::vector<int>> x) 
{
	n = x.size();
	m = x[0].size();
	a.resize(n);
	for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) a[i].ad(-1);	
	priority_queue<pair<lli, int> > q, q1;
	for (int i = 0; i < n; i++)
	{
		r[i] = m - 1;
		if(i < n/2) zr[i] = k/2;
		else zr[i] = (k+1)/2;
		for (int j = 0; j < zr[i]; j++) sum -= x[i][j];
		for (int j = m - 1; j >= m - k + zr[i]; j--) sum += x[i][j];
		if(zr[i] != 0) q.push(MP(x[i][zr[i]-1]+x[i][m-k+zr[i]-1], i));
		if(zr[i] != k) q1.push(MP(-x[i][zr[i]]-x[i][m-k+zr[i]], i));
	}
	while ((q.top().fr + q1.top().fr) > 0)
	{
		int i = q.top().sc, i1 = q1.top().sc;
		if(zr[i] == 0 || ((x[i][zr[i]-1]+x[i][m-k+zr[i]-1]) != q.top().fr)) {q.pop(); continue;}
		if(zr[i1] == k || ((-x[i1][zr[i1]]-x[i1][m-k+zr[i1]]) != q1.top().fr)) {q1.pop(); continue;}
		sum += q.top().fr + q1.top().fr;
		q.pop(); q1.pop();
		zr[i]--; zr[i1]++;
		if(zr[i] != 0) q.push(MP(x[i][zr[i]-1]+x[i][m-k+zr[i]-1], i));
		if(zr[i] != k) q1.push(MP(-x[i][zr[i]]-x[i][m-k+zr[i]], i));
		i = i1;
		if(zr[i] != 0) q.push(MP(x[i][zr[i]-1]+x[i][m-k+zr[i]-1], i));
		if(zr[i] != k) q1.push(MP(-x[i][zr[i]]-x[i][m-k+zr[i]], i));
	}
	for (int i = 0; i < k; i++)
	{
		vector<pair<int, int> > fp;
		for (int j = 0; j < n; j++)
			fp.ad(MP(zr[j], j));
		sort(fp.begin(), fp.end());
		reverse(fp.begin(), fp.end());
		for (int j = 0; j < n / 2; j++)
			a[fp[j].sc][l[fp[j].sc]++] = i, zr[fp[j].sc]--;
		for (int j = n/2; j < n; j++)
			a[fp[j].sc][r[fp[j].sc]--] = i;
	}
	allocate_tickets(a);
	return sum;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 26 ms 2616 KB Output is correct
6 Correct 734 ms 54564 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 27 ms 2832 KB Output is correct
6 Correct 635 ms 60000 KB Output is correct
7 Correct 622 ms 60316 KB Output is correct
8 Correct 6 ms 588 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1008 KB Output is correct
13 Correct 23 ms 2464 KB Output is correct
14 Correct 23 ms 2244 KB Output is correct
15 Correct 824 ms 60956 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 32 ms 3532 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 8 ms 1024 KB Output is correct
8 Correct 836 ms 79208 KB Output is correct
9 Correct 889 ms 74724 KB Output is correct
10 Correct 942 ms 74016 KB Output is correct
11 Correct 911 ms 79372 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 3 ms 500 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 3 ms 500 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 26 ms 3504 KB Output is correct
14 Correct 27 ms 3512 KB Output is correct
15 Correct 33 ms 3524 KB Output is correct
16 Correct 32 ms 3612 KB Output is correct
17 Correct 2 ms 308 KB Output is correct
18 Correct 4 ms 568 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 28 ms 3052 KB Output is correct
21 Correct 30 ms 3548 KB Output is correct
22 Correct 31 ms 3004 KB Output is correct
23 Correct 34 ms 3544 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 26 ms 2616 KB Output is correct
12 Correct 734 ms 54564 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 27 ms 2832 KB Output is correct
18 Correct 635 ms 60000 KB Output is correct
19 Correct 622 ms 60316 KB Output is correct
20 Correct 6 ms 588 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 8 ms 1008 KB Output is correct
25 Correct 23 ms 2464 KB Output is correct
26 Correct 23 ms 2244 KB Output is correct
27 Correct 824 ms 60956 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 300 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 32 ms 3532 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 8 ms 1024 KB Output is correct
35 Correct 836 ms 79208 KB Output is correct
36 Correct 889 ms 74724 KB Output is correct
37 Correct 942 ms 74016 KB Output is correct
38 Correct 911 ms 79372 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 3 ms 500 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 308 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 26 ms 3504 KB Output is correct
52 Correct 27 ms 3512 KB Output is correct
53 Correct 33 ms 3524 KB Output is correct
54 Correct 32 ms 3612 KB Output is correct
55 Correct 2 ms 308 KB Output is correct
56 Correct 4 ms 568 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 28 ms 3052 KB Output is correct
59 Correct 30 ms 3548 KB Output is correct
60 Correct 31 ms 3004 KB Output is correct
61 Correct 34 ms 3544 KB Output is correct
62 Correct 76 ms 8388 KB Output is correct
63 Correct 70 ms 8388 KB Output is correct
64 Correct 86 ms 8800 KB Output is correct
65 Correct 338 ms 33252 KB Output is correct
66 Correct 436 ms 33764 KB Output is correct
67 Correct 7 ms 1100 KB Output is correct
68 Correct 6 ms 736 KB Output is correct
69 Correct 650 ms 76312 KB Output is correct
70 Correct 799 ms 77204 KB Output is correct
71 Correct 817 ms 79156 KB Output is correct
72 Correct 805 ms 64056 KB Output is correct
73 Correct 868 ms 76316 KB Output is correct
74 Correct 732 ms 62528 KB Output is correct
75 Correct 813 ms 75044 KB Output is correct