Submission #378272

# Submission time Handle Problem Language Result Execution time Memory
378272 2021-03-16T11:13:42 Z pit4h Meetings (JOI19_meetings) C++14
100 / 100
802 ms 2076 KB
#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
int n;
int RAND(int l, int r, mt19937& rng) {
	return uniform_int_distribution<int>(l, r)(rng);	
}
void solve(vector<int>& v, mt19937& rng) {
	if((int)v.size()<=1) return;
	if((int)v.size()==2) {
		//cerr<<"bridge: "<<v[0]<<' '<<v[1]<<'\n';
		Bridge(min(v[0], v[1]), max(v[0], v[1]));
		return;
	}
	int sz = v.size();
	int v1 = RAND(0, sz-1, rng), v2 = RAND(0, sz-2, rng);
	if(v2>=v1) v2++;

	//cerr<<"solve [";
	/*for(int i=0; i<sz; ++i) {
		cerr<<v[i];
		if(i<sz-1) cerr<<' ';
		else cerr<<"] ";
	}
	cerr<<v[v1]<<' '<<v[v2]<<"  "<<n<<'\n';
	*/
	vector<vector<int>> vec(n);
	vec[v[v1]].push_back(v[v1]);
	vec[v[v2]].push_back(v[v2]);
	vector<int> path = {v[v1], v[v2]};
	for(int i=0; i<sz; ++i) {
		if(i == v1 || i==v2) continue;
		int u = Query(v[v1], v[v2], v[i]);
		//cerr<<v[i]<<": "<<u<<'\n';
		if(u == v[i]) {
			path.push_back(v[i]);
		}
		vec[u].push_back(v[i]);
	}
	if((int)path.size() == 3) {
		//cerr<<"Bridge: "<<v[0]<<' '<<path[2]<<'\n';
		//cerr<<"Bridge: "<<v[1]<<' '<<path[2]<<'\n';
		Bridge(min(v[v1], path[2]), max(v[v1], path[2]));	
		Bridge(min(v[v2], path[2]), max(v[v2], path[2]));
	}
	else {
		solve(path, rng);
	}
	for(int i=0; i<n; ++i) {
		//cerr<<' '<<i<<" - "<<vec[i].size()<<'\n';
		solve(vec[i], rng);	
	}
}
void Solve(int N) {
	n = N;
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	vector<int> v;
	for(int i=0; i<N; ++i) {
		v.push_back(i);
	}
	solve(v, rng);
}
# 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 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 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 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 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 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 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 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 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 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 1 ms 384 KB Output is correct
27 Correct 8 ms 492 KB Output is correct
28 Correct 6 ms 492 KB Output is correct
29 Correct 8 ms 640 KB Output is correct
30 Correct 7 ms 492 KB Output is correct
31 Correct 8 ms 492 KB Output is correct
32 Correct 7 ms 492 KB Output is correct
33 Correct 10 ms 492 KB Output is correct
34 Correct 12 ms 620 KB Output is correct
35 Correct 10 ms 492 KB Output is correct
36 Correct 8 ms 492 KB Output is correct
37 Correct 11 ms 492 KB Output is correct
38 Correct 8 ms 492 KB Output is correct
39 Correct 8 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 460 ms 1424 KB Output is correct
2 Correct 802 ms 1548 KB Output is correct
3 Correct 459 ms 1312 KB Output is correct
4 Correct 456 ms 1380 KB Output is correct
5 Correct 386 ms 1252 KB Output is correct
6 Correct 394 ms 1536 KB Output is correct
7 Correct 551 ms 1816 KB Output is correct
8 Correct 577 ms 1908 KB Output is correct
9 Correct 624 ms 2076 KB Output is correct
10 Correct 515 ms 1928 KB Output is correct
11 Correct 555 ms 1796 KB Output is correct
12 Correct 292 ms 1512 KB Output is correct
13 Correct 354 ms 1404 KB Output is correct
14 Correct 377 ms 1580 KB Output is correct
15 Correct 340 ms 1420 KB Output is correct
16 Correct 410 ms 1452 KB Output is correct
17 Correct 513 ms 1996 KB Output is correct
18 Correct 405 ms 1652 KB Output is correct
19 Correct 359 ms 1516 KB Output is correct
20 Correct 430 ms 1480 KB Output is correct
21 Correct 554 ms 1552 KB Output is correct
22 Correct 424 ms 1592 KB Output is correct
23 Correct 461 ms 1644 KB Output is correct
24 Correct 529 ms 1692 KB Output is correct
25 Correct 474 ms 1672 KB Output is correct
26 Correct 399 ms 1448 KB Output is correct
27 Correct 426 ms 1604 KB Output is correct
28 Correct 632 ms 1832 KB Output is correct
29 Correct 476 ms 1692 KB Output is correct
30 Correct 505 ms 1760 KB Output is correct
31 Correct 541 ms 1800 KB Output is correct
32 Correct 614 ms 1672 KB Output is correct
33 Correct 532 ms 1620 KB Output is correct
34 Correct 7 ms 492 KB Output is correct
35 Correct 6 ms 492 KB Output is correct
36 Correct 6 ms 492 KB Output is correct
37 Correct 8 ms 492 KB Output is correct
38 Correct 10 ms 492 KB Output is correct
39 Correct 10 ms 492 KB Output is correct
40 Correct 13 ms 564 KB Output is correct
41 Correct 13 ms 492 KB Output is correct
42 Correct 14 ms 620 KB Output is correct
43 Correct 5 ms 492 KB Output is correct
44 Correct 9 ms 620 KB Output is correct
45 Correct 10 ms 492 KB Output is correct
46 Correct 9 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 492 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 1 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 1 ms 364 KB Output is correct
64 Correct 0 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