#include "meetings.h"
#include <bits/stdc++.h>
#define N 2005
using namespace std;
vector<int> adj[N];
bool ban[N];
bool vis[N];
bool added[N];
int sub[N];
void Solve(int n) {
adj[0].push_back(1);
adj[1].push_back(0);
added[0] = added[1] = 1;
function<void(int,int)> add = [&](int x,int nw){
// cout << "HEY" << x << " " << nw << endl;
for(int i = 0;i<n;i++){
vis[i] = 0;
}
function<void(int)> dfs = [&](int v){
vis[v] = 1;
sub[v] = 1;
for(auto u:adj[v]){
if(vis[u] || ban[u])continue;
dfs(u);
sub[v] += sub[u];
}
// cout << v << ' ' << sub[v] << endl;
};
dfs(x);
int centroid = -1;
for(int i = 0;i<n;i++){
if(vis[i]){
bool ok = 1;
ok &= 2*(sub[x] - sub[i]) <= sub[x];
for(auto u:adj[i]){
if(vis[u] && sub[u] < sub[i])
ok &= sub[u] * 2 <= sub[x];
}
if(ok)
centroid = i;
}
}
assert(centroid != -1);
// cout << centroid << endl;
for(int i = 0;i<n;i++){
vis[i] = 0;
}
dfs(centroid);
vector<int> tmp;
for(auto u:adj[centroid]){
if(vis[u])
tmp.push_back(u);
}
sort(tmp.begin(),tmp.end(),[&](int a,int b){
return sub[a] > sub[b];
});
for(int i = 0;i < tmp.size();i+=2){
if(i + 1 != tmp.size()){
int val = Query(nw,tmp[i],tmp[i+1]);
if(val == tmp[i]){
ban[centroid] = 1;
add(tmp[i],nw);
return;
}
if(val == tmp[i+1]){
ban[centroid] = 1;
add(tmp[i+1],nw);
return;
}
int val2 = Query(nw,tmp[i],centroid);
if(nw == val2){
adj[nw].push_back(tmp[i]);
adj[nw].push_back(centroid);
adj[tmp[i]].push_back(nw);
adj[centroid].push_back(nw);
for(auto &u:adj[tmp[i]]){
if(u == centroid){
swap(u,adj[tmp[i]].back());
adj[tmp[i]].pop_back();
break;
}
}
for(auto &u:adj[centroid]){
if(u == tmp[i]){
swap(u,adj[centroid].back());
adj[centroid].pop_back();
break;
}
}
return;
}
else if(!added[val2]){
added[val2] = 1;
adj[val2].push_back(nw);
adj[nw].push_back(val2);
adj[val2].push_back(tmp[i]);
adj[val2].push_back(centroid);
adj[tmp[i]].push_back(val2);
adj[centroid].push_back(val2);
for(auto &u:adj[tmp[i]]){
if(u == centroid){
swap(u,adj[tmp[i]].back());
adj[tmp[i]].pop_back();
break;
}
}
for(auto &u:adj[centroid]){
if(u == tmp[i]){
swap(u,adj[centroid].back());
adj[centroid].pop_back();\
break;
}
}
return;
}
else{
val2 = Query(nw,tmp[i + 1],centroid);
if(nw == val2){
adj[nw].push_back(tmp[i+1]);
adj[nw].push_back(centroid);
adj[tmp[i+1]].push_back(nw);
adj[centroid].push_back(nw);
for(auto &u:adj[tmp[i+1]]){
if(u == centroid){
swap(u,adj[tmp[i+1]].back());
adj[tmp[i+1]].pop_back();
break;
}
}
for(auto &u:adj[centroid]){
if(u == tmp[i+1]){
swap(u,adj[centroid].back());
adj[centroid].pop_back();
break;
}
}
return;
}
else if(!added[val2]){
added[val2] = 1;
adj[val2].push_back(nw);
adj[nw].push_back(val2);
adj[val2].push_back(tmp[i+1]);
adj[val2].push_back(centroid);
adj[tmp[i+1]].push_back(val2);
adj[centroid].push_back(val2);
for(auto &u:adj[tmp[i+1]]){
if(u == centroid){
swap(u,adj[tmp[i+1]].back());
adj[tmp[i+1]].pop_back();
break;
}
}
for(auto &u:adj[centroid]){
if(u == tmp[i+1]){
swap(u,adj[centroid].back());
adj[centroid].pop_back();
break;
}
}
return;
}
}
}
int val = Query(nw,tmp[i],centroid);
if(val == tmp[i]){
ban[centroid] = 1;
add(tmp[i],nw);
return;
}
int val2 = val;
if(nw == val2){
adj[nw].push_back(tmp[i]);
adj[nw].push_back(centroid);
adj[tmp[i]].push_back(nw);
adj[centroid].push_back(nw);
for(auto &u:adj[tmp[i]]){
if(u == centroid){
swap(u,adj[tmp[i]].back());
adj[tmp[i]].pop_back();
break;
}
}
for(auto &u:adj[centroid]){
if(u == tmp[i]){
swap(u,adj[centroid].back());
adj[centroid].pop_back();
break;
}
}
return;
}
else if(!added[val2]){
added[val2] = 1;
adj[val2].push_back(nw);
adj[nw].push_back(val2);
adj[val2].push_back(tmp[i]);
adj[val2].push_back(centroid);
adj[tmp[i]].push_back(val2);
adj[centroid].push_back(val2);
for(auto &u:adj[tmp[i]]){
if(u == centroid){
swap(u,adj[tmp[i]].back());
adj[tmp[i]].pop_back();
break;
}
}
for(auto &u:adj[centroid]){
if(u == tmp[i]){
swap(u,adj[centroid].back());
adj[centroid].pop_back();
break;
}
}
return;
}
}
// cout << "HEYY" << endl;
// cout << nw << ' ' << centroid << endl;
adj[nw].push_back(centroid);
adj[centroid].push_back(nw);
};
for(int i = 2;i<n;i++){
if(added[i])continue;
// for(int j = 0;j<n;j++){
// for(auto u:adj[j]){
// cout << "EDGE:";
// cout << u << ' ' << j << endl;
// }
// }
// cout << i << endl;
add(0,i);
added[i] = 1;
for(int j = 0;j<n;j++){
ban[j] = 0;
}
}
for(int j = 0;j<n;j++){
for(auto u:adj[j]){
if(u < j){
// cout << "EDGE:";
// cout << u << ' ' << j << endl;
Bridge(u,j);
}
}
}
}
Compilation message
meetings.cpp: In lambda function:
meetings.cpp:57:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
57 | for(int i = 0;i < tmp.size();i+=2){
| ~~^~~~~~~~~~~~
meetings.cpp:58:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
58 | if(i + 1 != tmp.size()){
| ~~~~~~^~~~~~~~~~~~~
# |
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 |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
0 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
0 ms |
336 KB |
Output is correct |
9 |
Correct |
0 ms |
336 KB |
Output is correct |
10 |
Correct |
0 ms |
336 KB |
Output is correct |
11 |
Correct |
0 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 |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
0 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
0 ms |
336 KB |
Output is correct |
9 |
Correct |
0 ms |
336 KB |
Output is correct |
10 |
Correct |
0 ms |
336 KB |
Output is correct |
11 |
Correct |
0 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 |
384 KB |
Output is correct |
21 |
Correct |
1 ms |
336 KB |
Output is correct |
22 |
Correct |
1 ms |
336 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 |
336 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 |
1 ms |
336 KB |
Output is correct |
4 |
Correct |
1 ms |
336 KB |
Output is correct |
5 |
Correct |
1 ms |
336 KB |
Output is correct |
6 |
Correct |
0 ms |
336 KB |
Output is correct |
7 |
Correct |
1 ms |
336 KB |
Output is correct |
8 |
Correct |
0 ms |
336 KB |
Output is correct |
9 |
Correct |
0 ms |
336 KB |
Output is correct |
10 |
Correct |
0 ms |
336 KB |
Output is correct |
11 |
Correct |
0 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 |
384 KB |
Output is correct |
21 |
Correct |
1 ms |
336 KB |
Output is correct |
22 |
Correct |
1 ms |
336 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 |
336 KB |
Output is correct |
26 |
Correct |
1 ms |
336 KB |
Output is correct |
27 |
Correct |
6 ms |
336 KB |
Output is correct |
28 |
Correct |
7 ms |
336 KB |
Output is correct |
29 |
Correct |
7 ms |
464 KB |
Output is correct |
30 |
Correct |
8 ms |
336 KB |
Output is correct |
31 |
Correct |
5 ms |
336 KB |
Output is correct |
32 |
Correct |
9 ms |
428 KB |
Output is correct |
33 |
Correct |
14 ms |
336 KB |
Output is correct |
34 |
Correct |
15 ms |
440 KB |
Output is correct |
35 |
Correct |
18 ms |
436 KB |
Output is correct |
36 |
Correct |
7 ms |
336 KB |
Output is correct |
37 |
Correct |
14 ms |
448 KB |
Output is correct |
38 |
Correct |
11 ms |
464 KB |
Output is correct |
39 |
Correct |
8 ms |
392 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
485 ms |
720 KB |
Output is correct |
2 |
Correct |
522 ms |
608 KB |
Output is correct |
3 |
Correct |
507 ms |
812 KB |
Output is correct |
4 |
Correct |
500 ms |
696 KB |
Output is correct |
5 |
Correct |
421 ms |
640 KB |
Output is correct |
6 |
Correct |
380 ms |
732 KB |
Output is correct |
7 |
Correct |
636 ms |
692 KB |
Output is correct |
8 |
Correct |
770 ms |
704 KB |
Output is correct |
9 |
Correct |
684 ms |
728 KB |
Output is correct |
10 |
Correct |
721 ms |
736 KB |
Output is correct |
11 |
Correct |
768 ms |
736 KB |
Output is correct |
12 |
Correct |
452 ms |
788 KB |
Output is correct |
13 |
Correct |
446 ms |
732 KB |
Output is correct |
14 |
Correct |
585 ms |
728 KB |
Output is correct |
15 |
Correct |
530 ms |
716 KB |
Output is correct |
16 |
Correct |
550 ms |
728 KB |
Output is correct |
17 |
Correct |
646 ms |
704 KB |
Output is correct |
18 |
Correct |
532 ms |
620 KB |
Output is correct |
19 |
Correct |
556 ms |
632 KB |
Output is correct |
20 |
Correct |
642 ms |
856 KB |
Output is correct |
21 |
Correct |
670 ms |
732 KB |
Output is correct |
22 |
Correct |
638 ms |
892 KB |
Output is correct |
23 |
Correct |
636 ms |
864 KB |
Output is correct |
24 |
Correct |
676 ms |
740 KB |
Output is correct |
25 |
Correct |
671 ms |
888 KB |
Output is correct |
26 |
Correct |
641 ms |
708 KB |
Output is correct |
27 |
Correct |
686 ms |
740 KB |
Output is correct |
28 |
Correct |
788 ms |
692 KB |
Output is correct |
29 |
Correct |
640 ms |
760 KB |
Output is correct |
30 |
Correct |
677 ms |
964 KB |
Output is correct |
31 |
Correct |
731 ms |
632 KB |
Output is correct |
32 |
Correct |
747 ms |
716 KB |
Output is correct |
33 |
Correct |
532 ms |
1096 KB |
Output is correct |
34 |
Correct |
7 ms |
336 KB |
Output is correct |
35 |
Correct |
7 ms |
336 KB |
Output is correct |
36 |
Correct |
7 ms |
336 KB |
Output is correct |
37 |
Correct |
7 ms |
428 KB |
Output is correct |
38 |
Correct |
6 ms |
336 KB |
Output is correct |
39 |
Correct |
10 ms |
336 KB |
Output is correct |
40 |
Correct |
14 ms |
436 KB |
Output is correct |
41 |
Correct |
16 ms |
432 KB |
Output is correct |
42 |
Correct |
15 ms |
428 KB |
Output is correct |
43 |
Correct |
6 ms |
336 KB |
Output is correct |
44 |
Correct |
13 ms |
444 KB |
Output is correct |
45 |
Correct |
11 ms |
464 KB |
Output is correct |
46 |
Correct |
8 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 |
396 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 |
0 ms |
336 KB |
Output is correct |
61 |
Correct |
1 ms |
336 KB |
Output is correct |
62 |
Correct |
0 ms |
336 KB |
Output is correct |
63 |
Correct |
1 ms |
336 KB |
Output is correct |
64 |
Correct |
1 ms |
336 KB |
Output is correct |
65 |
Correct |
1 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 |
0 ms |
336 KB |
Output is correct |
70 |
Correct |
1 ms |
336 KB |
Output is correct |
71 |
Correct |
0 ms |
336 KB |
Output is correct |
72 |
Correct |
0 ms |
336 KB |
Output is correct |