oj.uz

Submission #242644

# Submission time Handle Problem Language Result Execution time Memory
242644 2020-06-28T13:17:23 Z ZwariowanyMarcin Meetings (JOI19_meetings) C++14
100 / 100
 1020 ms 1052 KB 
#include "meetings.h"
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ss(x) (int) x.size()
#define fi first
#define se second
#define cat(x) cerr << #x << " = " << x << endl
#define rep(i, j, n) for (int i = j; i <= n; ++i)
#define per(i, j, n) for (int i = n; j <= i; --i)
#define all(x) x.begin(), x.end()
 
using namespace std;

const int N = 2100;
/*
int Query(int x, int y, int z) {
	printf ("ask %d %d %d\n", x, y, z);
	int d;
	cin >> d;
	return d;
}

void Bridge(int x, int y) {
	printf ("tree %d %d\n", x, y);
}*/

void bridge(int x, int y) {
	if (x > y) swap(x, y);
	Bridge(x, y);
}

vector <int> g[N];

void rek(vector <int> x, int root) {
	if (ss(x) == 1) return;
	int y = x[rand() % ss(x)];
	while (y == root)
		y = x[rand() % ss(x)];
	for (auto it : x)
		g[it].clear();
	vector <int> path;
	for (auto it : x) {
		if (it == y || it == root) continue;
		int z = Query(root, y, it);
		if (it == z) path.pb(it);
		g[z].pb(it);
	}
	g[root].pb(root);
	g[y].pb(y);
	sort(all(path), [&](int a, int b) {
		int c = Query(root, a, b);
		if (c == a) return 1;
		else return 0;
	});
	// 1. 
	int First = (path.empty() ? y : path[0]);
	bridge(First, root);
	rep(i, 0, ss(path) - 1) 
		bridge(path[i], (i + 1 < ss(path) ? path[i + 1] : y));
	for (auto it : x)
		if (!g[it].empty())
			rek(g[it], it);
}
	

void Solve(int n) {
	srand(2137);
	vector <int> v(n);
	iota(all(v), 0);
	int root = rand() % n;
	rek(v, root);
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 438 ms 784 KB Output is correct
2 Correct 486 ms 864 KB Output is correct
3 Correct 518 ms 760 KB Output is correct
4 Correct 487 ms 888 KB Output is correct
5 Correct 362 ms 816 KB Output is correct
6 Correct 466 ms 888 KB Output is correct
7 Correct 662 ms 888 KB Output is correct
8 Correct 801 ms 1016 KB Output is correct
9 Correct 758 ms 996 KB Output is correct
10 Correct 790 ms 888 KB Output is correct
11 Correct 796 ms 1052 KB Output is correct
12 Correct 568 ms 864 KB Output is correct
13 Correct 433 ms 1016 KB Output is correct
14 Correct 448 ms 760 KB Output is correct
15 Correct 498 ms 888 KB Output is correct
16 Correct 499 ms 760 KB Output is correct
17 Correct 682 ms 888 KB Output is correct
18 Correct 416 ms 760 KB Output is correct
19 Correct 440 ms 888 KB Output is correct
20 Correct 635 ms 760 KB Output is correct
21 Correct 663 ms 888 KB Output is correct
22 Correct 522 ms 864 KB Output is correct
23 Correct 521 ms 1016 KB Output is correct
24 Correct 567 ms 952 KB Output is correct
25 Correct 549 ms 888 KB Output is correct
26 Correct 568 ms 888 KB Output is correct
27 Correct 557 ms 760 KB Output is correct
28 Correct 784 ms 760 KB Output is correct
29 Correct 639 ms 1016 KB Output is correct
30 Correct 687 ms 888 KB Output is correct
31 Correct 750 ms 1016 KB Output is correct
32 Correct 1020 ms 1016 KB Output is correct
33 Correct 874 ms 1016 KB Output is correct
34 Correct 9 ms 512 KB Output is correct
35 Correct 10 ms 512 KB Output is correct
36 Correct 10 ms 512 KB Output is correct
37 Correct 9 ms 512 KB Output is correct
38 Correct 9 ms 512 KB Output is correct
39 Correct 12 ms 512 KB Output is correct
40 Correct 17 ms 512 KB Output is correct
41 Correct 19 ms 512 KB Output is correct
42 Correct 19 ms 512 KB Output is correct
43 Correct 9 ms 512 KB Output is correct
44 Correct 14 ms 512 KB Output is correct
45 Correct 18 ms 416 KB Output is correct
46 Correct 13 ms 512 KB Output is correct
47 Correct 5 ms 512 KB Output is correct
48 Correct 5 ms 384 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 4 ms 384 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 5 ms 384 KB Output is correct
54 Correct 5 ms 384 KB Output is correct
55 Correct 5 ms 384 KB Output is correct
56 Correct 5 ms 384 KB Output is correct
57 Correct 5 ms 384 KB Output is correct
58 Correct 5 ms 384 KB Output is correct
59 Correct 5 ms 384 KB Output is correct
60 Correct 5 ms 384 KB Output is correct
61 Correct 5 ms 384 KB Output is correct
62 Correct 5 ms 384 KB Output is correct
63 Correct 5 ms 384 KB Output is correct
64 Correct 5 ms 384 KB Output is correct
65 Correct 4 ms 384 KB Output is correct
66 Correct 5 ms 384 KB Output is correct
67 Correct 4 ms 384 KB Output is correct
68 Correct 5 ms 384 KB Output is correct
69 Correct 5 ms 384 KB Output is correct
70 Correct 4 ms 384 KB Output is correct
71 Correct 4 ms 384 KB Output is correct
72 Correct 4 ms 384 KB Output is correct