Submission #201189

# Submission time Handle Problem Language Result Execution time Memory
201189 2020-02-09T17:19:20 Z extraterrestrial Meetings (JOI19_meetings) C++14
100 / 100
696 ms 2744 KB
#include "meetings.h"
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
mt19937 rnd(228);

int root, n;

bool cmp(int u, int v) {
	if (u == v) {
		return false;
	}
	return Query(root, u, v) == u;
}

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

void dfs(int v, vector<int> cur) {
	int u = cur[rnd() % SZ(cur)];
	vector<vector<int>> have(n);
	vector<int> on_path;
	for (int i = 0; i < SZ(cur); i++) {
		int w = cur[i];
		if (w != u) {
			int x = Query(u, v, w);
			if (x == w) {
				on_path.pb(w);
			}
			else {
				have[x].pb(w);
			}
		}
	}
	root = v;
	if (!on_path.empty()) {
		stable_sort(all(on_path), cmp);
		add(v, on_path[0]);
		for (int i = 0; i + 1 < SZ(on_path); i++) {
			add(on_path[i], on_path[i + 1]);
		}
		add(on_path.back(), u);
	}
	else {
		add(u, v);
	}
	if (!have[v].empty()) {
		dfs(v, have[v]);
	}
	if (!have[u].empty()) {
		dfs(u, have[u]);
	}
	for (int x : on_path) {
		if (!have[x].empty()) {
			dfs(x, have[x]);
		}
	}
}

void Solve(int sz) {
	n = sz;
	int root = rnd() % n;
	vector<int> cur;
	for (int i = 0; i < n; i++) {
		if (i != root) {
			cur.pb(i);
		}
	}
	dfs(root, cur);
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 252 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 252 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 248 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 252 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 252 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 248 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 380 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 248 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 252 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 248 KB Output is correct
7 Correct 5 ms 252 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 248 KB Output is correct
10 Correct 4 ms 248 KB Output is correct
11 Correct 5 ms 248 KB Output is correct
12 Correct 5 ms 248 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 380 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 5 ms 376 KB Output is correct
23 Correct 5 ms 376 KB Output is correct
24 Correct 5 ms 376 KB Output is correct
25 Correct 5 ms 376 KB Output is correct
26 Correct 5 ms 376 KB Output is correct
27 Correct 9 ms 504 KB Output is correct
28 Correct 9 ms 504 KB Output is correct
29 Correct 10 ms 376 KB Output is correct
30 Correct 10 ms 504 KB Output is correct
31 Correct 8 ms 380 KB Output is correct
32 Correct 11 ms 504 KB Output is correct
33 Correct 15 ms 508 KB Output is correct
34 Correct 16 ms 632 KB Output is correct
35 Correct 15 ms 632 KB Output is correct
36 Correct 9 ms 376 KB Output is correct
37 Correct 16 ms 376 KB Output is correct
38 Correct 14 ms 436 KB Output is correct
39 Correct 11 ms 508 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 335 ms 1400 KB Output is correct
2 Correct 428 ms 1400 KB Output is correct
3 Correct 436 ms 1388 KB Output is correct
4 Correct 474 ms 1332 KB Output is correct
5 Correct 317 ms 1272 KB Output is correct
6 Correct 302 ms 1308 KB Output is correct
7 Correct 483 ms 1924 KB Output is correct
8 Correct 555 ms 2220 KB Output is correct
9 Correct 510 ms 2304 KB Output is correct
10 Correct 502 ms 2532 KB Output is correct
11 Correct 590 ms 2596 KB Output is correct
12 Correct 372 ms 956 KB Output is correct
13 Correct 267 ms 1124 KB Output is correct
14 Correct 334 ms 1544 KB Output is correct
15 Correct 361 ms 1660 KB Output is correct
16 Correct 412 ms 1984 KB Output is correct
17 Correct 543 ms 2744 KB Output is correct
18 Correct 354 ms 1716 KB Output is correct
19 Correct 377 ms 1736 KB Output is correct
20 Correct 554 ms 1980 KB Output is correct
21 Correct 433 ms 1656 KB Output is correct
22 Correct 457 ms 1768 KB Output is correct
23 Correct 521 ms 1908 KB Output is correct
24 Correct 474 ms 2108 KB Output is correct
25 Correct 455 ms 1624 KB Output is correct
26 Correct 432 ms 1676 KB Output is correct
27 Correct 474 ms 1880 KB Output is correct
28 Correct 577 ms 2504 KB Output is correct
29 Correct 461 ms 2380 KB Output is correct
30 Correct 519 ms 2636 KB Output is correct
31 Correct 584 ms 2588 KB Output is correct
32 Correct 696 ms 1272 KB Output is correct
33 Correct 521 ms 1148 KB Output is correct
34 Correct 9 ms 376 KB Output is correct
35 Correct 10 ms 504 KB Output is correct
36 Correct 9 ms 376 KB Output is correct
37 Correct 10 ms 380 KB Output is correct
38 Correct 9 ms 504 KB Output is correct
39 Correct 11 ms 504 KB Output is correct
40 Correct 15 ms 632 KB Output is correct
41 Correct 17 ms 632 KB Output is correct
42 Correct 15 ms 632 KB Output is correct
43 Correct 9 ms 376 KB Output is correct
44 Correct 17 ms 504 KB Output is correct
45 Correct 17 ms 632 KB Output is correct
46 Correct 10 ms 504 KB Output is correct
47 Correct 5 ms 376 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 5 ms 376 KB Output is correct
50 Correct 5 ms 376 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 5 ms 376 KB Output is correct
53 Correct 5 ms 376 KB Output is correct
54 Correct 5 ms 376 KB Output is correct
55 Correct 5 ms 376 KB Output is correct
56 Correct 5 ms 376 KB Output is correct
57 Correct 5 ms 376 KB Output is correct
58 Correct 5 ms 376 KB Output is correct
59 Correct 5 ms 376 KB Output is correct
60 Correct 5 ms 248 KB Output is correct
61 Correct 5 ms 376 KB Output is correct
62 Correct 5 ms 248 KB Output is correct
63 Correct 5 ms 376 KB Output is correct
64 Correct 5 ms 248 KB Output is correct
65 Correct 5 ms 376 KB Output is correct
66 Correct 5 ms 376 KB Output is correct
67 Correct 4 ms 248 KB Output is correct
68 Correct 5 ms 248 KB Output is correct
69 Correct 5 ms 248 KB Output is correct
70 Correct 5 ms 376 KB Output is correct
71 Correct 4 ms 248 KB Output is correct
72 Correct 5 ms 376 KB Output is correct