Submission #620769

# Submission time Handle Problem Language Result Execution time Memory
620769 2022-08-03T08:54:43 Z jamezzz Meetings (JOI19_meetings) C++17
100 / 100
1111 ms 944 KB
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

#define maxn 2005
#define all(x) x.begin(),x.end()
#define disc(x) sort(all(x));x.resize(unique(all(x))-x.begin());
mt19937 rng(218);

vector<int> sub[maxn];

void subtree(int rt,vector<int> nodes){
	//printf("subtree %d: ",rt);
	//for(int i:nodes)printf("%d ",i);
	//printf("\n");
	int n=nodes.size(),far;
	do{
		far=nodes[rng()%n];
	}while(far==rt);
	for(int i:nodes)sub[i].clear();
	vector<int> line;
	line.push_back(rt);
	line.push_back(far);
	sub[rt].push_back(rt);
	sub[far].push_back(far);
	for(int i:nodes){
		if(i==rt||i==far)continue;
		//printf("query: %d %d %d\n",rt,far,i);
		int par=Query(rt,far,i);
		line.push_back(par);
		sub[par].push_back(i);
	}
	
	disc(line);
	sort(all(line),[&](int a,int b){
		if(a==rt)return true;
		if(b==rt)return false;
		return Query(rt,a,b)==a;
	});
	for(int i=1;i<line.size();++i){
		if(line[i-1]<line[i])Bridge(line[i-1],line[i]);
		else Bridge(line[i],line[i-1]);
	}
	
	for(int i:line){
		if(sub[i].size()==1)continue;
		subtree(i,sub[i]);
	}
}

void Solve(int n){
	vector<int> v;
	for(int i=0;i<n;++i)v.push_back(i);
	subtree(rng()%n,v);
}

Compilation message

meetings.cpp: In function 'void subtree(int, std::vector<int>)':
meetings.cpp:40:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  for(int i=1;i<line.size();++i){
      |              ~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 396 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 396 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 5 ms 464 KB Output is correct
28 Correct 7 ms 456 KB Output is correct
29 Correct 5 ms 336 KB Output is correct
30 Correct 7 ms 464 KB Output is correct
31 Correct 6 ms 464 KB Output is correct
32 Correct 6 ms 428 KB Output is correct
33 Correct 11 ms 464 KB Output is correct
34 Correct 13 ms 452 KB Output is correct
35 Correct 15 ms 464 KB Output is correct
36 Correct 6 ms 464 KB Output is correct
37 Correct 19 ms 444 KB Output is correct
38 Correct 13 ms 464 KB Output is correct
39 Correct 12 ms 456 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 444 ms 756 KB Output is correct
2 Correct 489 ms 732 KB Output is correct
3 Correct 439 ms 788 KB Output is correct
4 Correct 410 ms 736 KB Output is correct
5 Correct 326 ms 740 KB Output is correct
6 Correct 313 ms 672 KB Output is correct
7 Correct 685 ms 816 KB Output is correct
8 Correct 675 ms 760 KB Output is correct
9 Correct 630 ms 880 KB Output is correct
10 Correct 685 ms 796 KB Output is correct
11 Correct 719 ms 844 KB Output is correct
12 Correct 396 ms 724 KB Output is correct
13 Correct 259 ms 776 KB Output is correct
14 Correct 474 ms 768 KB Output is correct
15 Correct 411 ms 732 KB Output is correct
16 Correct 396 ms 744 KB Output is correct
17 Correct 577 ms 740 KB Output is correct
18 Correct 334 ms 752 KB Output is correct
19 Correct 353 ms 856 KB Output is correct
20 Correct 510 ms 708 KB Output is correct
21 Correct 464 ms 884 KB Output is correct
22 Correct 511 ms 768 KB Output is correct
23 Correct 458 ms 844 KB Output is correct
24 Correct 408 ms 856 KB Output is correct
25 Correct 428 ms 712 KB Output is correct
26 Correct 402 ms 784 KB Output is correct
27 Correct 450 ms 748 KB Output is correct
28 Correct 660 ms 824 KB Output is correct
29 Correct 528 ms 756 KB Output is correct
30 Correct 524 ms 764 KB Output is correct
31 Correct 661 ms 876 KB Output is correct
32 Correct 1111 ms 848 KB Output is correct
33 Correct 465 ms 944 KB Output is correct
34 Correct 4 ms 428 KB Output is correct
35 Correct 4 ms 436 KB Output is correct
36 Correct 4 ms 336 KB Output is correct
37 Correct 6 ms 404 KB Output is correct
38 Correct 5 ms 336 KB Output is correct
39 Correct 6 ms 464 KB Output is correct
40 Correct 11 ms 472 KB Output is correct
41 Correct 12 ms 472 KB Output is correct
42 Correct 11 ms 436 KB Output is correct
43 Correct 5 ms 464 KB Output is correct
44 Correct 14 ms 460 KB Output is correct
45 Correct 10 ms 464 KB Output is correct
46 Correct 10 ms 464 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 1 ms 336 KB Output is correct
49 Correct 1 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 336 KB Output is correct
53 Correct 1 ms 336 KB Output is correct
54 Correct 1 ms 336 KB Output is correct
55 Correct 1 ms 336 KB Output is correct
56 Correct 1 ms 336 KB Output is correct
57 Correct 1 ms 336 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 1 ms 336 KB Output is correct
60 Correct 1 ms 336 KB Output is correct
61 Correct 0 ms 336 KB Output is correct
62 Correct 0 ms 336 KB Output is correct
63 Correct 0 ms 336 KB Output is correct
64 Correct 1 ms 336 KB Output is correct
65 Correct 0 ms 336 KB Output is correct
66 Correct 0 ms 336 KB Output is correct
67 Correct 1 ms 336 KB Output is correct
68 Correct 0 ms 336 KB Output is correct
69 Correct 1 ms 336 KB Output is correct
70 Correct 1 ms 336 KB Output is correct
71 Correct 1 ms 336 KB Output is correct
72 Correct 0 ms 336 KB Output is correct