#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
set<int> adjl[2005];
int sz[2005];
bool block[2005];
bool done[2005];
int n;
void dfs(int node, int p){
sz[node] = 1;
for (int x : adjl[node]){
if (x==p) continue;
if (block[x]) continue;
dfs(x,node);
sz[node] += sz[x];
}
}
int findCentroid(int node, int p, int total){
for (int x : adjl[node]){
if (x==p) continue;
if (block[x]) continue;
if (sz[x]>total/2){
return findCentroid(x,node,total);
}
}
return node;
}
void addNode(int node, int root){
dfs(root,-1);
if (sz[root]==1){
adjl[root].insert(node);
adjl[node].insert(root);
return;
}
if (sz[root]==2){
int ch = -1;
for (int x : adjl[root]){
if (block[x]) continue;
ch = x;
}
int res = Query(root,ch,node);
if (res==root){
adjl[root].insert(node);
adjl[node].insert(root);
}
else if (res==ch){
adjl[ch].insert(node);
adjl[node].insert(ch);
}
else if (res==node){
adjl[root].erase(ch);
adjl[ch].erase(root);
adjl[root].insert(node);
adjl[node].insert(root);
adjl[ch].insert(node);
adjl[node].insert(ch);
}
else{
adjl[root].erase(ch);
adjl[ch].erase(root);
adjl[root].insert(res);
adjl[res].insert(root);
adjl[ch].insert(res);
adjl[res].insert(ch);
adjl[res].insert(node);
adjl[node].insert(res);
done[res] = true;
}
return;
}
root = findCentroid(root,-1,sz[root]);
dfs(root,-1); ///re-root at centroid
//printf("centroid %d\n",root);
vector<pair<int,int> > children;
for (int child : adjl[root]){
if (block[child]) continue;
children.push_back({sz[child],child});
//printf("added %d %d\n",sz[child],child);
}
sort(children.begin(),children.end(),greater<pair<int,int> >());
//assert(children.size()!=1);
if (children.size()&1){
children.push_back(children[0]);
}
for (int x = 0; x<children.size(); x+=2){
int n1 = children[x].second;
int n2 = children[x+1].second;
int res = Query(node,n1,n2);
if (res==n1){
block[root] = true;
addNode(node,n1);
block[root] = false;
return;
}
if (res==n2){
block[root] = true;
addNode(node,n2);
block[root] = false;
return;
}
if (res!=root){
///res is either on edge root-n1 or root-n2
int res2 = Query(root,n1,res);
if (res2==res){
adjl[root].erase(n1);
adjl[n1].erase(root);
adjl[root].insert(res);
adjl[n1].insert(res);
adjl[res].insert(root);
adjl[res].insert(n1);
if (res!=node){
adjl[res].insert(node);
adjl[node].insert(res);
}
}
else if (res2==root){
adjl[root].erase(n2);
adjl[n2].erase(root);
adjl[root].insert(res);
adjl[n2].insert(res);
adjl[res].insert(root);
adjl[res].insert(n2);
if (res!=node){
adjl[node].insert(res);
adjl[res].insert(node);
}
}
else{
//assert(false);
}
done[res] = true;
return;
}
}
///directly connected to root
adjl[root].insert(node);
adjl[node].insert(root);
}
void Solve(int N) {
n = N;
for (int nw = 1; nw<N; nw++){
if (done[nw]) continue;
addNode(nw,0);
/*for (int x = 0; x<N; x++){
for (int node : adjl[x]){
if (node<=x){
//printf("now %d, %d--%d\n",nw,node,x);
}
}
}*/
}
for (int x = 0; x<N; x++){
for (int node : adjl[x]){
if (node<x){
Bridge(node,x);
}
}
}
}
Compilation message
meetings.cpp: In function 'void addNode(int, int)':
meetings.cpp:89:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int x = 0; x<children.size(); x+=2){
~^~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
512 KB |
Output is correct |
2 |
Correct |
0 ms |
512 KB |
Output is correct |
3 |
Correct |
0 ms |
512 KB |
Output is correct |
4 |
Correct |
1 ms |
512 KB |
Output is correct |
5 |
Correct |
1 ms |
512 KB |
Output is correct |
6 |
Correct |
0 ms |
512 KB |
Output is correct |
7 |
Correct |
0 ms |
512 KB |
Output is correct |
8 |
Correct |
0 ms |
512 KB |
Output is correct |
9 |
Correct |
1 ms |
512 KB |
Output is correct |
10 |
Correct |
0 ms |
512 KB |
Output is correct |
11 |
Correct |
1 ms |
512 KB |
Output is correct |
12 |
Correct |
0 ms |
512 KB |
Output is correct |
13 |
Correct |
0 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
512 KB |
Output is correct |
2 |
Correct |
0 ms |
512 KB |
Output is correct |
3 |
Correct |
0 ms |
512 KB |
Output is correct |
4 |
Correct |
1 ms |
512 KB |
Output is correct |
5 |
Correct |
1 ms |
512 KB |
Output is correct |
6 |
Correct |
0 ms |
512 KB |
Output is correct |
7 |
Correct |
0 ms |
512 KB |
Output is correct |
8 |
Correct |
0 ms |
512 KB |
Output is correct |
9 |
Correct |
1 ms |
512 KB |
Output is correct |
10 |
Correct |
0 ms |
512 KB |
Output is correct |
11 |
Correct |
1 ms |
512 KB |
Output is correct |
12 |
Correct |
0 ms |
512 KB |
Output is correct |
13 |
Correct |
0 ms |
512 KB |
Output is correct |
14 |
Correct |
1 ms |
512 KB |
Output is correct |
15 |
Correct |
1 ms |
512 KB |
Output is correct |
16 |
Correct |
1 ms |
512 KB |
Output is correct |
17 |
Correct |
1 ms |
512 KB |
Output is correct |
18 |
Correct |
1 ms |
512 KB |
Output is correct |
19 |
Correct |
1 ms |
512 KB |
Output is correct |
20 |
Correct |
1 ms |
512 KB |
Output is correct |
21 |
Correct |
1 ms |
512 KB |
Output is correct |
22 |
Correct |
1 ms |
512 KB |
Output is correct |
23 |
Correct |
1 ms |
512 KB |
Output is correct |
24 |
Correct |
1 ms |
512 KB |
Output is correct |
25 |
Correct |
1 ms |
512 KB |
Output is correct |
26 |
Correct |
1 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
512 KB |
Output is correct |
2 |
Correct |
0 ms |
512 KB |
Output is correct |
3 |
Correct |
0 ms |
512 KB |
Output is correct |
4 |
Correct |
1 ms |
512 KB |
Output is correct |
5 |
Correct |
1 ms |
512 KB |
Output is correct |
6 |
Correct |
0 ms |
512 KB |
Output is correct |
7 |
Correct |
0 ms |
512 KB |
Output is correct |
8 |
Correct |
0 ms |
512 KB |
Output is correct |
9 |
Correct |
1 ms |
512 KB |
Output is correct |
10 |
Correct |
0 ms |
512 KB |
Output is correct |
11 |
Correct |
1 ms |
512 KB |
Output is correct |
12 |
Correct |
0 ms |
512 KB |
Output is correct |
13 |
Correct |
0 ms |
512 KB |
Output is correct |
14 |
Correct |
1 ms |
512 KB |
Output is correct |
15 |
Correct |
1 ms |
512 KB |
Output is correct |
16 |
Correct |
1 ms |
512 KB |
Output is correct |
17 |
Correct |
1 ms |
512 KB |
Output is correct |
18 |
Correct |
1 ms |
512 KB |
Output is correct |
19 |
Correct |
1 ms |
512 KB |
Output is correct |
20 |
Correct |
1 ms |
512 KB |
Output is correct |
21 |
Correct |
1 ms |
512 KB |
Output is correct |
22 |
Correct |
1 ms |
512 KB |
Output is correct |
23 |
Correct |
1 ms |
512 KB |
Output is correct |
24 |
Correct |
1 ms |
512 KB |
Output is correct |
25 |
Correct |
1 ms |
512 KB |
Output is correct |
26 |
Correct |
1 ms |
512 KB |
Output is correct |
27 |
Correct |
7 ms |
512 KB |
Output is correct |
28 |
Correct |
11 ms |
512 KB |
Output is correct |
29 |
Correct |
7 ms |
512 KB |
Output is correct |
30 |
Correct |
7 ms |
512 KB |
Output is correct |
31 |
Correct |
6 ms |
512 KB |
Output is correct |
32 |
Correct |
12 ms |
512 KB |
Output is correct |
33 |
Correct |
17 ms |
512 KB |
Output is correct |
34 |
Correct |
15 ms |
512 KB |
Output is correct |
35 |
Correct |
13 ms |
512 KB |
Output is correct |
36 |
Correct |
11 ms |
512 KB |
Output is correct |
37 |
Correct |
13 ms |
568 KB |
Output is correct |
38 |
Correct |
12 ms |
512 KB |
Output is correct |
39 |
Correct |
10 ms |
560 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
504 ms |
936 KB |
Output is correct |
2 |
Correct |
501 ms |
960 KB |
Output is correct |
3 |
Correct |
496 ms |
936 KB |
Output is correct |
4 |
Correct |
503 ms |
888 KB |
Output is correct |
5 |
Correct |
428 ms |
888 KB |
Output is correct |
6 |
Correct |
414 ms |
888 KB |
Output is correct |
7 |
Correct |
490 ms |
1188 KB |
Output is correct |
8 |
Correct |
545 ms |
936 KB |
Output is correct |
9 |
Correct |
518 ms |
1000 KB |
Output is correct |
10 |
Correct |
495 ms |
1228 KB |
Output is correct |
11 |
Correct |
555 ms |
1016 KB |
Output is correct |
12 |
Correct |
522 ms |
1020 KB |
Output is correct |
13 |
Correct |
513 ms |
888 KB |
Output is correct |
14 |
Correct |
549 ms |
1084 KB |
Output is correct |
15 |
Correct |
498 ms |
1016 KB |
Output is correct |
16 |
Correct |
505 ms |
888 KB |
Output is correct |
17 |
Correct |
464 ms |
1272 KB |
Output is correct |
18 |
Correct |
485 ms |
996 KB |
Output is correct |
19 |
Correct |
517 ms |
1016 KB |
Output is correct |
20 |
Correct |
591 ms |
1144 KB |
Output is correct |
21 |
Correct |
599 ms |
1144 KB |
Output is correct |
22 |
Correct |
599 ms |
1016 KB |
Output is correct |
23 |
Correct |
594 ms |
960 KB |
Output is correct |
24 |
Correct |
615 ms |
1016 KB |
Output is correct |
25 |
Correct |
623 ms |
1016 KB |
Output is correct |
26 |
Correct |
579 ms |
1144 KB |
Output is correct |
27 |
Correct |
583 ms |
1012 KB |
Output is correct |
28 |
Correct |
607 ms |
888 KB |
Output is correct |
29 |
Correct |
491 ms |
892 KB |
Output is correct |
30 |
Correct |
515 ms |
1016 KB |
Output is correct |
31 |
Correct |
541 ms |
948 KB |
Output is correct |
32 |
Correct |
897 ms |
1228 KB |
Output is correct |
33 |
Correct |
605 ms |
1156 KB |
Output is correct |
34 |
Correct |
8 ms |
512 KB |
Output is correct |
35 |
Correct |
7 ms |
512 KB |
Output is correct |
36 |
Correct |
8 ms |
512 KB |
Output is correct |
37 |
Correct |
7 ms |
512 KB |
Output is correct |
38 |
Correct |
6 ms |
512 KB |
Output is correct |
39 |
Correct |
8 ms |
512 KB |
Output is correct |
40 |
Correct |
10 ms |
640 KB |
Output is correct |
41 |
Correct |
12 ms |
512 KB |
Output is correct |
42 |
Correct |
11 ms |
512 KB |
Output is correct |
43 |
Correct |
7 ms |
512 KB |
Output is correct |
44 |
Correct |
11 ms |
512 KB |
Output is correct |
45 |
Correct |
12 ms |
512 KB |
Output is correct |
46 |
Correct |
9 ms |
512 KB |
Output is correct |
47 |
Correct |
1 ms |
512 KB |
Output is correct |
48 |
Correct |
1 ms |
512 KB |
Output is correct |
49 |
Correct |
1 ms |
512 KB |
Output is correct |
50 |
Correct |
1 ms |
512 KB |
Output is correct |
51 |
Correct |
1 ms |
512 KB |
Output is correct |
52 |
Correct |
0 ms |
512 KB |
Output is correct |
53 |
Correct |
1 ms |
512 KB |
Output is correct |
54 |
Correct |
1 ms |
512 KB |
Output is correct |
55 |
Correct |
1 ms |
512 KB |
Output is correct |
56 |
Correct |
1 ms |
512 KB |
Output is correct |
57 |
Correct |
1 ms |
512 KB |
Output is correct |
58 |
Correct |
1 ms |
512 KB |
Output is correct |
59 |
Correct |
1 ms |
512 KB |
Output is correct |
60 |
Correct |
0 ms |
512 KB |
Output is correct |
61 |
Correct |
0 ms |
512 KB |
Output is correct |
62 |
Correct |
0 ms |
512 KB |
Output is correct |
63 |
Correct |
0 ms |
512 KB |
Output is correct |
64 |
Correct |
0 ms |
512 KB |
Output is correct |
65 |
Correct |
0 ms |
512 KB |
Output is correct |
66 |
Correct |
0 ms |
512 KB |
Output is correct |
67 |
Correct |
0 ms |
512 KB |
Output is correct |
68 |
Correct |
0 ms |
512 KB |
Output is correct |
69 |
Correct |
0 ms |
512 KB |
Output is correct |
70 |
Correct |
0 ms |
512 KB |
Output is correct |
71 |
Correct |
0 ms |
512 KB |
Output is correct |
72 |
Correct |
0 ms |
512 KB |
Output is correct |