oj.uz

Submission #470458

# Submission time Handle Problem Language Result Execution time Memory
470458 2021-09-03T21:05:34 Z Namnamseo Meetings (JOI19_meetings) C++17
29 / 100
 2000 ms 1120 KB 
#include "meetings.h"
#include <algorithm>
#include <map>
#include <numeric>
#include <vector>
using namespace std;

void bridge(int a, int b) { if (a>b) swap(a, b); Bridge(a, b); }

void work_set(vector<int> &v) {
	if (v.size() == 1u) return;
	int a = v[0], b = v[1], n = v.size();
	map<int, vector<int>> roots;
	roots[a] = {a}; roots[b] = {b};
	for (int i=2; i<n; ++i) roots[Query(a, b, v[i])].push_back(v[i]);
	for (auto &tmp : roots) work_set(tmp.second);
	n = roots.size()-2u;
	vector<int> foots; foots.reserve(n);
	for (auto &tmp : roots) if (tmp.first != a && tmp.first != b) foots.push_back(tmp.first);
	if (foots.empty()) { bridge(a, b); return; }
	roots = move(decltype(roots)());
	sort(foots.begin(), foots.end(), [&](const int& x, const int& y) {
		return Query(x, y, a) == x;
	});
	bridge(a, foots[0]);
	for (int i=1; i<n; ++i) bridge(foots[i-1], foots[i]);
	bridge(foots[n-1], b);
}

void Solve(int N) {
	vector<int> v(N);
	iota(v.begin(), v.end(), 0);
	work_set(v);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 200 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 200 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 0 ms 328 KB Output is correct
16 Correct 0 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 0 ms 328 KB Output is correct
23 Correct 0 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 0 ms 328 KB Output is correct
3 Correct 0 ms 328 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 328 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 328 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 200 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 328 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 0 ms 328 KB Output is correct
14 Correct 0 ms 328 KB Output is correct
15 Correct 0 ms 328 KB Output is correct
16 Correct 0 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 0 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 0 ms 328 KB Output is correct
23 Correct 0 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 5 ms 328 KB Output is correct
28 Correct 5 ms 328 KB Output is correct
29 Correct 6 ms 328 KB Output is correct
30 Correct 5 ms 328 KB Output is correct
31 Correct 5 ms 456 KB Output is correct
32 Correct 6 ms 328 KB Output is correct
33 Correct 10 ms 456 KB Output is correct
34 Correct 11 ms 328 KB Output is correct
35 Correct 13 ms 372 KB Output is correct
36 Correct 6 ms 328 KB Output is correct
37 Correct 10 ms 328 KB Output is correct
38 Correct 13 ms 328 KB Output is correct
39 Correct 175 ms 704 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 672 KB Output is correct
2 Correct 493 ms 516 KB Output is correct
3 Correct 493 ms 832 KB Output is correct
4 Correct 469 ms 496 KB Output is correct
5 Correct 366 ms 564 KB Output is correct
6 Correct 386 ms 568 KB Output is correct
7 Correct 495 ms 652 KB Output is correct
8 Correct 554 ms 752 KB Output is correct
9 Correct 554 ms 616 KB Output is correct
10 Correct 540 ms 712 KB Output is correct
11 Correct 607 ms 708 KB Output is correct
12 Correct 420 ms 684 KB Output is correct
13 Correct 300 ms 772 KB Output is correct
14 Correct 544 ms 576 KB Output is correct
15 Correct 362 ms 576 KB Output is correct
16 Correct 419 ms 524 KB Output is correct
17 Correct 869 ms 576 KB Output is correct
18 Execution timed out 2459 ms 1120 KB Time limit exceeded
19 Halted 0 ms 0 KB -