#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
int lca[2005][2005];
void dfs(int u, vector<int> possible){
set<int> impossible;
random_shuffle(possible.begin(), possible.end());
for(int v: possible){
if(impossible.find(v) != impossible.end()){continue;}
bool boleh = true;
for(int x: possible){
if(lca[v][x] == v){
impossible.insert(x);
}else if(lca[v][x] == u){
}else{
boleh = false;
break;
}
}
if(boleh){
vector<int> possible2;
for(int x: possible){
if(lca[v][x] == v && v != x){
possible2.push_back(x);
}
}
Bridge(min(u, v), max(u, v));
dfs(v, possible2);
}else{
impossible.insert(v);
}
}
}
void Solve(int N) {
lca[0][0] = 0;
for(int i = 1; i < N; i ++){
lca[0][i] = 0;
lca[i][0] = 0;
}
for(int i = 1; i < N; i ++){
lca[i][i] = i;
for(int j = i+1; j < N; j ++){
lca[i][j] = Query(0, i, j);
lca[j][i] = lca[i][j];
}
}
vector<int> possible;
for(int i = 1; i < N; i ++){
possible.push_back(i);
}
dfs(0, possible);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
0 ms |
384 KB |
Output is correct |
7 |
Correct |
0 ms |
384 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
0 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
11 |
Correct |
0 ms |
256 KB |
Output is correct |
12 |
Correct |
0 ms |
256 KB |
Output is correct |
13 |
Correct |
0 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
0 ms |
384 KB |
Output is correct |
7 |
Correct |
0 ms |
384 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
0 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
11 |
Correct |
0 ms |
256 KB |
Output is correct |
12 |
Correct |
0 ms |
256 KB |
Output is correct |
13 |
Correct |
0 ms |
384 KB |
Output is correct |
14 |
Correct |
1 ms |
640 KB |
Output is correct |
15 |
Correct |
1 ms |
640 KB |
Output is correct |
16 |
Correct |
1 ms |
640 KB |
Output is correct |
17 |
Correct |
1 ms |
640 KB |
Output is correct |
18 |
Correct |
1 ms |
640 KB |
Output is correct |
19 |
Correct |
1 ms |
640 KB |
Output is correct |
20 |
Correct |
1 ms |
640 KB |
Output is correct |
21 |
Correct |
1 ms |
640 KB |
Output is correct |
22 |
Correct |
1 ms |
640 KB |
Output is correct |
23 |
Correct |
1 ms |
640 KB |
Output is correct |
24 |
Correct |
2 ms |
640 KB |
Output is correct |
25 |
Correct |
2 ms |
640 KB |
Output is correct |
26 |
Correct |
2 ms |
640 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
384 KB |
Output is correct |
4 |
Correct |
0 ms |
384 KB |
Output is correct |
5 |
Correct |
0 ms |
384 KB |
Output is correct |
6 |
Correct |
0 ms |
384 KB |
Output is correct |
7 |
Correct |
0 ms |
384 KB |
Output is correct |
8 |
Correct |
0 ms |
384 KB |
Output is correct |
9 |
Correct |
0 ms |
384 KB |
Output is correct |
10 |
Correct |
1 ms |
384 KB |
Output is correct |
11 |
Correct |
0 ms |
256 KB |
Output is correct |
12 |
Correct |
0 ms |
256 KB |
Output is correct |
13 |
Correct |
0 ms |
384 KB |
Output is correct |
14 |
Correct |
1 ms |
640 KB |
Output is correct |
15 |
Correct |
1 ms |
640 KB |
Output is correct |
16 |
Correct |
1 ms |
640 KB |
Output is correct |
17 |
Correct |
1 ms |
640 KB |
Output is correct |
18 |
Correct |
1 ms |
640 KB |
Output is correct |
19 |
Correct |
1 ms |
640 KB |
Output is correct |
20 |
Correct |
1 ms |
640 KB |
Output is correct |
21 |
Correct |
1 ms |
640 KB |
Output is correct |
22 |
Correct |
1 ms |
640 KB |
Output is correct |
23 |
Correct |
1 ms |
640 KB |
Output is correct |
24 |
Correct |
2 ms |
640 KB |
Output is correct |
25 |
Correct |
2 ms |
640 KB |
Output is correct |
26 |
Correct |
2 ms |
640 KB |
Output is correct |
27 |
Correct |
159 ms |
2040 KB |
Output is correct |
28 |
Correct |
152 ms |
2040 KB |
Output is correct |
29 |
Correct |
152 ms |
2040 KB |
Output is correct |
30 |
Correct |
159 ms |
2132 KB |
Output is correct |
31 |
Correct |
184 ms |
2040 KB |
Output is correct |
32 |
Correct |
184 ms |
2040 KB |
Output is correct |
33 |
Correct |
157 ms |
2040 KB |
Output is correct |
34 |
Correct |
146 ms |
2060 KB |
Output is correct |
35 |
Correct |
142 ms |
2040 KB |
Output is correct |
36 |
Correct |
154 ms |
2164 KB |
Output is correct |
37 |
Correct |
226 ms |
3064 KB |
Output is correct |
38 |
Correct |
255 ms |
3876 KB |
Output is correct |
39 |
Correct |
217 ms |
4600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3083 ms |
9216 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |