Submission #411463

# Submission time Handle Problem Language Result Execution time Memory
411463 2021-05-25T11:21:13 Z Blagojce Meetings (JOI19_meetings) C++17
100 / 100
765 ms 1360 KB
#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)


using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int i_inf = 1e9;
const ll inf = 1e18;
const ll mod = 1e9+7;
const ld eps = 1e-13;
const ld pi  = 3.14159265359;

mt19937 _rand(time(NULL));
clock_t z;

const int mxn = 2e5+5;

#include "meetings.h"
/*
void bridge(int a, int b){
	cout<<"bridge : "<<a<<"-"<<b<<endl;
}
int Query(int a, int b, int c){
	cout<<a<<' '<<b<<' '<<c<<endl;
	int d;
	cin >> d;
	return d;
}*/

int cpr[mxn];

vector<int> Sort(vector<int> v, int l, int r){
	if((int)v.size() <= 1) return v;
	
	int pivot = v[_rand()%(int)v.size()];
	
	vector<int> L;
	vector<int> R;
	for(auto u : v){
		if(u == pivot) continue;
		int q = Query(l, u, pivot);
		if(q == u){
			L.pb(u);
		}
		else{
			R.pb(u);
		}
	}
	L = Sort(L, l, pivot);
	R = Sort(R, pivot, r); 
	v.clear();
	for(auto u : L) v.pb(u);
	v.pb(pivot);
	for(auto u : R) v.pb(u);
	return v;
}
void bridge(int a, int b){
	Bridge(min(a,b), max(a,b));
}


void solve(vector<int> v){
	sort(all(v));
	v.erase(unique(all(v)), v.end());
	
	
	
	int m = (int)v.size();
	
	if(m <= 1) return;
	if(m == 2){
		bridge(v[0], v[1]);
		return;
	}
	int a = _rand()%m;
	int b = _rand()%(m-1);
	if(b >= a) ++b;
	
	
	
	a = v[a];
	b = v[b];
	
	
	vector<int> g[m];
	fr(i, 0, m){
		cpr[v[i]] = i;
		g[i].pb(v[i]);
	}
	
	vector<int> diam;
	fr(i, 0, m){
		if(v[i] == a || v[i] == b) continue;
		int q = Query(a, b, v[i]);
		g[cpr[q]].pb(v[i]);
		if(q != a && q != b) diam.pb(q);
	}
	sort(all(diam));
	diam.erase(unique(all(diam)), diam.end());
	diam = Sort(diam, a, b);
	diam.insert(diam.begin(), a);
	diam.pb(b);
	fr(i, 0, (int)diam.size()-1){
		bridge(diam[i], diam[i+1]);
	}
	fr(i, 0, m){
		solve(g[i]);	
	}
}

void Solve(int N){
	vector<int> v;
	fr(i, 0, N) v.pb(i);
	solve(v);
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 444 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 328 KB Output is correct
16 Correct 1 ms 328 KB Output is correct
17 Correct 1 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 444 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 7 ms 328 KB Output is correct
28 Correct 6 ms 328 KB Output is correct
29 Correct 6 ms 456 KB Output is correct
30 Correct 6 ms 328 KB Output is correct
31 Correct 6 ms 328 KB Output is correct
32 Correct 7 ms 428 KB Output is correct
33 Correct 10 ms 472 KB Output is correct
34 Correct 11 ms 456 KB Output is correct
35 Correct 10 ms 468 KB Output is correct
36 Correct 8 ms 328 KB Output is correct
37 Correct 13 ms 456 KB Output is correct
38 Correct 8 ms 328 KB Output is correct
39 Correct 9 ms 328 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 423 ms 896 KB Output is correct
2 Correct 438 ms 836 KB Output is correct
3 Correct 449 ms 848 KB Output is correct
4 Correct 421 ms 900 KB Output is correct
5 Correct 390 ms 760 KB Output is correct
6 Correct 330 ms 772 KB Output is correct
7 Correct 537 ms 1028 KB Output is correct
8 Correct 512 ms 1084 KB Output is correct
9 Correct 578 ms 1356 KB Output is correct
10 Correct 565 ms 1360 KB Output is correct
11 Correct 544 ms 988 KB Output is correct
12 Correct 336 ms 796 KB Output is correct
13 Correct 252 ms 708 KB Output is correct
14 Correct 335 ms 1096 KB Output is correct
15 Correct 424 ms 788 KB Output is correct
16 Correct 482 ms 912 KB Output is correct
17 Correct 448 ms 920 KB Output is correct
18 Correct 337 ms 928 KB Output is correct
19 Correct 352 ms 828 KB Output is correct
20 Correct 432 ms 880 KB Output is correct
21 Correct 438 ms 1036 KB Output is correct
22 Correct 434 ms 864 KB Output is correct
23 Correct 360 ms 848 KB Output is correct
24 Correct 403 ms 788 KB Output is correct
25 Correct 341 ms 828 KB Output is correct
26 Correct 311 ms 844 KB Output is correct
27 Correct 439 ms 980 KB Output is correct
28 Correct 637 ms 1044 KB Output is correct
29 Correct 568 ms 1332 KB Output is correct
30 Correct 558 ms 996 KB Output is correct
31 Correct 544 ms 1088 KB Output is correct
32 Correct 604 ms 992 KB Output is correct
33 Correct 765 ms 960 KB Output is correct
34 Correct 6 ms 400 KB Output is correct
35 Correct 6 ms 328 KB Output is correct
36 Correct 6 ms 328 KB Output is correct
37 Correct 5 ms 328 KB Output is correct
38 Correct 5 ms 328 KB Output is correct
39 Correct 6 ms 412 KB Output is correct
40 Correct 11 ms 456 KB Output is correct
41 Correct 11 ms 436 KB Output is correct
42 Correct 9 ms 456 KB Output is correct
43 Correct 5 ms 328 KB Output is correct
44 Correct 9 ms 328 KB Output is correct
45 Correct 12 ms 416 KB Output is correct
46 Correct 13 ms 456 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 328 KB Output is correct
50 Correct 1 ms 328 KB Output is correct
51 Correct 1 ms 328 KB Output is correct
52 Correct 1 ms 328 KB Output is correct
53 Correct 1 ms 328 KB Output is correct
54 Correct 1 ms 328 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 1 ms 328 KB Output is correct
57 Correct 2 ms 328 KB Output is correct
58 Correct 2 ms 328 KB Output is correct
59 Correct 1 ms 328 KB Output is correct
60 Correct 1 ms 328 KB Output is correct
61 Correct 1 ms 328 KB Output is correct
62 Correct 1 ms 328 KB Output is correct
63 Correct 1 ms 328 KB Output is correct
64 Correct 1 ms 328 KB Output is correct
65 Correct 1 ms 328 KB Output is correct
66 Correct 1 ms 328 KB Output is correct
67 Correct 1 ms 328 KB Output is correct
68 Correct 1 ms 328 KB Output is correct
69 Correct 1 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 1 ms 328 KB Output is correct
72 Correct 1 ms 328 KB Output is correct