Submission #344241

# Submission time Handle Problem Language Result Execution time Memory
344241 2021-01-05T10:11:30 Z Kerim Meetings (JOI19_meetings) C++17
100 / 100
658 ms 1092 KB
#include "meetings.h"
#include "bits/stdc++.h"
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)

using namespace std;
int root;
bool cmp(int x,int y){
	return (Query(root,x,y)==x);
}
void print(int x,int y){
	if(x>y)swap(x,y);
	//printf("%d %d\n",x,y);
	Bridge(x,y);	
}
void f(vector<int>v){
	int sz=int(v.size());
	if(sz<2)
		return;
	/*printf("v= ");
	tr(it,v)
		printf("%d ",*it);
	puts("");*/
	if(sz==2){
		print(v[0],v[1]);
		return;	
	}
	int a=rand()%sz,b=rand()%sz;while(a==b)b=rand()%sz;
	//int a=0,b=1;
	a=v[a];b=v[b];root=a;
	//printf("a=%d\n",a);
	//printf("b=%d\n",b);
	map<int,vector<int> >pm;
	vector<int>tmp;
	tr(it,v)
		if(*it!=a && *it!=b){
			int c=Query(a,b,*it);
			//printf("c = %d %d,%d,%d\n",c,a,b,*it);
			if(!pm.count(c) && c!=a && c!=b)
				tmp.push_back(c);
			pm[c].push_back(*it);	
		}
	pm[a].push_back(a);pm[b].push_back(b);
	if(tmp.empty())
		print(a,b);
	else{
		sort(tmp.begin(),tmp.end(),cmp);
		/*printf("tmp=");
		tr(it,tmp)
			printf("%d ",*it);
		puts("");
		printf("So?");*/
		print(a,tmp[0]);
		for(int i=0;i<int(tmp.size())-1;i++)
			print(tmp[i],tmp[i+1]);
		print(tmp.back(),b);
	}
	tr(it,pm){
		//printf("GO %d\n",it->first);
		f(it->second);
	}
}
void Solve(int N){
	srand((unsigned)time(NULL));
	vector<int>v;
	for(int i=0;i<N;i++)v.push_back(i);
	f(v);
}
# 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 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 364 KB Output is correct
13 Correct 0 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 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 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 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 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 0 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 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 1 ms 364 KB Output is correct
27 Correct 7 ms 384 KB Output is correct
28 Correct 5 ms 364 KB Output is correct
29 Correct 6 ms 364 KB Output is correct
30 Correct 5 ms 364 KB Output is correct
31 Correct 5 ms 364 KB Output is correct
32 Correct 6 ms 364 KB Output is correct
33 Correct 11 ms 364 KB Output is correct
34 Correct 13 ms 364 KB Output is correct
35 Correct 12 ms 364 KB Output is correct
36 Correct 7 ms 364 KB Output is correct
37 Correct 15 ms 492 KB Output is correct
38 Correct 11 ms 492 KB Output is correct
39 Correct 10 ms 492 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 498 ms 876 KB Output is correct
2 Correct 489 ms 748 KB Output is correct
3 Correct 503 ms 620 KB Output is correct
4 Correct 407 ms 748 KB Output is correct
5 Correct 404 ms 740 KB Output is correct
6 Correct 406 ms 760 KB Output is correct
7 Correct 464 ms 748 KB Output is correct
8 Correct 578 ms 748 KB Output is correct
9 Correct 636 ms 876 KB Output is correct
10 Correct 620 ms 748 KB Output is correct
11 Correct 582 ms 880 KB Output is correct
12 Correct 326 ms 748 KB Output is correct
13 Correct 322 ms 748 KB Output is correct
14 Correct 419 ms 748 KB Output is correct
15 Correct 328 ms 748 KB Output is correct
16 Correct 375 ms 764 KB Output is correct
17 Correct 482 ms 876 KB Output is correct
18 Correct 303 ms 748 KB Output is correct
19 Correct 314 ms 748 KB Output is correct
20 Correct 452 ms 876 KB Output is correct
21 Correct 373 ms 620 KB Output is correct
22 Correct 561 ms 1008 KB Output is correct
23 Correct 376 ms 1004 KB Output is correct
24 Correct 423 ms 748 KB Output is correct
25 Correct 432 ms 748 KB Output is correct
26 Correct 502 ms 876 KB Output is correct
27 Correct 427 ms 748 KB Output is correct
28 Correct 586 ms 748 KB Output is correct
29 Correct 462 ms 748 KB Output is correct
30 Correct 492 ms 748 KB Output is correct
31 Correct 515 ms 748 KB Output is correct
32 Correct 647 ms 1092 KB Output is correct
33 Correct 658 ms 1004 KB Output is correct
34 Correct 6 ms 364 KB Output is correct
35 Correct 6 ms 364 KB Output is correct
36 Correct 6 ms 364 KB Output is correct
37 Correct 5 ms 364 KB Output is correct
38 Correct 5 ms 364 KB Output is correct
39 Correct 7 ms 364 KB Output is correct
40 Correct 9 ms 364 KB Output is correct
41 Correct 12 ms 364 KB Output is correct
42 Correct 10 ms 364 KB Output is correct
43 Correct 5 ms 364 KB Output is correct
44 Correct 18 ms 492 KB Output is correct
45 Correct 11 ms 492 KB Output is correct
46 Correct 10 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 364 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 0 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 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 492 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