Submission #375319

# Submission time Handle Problem Language Result Execution time Memory
375319 2021-03-09T07:38:56 Z casperwang Meetings (JOI19_meetings) C++14
100 / 100
1893 ms 1344 KB
#include "meetings.h"
#define All(x) x.begin(), x.end()
#define pb push_back
#include <bits/stdc++.h>
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

void solve_set(vector <int> V) {
	srand(time(NULL));
	random_shuffle(All(V));
	set <int> R;
	vector <int> V2;
	for (int i : V) R.insert(i);
	int m = Query(V[0], V[1], V[2]);
	if (V.size() == 3) {
		for (int i = 0; i < 3; i++) {
			if (m != V[i]) {
				debug(min(m, V[i]), max(m, V[i]));
				Bridge(min(m, V[i]), max(m, V[i]));
			}
		}
		return;
	}
	for (int i = 0; i < 3; i++) {
		if (m == V[i]) continue;
		vector <int> A, B;
		R.erase(V[i]);
		for (int j : V) {
			if (j == V[i] || j == m) continue;
			int d = Query(m, V[i], j);
			if (d == V[i])
				B.pb(j), R.erase(j);
			else if (d != m)
				A.pb(j), R.erase(j);
		}
		if (A.size() == 0) {
			debug(min(m, V[i]), max(m, V[i]));
			Bridge(min(m, V[i]), max(m, V[i]));
		} else if (A.size() == 1) {
			debug(min(A[0], m), max(A[0], m));
			Bridge(min(A[0], m), max(A[0], m));
			debug(min(A[0], V[i]), max(A[0], V[i]));
			Bridge(min(A[0], V[i]), max(A[0], V[i]));
		} else if (A.size() >= 2) {
			A.pb(m);
			A.pb(V[i]);
			solve_set(A);
		}
		if (B.size() == 1) {
			debug(min(B[0], V[i]), max(B[0], V[i]));
			Bridge(min(B[0], V[i]), max(B[0], V[i]));
		} else if (B.size() >= 2) {
			B.pb(V[i]);
			solve_set(B);
		}
	}
	for (int i : R) V2.pb(i);
	if (V2.size() == 2) {
		debug(min(V2[0], V2[1]), max(V2[0], V2[1]));
		Bridge(min(V2[0], V2[1]), max(V2[0], V2[1]));
	} else if (V2.size() >= 3) {
		solve_set(V2);
	}
}

void Solve(int N) {
	vector <int> arr;
	for (int i = 0; i < N; i++) arr.pb(i);
	solve_set(arr);
	return;
}
# 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 1 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 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 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 1 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 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 508 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 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 1 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 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 2 ms 364 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 2 ms 364 KB Output is correct
20 Correct 2 ms 364 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 364 KB Output is correct
23 Correct 2 ms 364 KB Output is correct
24 Correct 2 ms 508 KB Output is correct
25 Correct 2 ms 364 KB Output is correct
26 Correct 2 ms 364 KB Output is correct
27 Correct 24 ms 492 KB Output is correct
28 Correct 22 ms 492 KB Output is correct
29 Correct 23 ms 488 KB Output is correct
30 Correct 21 ms 492 KB Output is correct
31 Correct 26 ms 492 KB Output is correct
32 Correct 21 ms 512 KB Output is correct
33 Correct 25 ms 492 KB Output is correct
34 Correct 30 ms 620 KB Output is correct
35 Correct 26 ms 492 KB Output is correct
36 Correct 23 ms 512 KB Output is correct
37 Correct 19 ms 492 KB Output is correct
38 Correct 18 ms 492 KB Output is correct
39 Correct 18 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1390 ms 760 KB Output is correct
2 Correct 1653 ms 1060 KB Output is correct
3 Correct 1674 ms 876 KB Output is correct
4 Correct 1356 ms 876 KB Output is correct
5 Correct 1737 ms 876 KB Output is correct
6 Correct 1253 ms 1004 KB Output is correct
7 Correct 1355 ms 1052 KB Output is correct
8 Correct 1531 ms 1344 KB Output is correct
9 Correct 1306 ms 876 KB Output is correct
10 Correct 1208 ms 876 KB Output is correct
11 Correct 1418 ms 1336 KB Output is correct
12 Correct 1450 ms 1180 KB Output is correct
13 Correct 1544 ms 1244 KB Output is correct
14 Correct 1783 ms 1088 KB Output is correct
15 Correct 1532 ms 1260 KB Output is correct
16 Correct 1667 ms 1152 KB Output is correct
17 Correct 1161 ms 1260 KB Output is correct
18 Correct 1483 ms 1260 KB Output is correct
19 Correct 1497 ms 1004 KB Output is correct
20 Correct 1710 ms 1132 KB Output is correct
21 Correct 1721 ms 1020 KB Output is correct
22 Correct 1893 ms 1260 KB Output is correct
23 Correct 1736 ms 1292 KB Output is correct
24 Correct 1750 ms 796 KB Output is correct
25 Correct 1560 ms 1052 KB Output is correct
26 Correct 1545 ms 1004 KB Output is correct
27 Correct 1788 ms 876 KB Output is correct
28 Correct 1541 ms 1268 KB Output is correct
29 Correct 1200 ms 1004 KB Output is correct
30 Correct 1226 ms 1004 KB Output is correct
31 Correct 1275 ms 1004 KB Output is correct
32 Correct 1020 ms 1004 KB Output is correct
33 Correct 799 ms 1004 KB Output is correct
34 Correct 20 ms 492 KB Output is correct
35 Correct 22 ms 492 KB Output is correct
36 Correct 28 ms 492 KB Output is correct
37 Correct 20 ms 492 KB Output is correct
38 Correct 26 ms 492 KB Output is correct
39 Correct 20 ms 492 KB Output is correct
40 Correct 26 ms 492 KB Output is correct
41 Correct 31 ms 492 KB Output is correct
42 Correct 26 ms 492 KB Output is correct
43 Correct 29 ms 492 KB Output is correct
44 Correct 18 ms 492 KB Output is correct
45 Correct 16 ms 492 KB Output is correct
46 Correct 18 ms 492 KB Output is correct
47 Correct 2 ms 364 KB Output is correct
48 Correct 2 ms 364 KB Output is correct
49 Correct 2 ms 364 KB Output is correct
50 Correct 2 ms 364 KB Output is correct
51 Correct 2 ms 364 KB Output is correct
52 Correct 2 ms 364 KB Output is correct
53 Correct 2 ms 364 KB Output is correct
54 Correct 2 ms 364 KB Output is correct
55 Correct 2 ms 364 KB Output is correct
56 Correct 2 ms 364 KB Output is correct
57 Correct 2 ms 364 KB Output is correct
58 Correct 2 ms 364 KB Output is correct
59 Correct 2 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 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 1 ms 364 KB Output is correct