oj.uz

답안 #404710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404710 2021-05-14T21:07:25 Z bipartite_matching 카니발 티켓 (IOI20_tickets) C++14
100 / 100
 837 ms 54884 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());
		nth_element(v.begin(), v.begin() + n/2, 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 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

# 결과 실행 시간 메모리 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 26 ms 2500 KB Output is correct
6 Correct 633 ms 51808 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 448 KB Output is correct
5 Correct 24 ms 2512 KB Output is correct
6 Correct 627 ms 52760 KB Output is correct
7 Correct 625 ms 53048 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 204 KB Output is correct
11 Correct 1 ms 292 KB Output is correct
12 Correct 7 ms 844 KB Output is correct
13 Correct 21 ms 2112 KB Output is correct
14 Correct 21 ms 2068 KB Output is correct
15 Correct 633 ms 53564 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 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 492 KB Output is correct
5 Correct 32 ms 2576 KB Output is correct
6 Correct 6 ms 676 KB Output is correct
7 Correct 7 ms 972 KB Output is correct
8 Correct 803 ms 54344 KB Output is correct
9 Correct 769 ms 50944 KB Output is correct
10 Correct 780 ms 51064 KB Output is correct
11 Correct 837 ms 54340 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 436 KB Output is correct
6 Correct 3 ms 460 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 4 ms 488 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 436 KB Output is correct
6 Correct 3 ms 460 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 4 ms 488 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 2572 KB Output is correct
14 Correct 26 ms 2556 KB Output is correct
15 Correct 37 ms 2624 KB Output is correct
16 Correct 31 ms 2676 KB Output is correct
17 Correct 2 ms 320 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 432 KB Output is correct
20 Correct 27 ms 2508 KB Output is correct
21 Correct 36 ms 2500 KB Output is correct
22 Correct 28 ms 2572 KB Output is correct
23 Correct 31 ms 2500 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 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 26 ms 2500 KB Output is correct
12 Correct 633 ms 51808 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 292 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 448 KB Output is correct
17 Correct 24 ms 2512 KB Output is correct
18 Correct 627 ms 52760 KB Output is correct
19 Correct 625 ms 53048 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 204 KB Output is correct
23 Correct 1 ms 292 KB Output is correct
24 Correct 7 ms 844 KB Output is correct
25 Correct 21 ms 2112 KB Output is correct
26 Correct 21 ms 2068 KB Output is correct
27 Correct 633 ms 53564 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 204 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 32 ms 2576 KB Output is correct
33 Correct 6 ms 676 KB Output is correct
34 Correct 7 ms 972 KB Output is correct
35 Correct 803 ms 54344 KB Output is correct
36 Correct 769 ms 50944 KB Output is correct
37 Correct 780 ms 51064 KB Output is correct
38 Correct 837 ms 54340 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 484 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 436 KB Output is correct
44 Correct 3 ms 460 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 4 ms 488 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 2572 KB Output is correct
52 Correct 26 ms 2556 KB Output is correct
53 Correct 37 ms 2624 KB Output is correct
54 Correct 31 ms 2676 KB Output is correct
55 Correct 2 ms 320 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 432 KB Output is correct
58 Correct 27 ms 2508 KB Output is correct
59 Correct 36 ms 2500 KB Output is correct
60 Correct 28 ms 2572 KB Output is correct
61 Correct 31 ms 2500 KB Output is correct
62 Correct 69 ms 6192 KB Output is correct
63 Correct 68 ms 6208 KB Output is correct
64 Correct 84 ms 6468 KB Output is correct
65 Correct 306 ms 23660 KB Output is correct
66 Correct 346 ms 24116 KB Output is correct
67 Correct 9 ms 972 KB Output is correct
68 Correct 6 ms 716 KB Output is correct
69 Correct 627 ms 52008 KB Output is correct
70 Correct 730 ms 53016 KB Output is correct
71 Correct 814 ms 54884 KB Output is correct
72 Correct 720 ms 52292 KB Output is correct
73 Correct 813 ms 52464 KB Output is correct
74 Correct 617 ms 51240 KB Output is correct
75 Correct 708 ms 51120 KB Output is correct