Submission #333726

# Submission time Handle Problem Language Result Execution time Memory
333726 2020-12-07T14:44:16 Z LucaDantas Meetings (JOI19_meetings) C++17
100 / 100
1212 ms 1304 KB
#include<bits/stdc++.h>
using namespace std;
#include "meetings.h"

#define pb push_back
#define sz(a) (a).size()

std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count() ^ (long long) (make_unique<char>().get()));

constexpr int maxn = 2e3+10;

void solve(vector<int>& a) {
	shuffle(a.begin(), a.end(), rng);
	if(sz(a) <= 1) return;
	if(sz(a) == 2) return (void)(Bridge(min(a[0], a[1]), max(a[0], a[1])));
	int divide = Query(a[0], a[1], a[2]);
	vector<int> head, top;
	if(divide == a[0]) head.pb(a[1]);
	else head.pb(a[0]);
	vector<vector<int>> grp;
	map<int,int> id;
	id[head[0]] = 0;
	grp.pb({head[0]});
	top.pb({head[0]});
	set<int> seen;
	seen.insert(head[0]);
	for(int x : a) {
		if(x != divide) {
			bool ok = 0;
			for(int y : head) {
				if(x == top[id[y]]) {
					if(!seen.count(x)) {
						grp[id[y]].pb(x);
						seen.insert(x);
					}
					ok = 1;
					break;
				}
				if(!seen.count(x)) {
					int opa = Query(divide, x, top[id[y]]);
					if(opa == divide) continue;
					ok = 1;
					grp[id[y]].pb(x);
					top[id[y]] = opa;
					seen.insert(x);
					break;
				} else {ok = 1; break;}
			}
			if(!ok) id[x] = sz(head), head.pb(x), grp.pb({x}), top.pb({x}), seen.insert(x);
		}
	}
	for(int y : head) {
		Bridge(min(divide, top[id[y]]), max(divide, top[id[y]]));
		solve(grp[id[y]]);
	}
}

void Solve(int n) {
	vector<int> a;
	for(int i = 0; i < n; i++)
		a.pb(i);
	solve(a);
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 396 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 396 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 396 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 11 ms 364 KB Output is correct
28 Correct 9 ms 492 KB Output is correct
29 Correct 13 ms 492 KB Output is correct
30 Correct 11 ms 492 KB Output is correct
31 Correct 10 ms 492 KB Output is correct
32 Correct 11 ms 364 KB Output is correct
33 Correct 16 ms 492 KB Output is correct
34 Correct 21 ms 492 KB Output is correct
35 Correct 17 ms 492 KB Output is correct
36 Correct 14 ms 492 KB Output is correct
37 Correct 11 ms 492 KB Output is correct
38 Correct 13 ms 492 KB Output is correct
39 Correct 12 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 756 ms 876 KB Output is correct
2 Correct 972 ms 876 KB Output is correct
3 Correct 926 ms 788 KB Output is correct
4 Correct 1104 ms 1132 KB Output is correct
5 Correct 992 ms 1132 KB Output is correct
6 Correct 744 ms 1004 KB Output is correct
7 Correct 896 ms 876 KB Output is correct
8 Correct 988 ms 740 KB Output is correct
9 Correct 944 ms 976 KB Output is correct
10 Correct 909 ms 1008 KB Output is correct
11 Correct 1010 ms 876 KB Output is correct
12 Correct 1000 ms 1048 KB Output is correct
13 Correct 1140 ms 1232 KB Output is correct
14 Correct 956 ms 972 KB Output is correct
15 Correct 996 ms 1100 KB Output is correct
16 Correct 996 ms 1052 KB Output is correct
17 Correct 879 ms 748 KB Output is correct
18 Correct 1059 ms 1132 KB Output is correct
19 Correct 894 ms 1004 KB Output is correct
20 Correct 1212 ms 1260 KB Output is correct
21 Correct 1094 ms 1024 KB Output is correct
22 Correct 1138 ms 968 KB Output is correct
23 Correct 978 ms 1048 KB Output is correct
24 Correct 1036 ms 1132 KB Output is correct
25 Correct 994 ms 876 KB Output is correct
26 Correct 985 ms 1260 KB Output is correct
27 Correct 963 ms 1004 KB Output is correct
28 Correct 1159 ms 876 KB Output is correct
29 Correct 838 ms 1004 KB Output is correct
30 Correct 904 ms 1080 KB Output is correct
31 Correct 1008 ms 888 KB Output is correct
32 Correct 986 ms 1132 KB Output is correct
33 Correct 997 ms 1304 KB Output is correct
34 Correct 10 ms 492 KB Output is correct
35 Correct 10 ms 492 KB Output is correct
36 Correct 12 ms 492 KB Output is correct
37 Correct 11 ms 492 KB Output is correct
38 Correct 10 ms 492 KB Output is correct
39 Correct 11 ms 492 KB Output is correct
40 Correct 19 ms 492 KB Output is correct
41 Correct 19 ms 492 KB Output is correct
42 Correct 17 ms 492 KB Output is correct
43 Correct 13 ms 492 KB Output is correct
44 Correct 12 ms 492 KB Output is correct
45 Correct 14 ms 492 KB Output is correct
46 Correct 10 ms 492 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 364 KB Output is correct
51 Correct 1 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 1 ms 364 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 0 ms 364 KB Output is correct
61 Correct 0 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 0 ms 364 KB Output is correct
64 Correct 0 ms 364 KB Output is correct
65 Correct 0 ms 364 KB Output is correct
66 Correct 0 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 0 ms 364 KB Output is correct