oj.uz

Submission #333728

# Submission time Handle Problem Language Result Execution time Memory
333728 2020-12-07T14:45:20 Z LucaDantas Meetings (JOI19_meetings) C++17
29 / 100
 2000 ms 1644 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) {
	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);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 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 0 ms 364 KB Output is correct
13 Correct 0 ms 364 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 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 0 ms 364 KB Output is correct
13 Correct 0 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 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 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 2 ms 364 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 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 0 ms 364 KB Output is correct
13 Correct 0 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 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 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 2 ms 364 KB Output is correct
27 Correct 9 ms 492 KB Output is correct
28 Correct 9 ms 492 KB Output is correct
29 Correct 12 ms 500 KB Output is correct
30 Correct 10 ms 492 KB Output is correct
31 Correct 13 ms 492 KB Output is correct
32 Correct 13 ms 364 KB Output is correct
33 Correct 17 ms 364 KB Output is correct
34 Correct 19 ms 364 KB Output is correct
35 Correct 17 ms 492 KB Output is correct
36 Correct 12 ms 492 KB Output is correct
37 Correct 12 ms 492 KB Output is correct
38 Correct 14 ms 620 KB Output is correct
39 Correct 206 ms 1644 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 923 ms 952 KB Output is correct
2 Correct 952 ms 1004 KB Output is correct
3 Correct 1022 ms 1156 KB Output is correct
4 Correct 902 ms 876 KB Output is correct
5 Correct 879 ms 1004 KB Output is correct
6 Correct 800 ms 1132 KB Output is correct
7 Correct 916 ms 1004 KB Output is correct
8 Correct 991 ms 1004 KB Output is correct
9 Correct 931 ms 1004 KB Output is correct
10 Correct 870 ms 1132 KB Output is correct
11 Correct 995 ms 876 KB Output is correct
12 Correct 989 ms 1132 KB Output is correct
13 Correct 1049 ms 1172 KB Output is correct
14 Correct 1037 ms 1132 KB Output is correct
15 Correct 990 ms 1004 KB Output is correct
16 Correct 1024 ms 1132 KB Output is correct
17 Correct 841 ms 876 KB Output is correct
18 Execution timed out 2618 ms 1140 KB Time limit exceeded
19 Halted 0 ms 0 KB -