oj.uz

Submission #404709

# Submission time Handle Problem Language Result Execution time Memory
404709 2021-05-14T21:04:45 Z bipartite_matching Carnival Tickets (IOI20_tickets) C++14
100 / 100
 900 ms 75820 KB 
#include <bits/stdc++.h>

#define forint(i, N) for (int i = 0; i < (N); i++)

using namespace std;

void allocate_tickets(vector< vector<int> > s);

long long find_maximum(int k, vector< vector<int> > x) {

	int n = x.size();
	int m = x[0].size();

	//long long ans = 0;

	//vector< vector<bool> > minval(n, vector<bool>(k, true));
	//vector< vector<bool> > plusval(n, vector<bool>(k, false));

	vector< pair<int, int> > last_coor(n, make_pair(m - 1, k - 1));

	priority_queue< pair<int, int> > q;
	
	forint(i, n) {
		q.push(make_pair(x[i][k - 1] + x[i][m - 1], i));
	}

	forint(i, k * n / 2) {
		auto pos = q.top();
		q.pop();

		//minval[pos.second][last_coor[pos.second].first] = false;

		last_coor[pos.second].first--;
		last_coor[pos.second].second--;

		if (last_coor[pos.second].second >= 0) {
			q.push({x[pos.second][last_coor[pos.second].first] + x[pos.second][last_coor[pos.second].second], pos.second});
		}

	}

	/*
	for (auto& i : minval) {
		for (auto& j : i) {
			cerr << minval << endl;
		}
	}
	

	for (auto a : last_coor) {
		cerr << a.first << "---" << a.second << endl;
	}
*/

	vector< vector<int> > round(n, vector<int> (m, -1));	

	long long val = 0;

	forint(i, k) {

		vector< pair<int, int> > v(n);
		forint(j, n) {
			v[j].first = last_coor[j].first;
			v[j].second = j;
		}

		sort(v.begin(), v.end());

		for(int j = 0; j < n/2; j++) {
			val += x[v[j].second][last_coor[v[j].second].first + 1];
			round[v[j].second][last_coor[v[j].second].first + 1] = i;
			last_coor[v[j].second].first++;
		}

		for(int j = n/2; j < n; j++) {
			val -= x[v[j].second][last_coor[v[j].second].second];
			round[v[j].second][last_coor[v[j].second].second] = i;
			last_coor[v[j].second].second--;
		}

	}


	
	allocate_tickets(round);
	
	return val;
}

Subtask #1
11.0 / 11.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 1 ms 292 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 3 ms 460 KB Output is correct
5 Correct 25 ms 3168 KB Output is correct
6 Correct 600 ms 53048 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 3 ms 460 KB Output is correct
5 Correct 25 ms 2536 KB Output is correct
6 Correct 624 ms 56676 KB Output is correct
7 Correct 671 ms 57028 KB Output is correct
8 Correct 4 ms 460 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 296 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 7 ms 812 KB Output is correct
13 Correct 22 ms 2124 KB Output is correct
14 Correct 22 ms 2144 KB Output is correct
15 Correct 699 ms 57744 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 204 KB Output is correct
3 Correct 1 ms 292 KB Output is correct
4 Correct 3 ms 432 KB Output is correct
5 Correct 33 ms 3268 KB Output is correct
6 Correct 6 ms 716 KB Output is correct
7 Correct 7 ms 908 KB Output is correct
8 Correct 838 ms 75820 KB Output is correct
9 Correct 824 ms 52200 KB Output is correct
10 Correct 834 ms 52364 KB Output is correct
11 Correct 900 ms 73324 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 488 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 488 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 432 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 488 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 3 ms 460 KB Output is correct
10 Correct 3 ms 488 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 27 ms 3148 KB Output is correct
14 Correct 28 ms 3220 KB Output is correct
15 Correct 29 ms 3220 KB Output is correct
16 Correct 33 ms 3348 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 3 ms 332 KB Output is correct
20 Correct 28 ms 2572 KB Output is correct
21 Correct 31 ms 3232 KB Output is correct
22 Correct 32 ms 2572 KB Output is correct
23 Correct 32 ms 3100 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 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 292 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 3 ms 460 KB Output is correct
11 Correct 25 ms 3168 KB Output is correct
12 Correct 600 ms 53048 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 3 ms 460 KB Output is correct
17 Correct 25 ms 2536 KB Output is correct
18 Correct 624 ms 56676 KB Output is correct
19 Correct 671 ms 57028 KB Output is correct
20 Correct 4 ms 460 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 296 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 7 ms 812 KB Output is correct
25 Correct 22 ms 2124 KB Output is correct
26 Correct 22 ms 2144 KB Output is correct
27 Correct 699 ms 57744 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 292 KB Output is correct
31 Correct 3 ms 432 KB Output is correct
32 Correct 33 ms 3268 KB Output is correct
33 Correct 6 ms 716 KB Output is correct
34 Correct 7 ms 908 KB Output is correct
35 Correct 838 ms 75820 KB Output is correct
36 Correct 824 ms 52200 KB Output is correct
37 Correct 834 ms 52364 KB Output is correct
38 Correct 900 ms 73324 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 488 KB Output is correct
41 Correct 3 ms 432 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 488 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 3 ms 460 KB Output is correct
48 Correct 3 ms 488 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 4 ms 460 KB Output is correct
51 Correct 27 ms 3148 KB Output is correct
52 Correct 28 ms 3220 KB Output is correct
53 Correct 29 ms 3220 KB Output is correct
54 Correct 33 ms 3348 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 3 ms 332 KB Output is correct
58 Correct 28 ms 2572 KB Output is correct
59 Correct 31 ms 3232 KB Output is correct
60 Correct 32 ms 2572 KB Output is correct
61 Correct 32 ms 3100 KB Output is correct
62 Correct 70 ms 8336 KB Output is correct
63 Correct 69 ms 8360 KB Output is correct
64 Correct 89 ms 8512 KB Output is correct
65 Correct 323 ms 33096 KB Output is correct
66 Correct 360 ms 33640 KB Output is correct
67 Correct 7 ms 972 KB Output is correct
68 Correct 6 ms 716 KB Output is correct
69 Correct 627 ms 53092 KB Output is correct
70 Correct 739 ms 54192 KB Output is correct
71 Correct 837 ms 64124 KB Output is correct
72 Correct 756 ms 52292 KB Output is correct
73 Correct 858 ms 52548 KB Output is correct
74 Correct 668 ms 58980 KB Output is correct
75 Correct 733 ms 51140 KB Output is correct