#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
int lca[2005][2005];
vector<int> AdjList[2005];
vector<int> toposort;
bool visited[2005];
void dfs(int u){
if(visited[u]){return;}
visited[u] = true;
//printf("dfs(%d)\n", u);
for(int v: AdjList[u]){
dfs(v);
}
toposort.push_back(u);
}
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];
}
}
if(N > 300){
throw;
}
for(int i = 0; i < N; i ++){
for(int j = 0; j < N; j ++){
if(i == j){continue;}
if(lca[i][j] == i){
AdjList[i].push_back(j);
}
}
}
dfs(0);
reverse(toposort.begin(), toposort.end());
/*printf("Toposort: ");
for(int i = 0; i < N; i ++){
printf("%d ", toposort[i]);
}
printf("\n");*/
for(int i = N-1; i >= 1; i --){
for(int j = i-1; j >= 0; j --){
int u = toposort[i];
int v = toposort[j];
if(lca[u][v] == v){
Bridge(min(u, v), max(u, v));
break;
}
}
}
return;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
512 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 |
0 ms |
384 KB |
Output is correct |
11 |
Correct |
0 ms |
384 KB |
Output is correct |
12 |
Correct |
0 ms |
384 KB |
Output is correct |
13 |
Correct |
0 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
512 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 |
0 ms |
384 KB |
Output is correct |
11 |
Correct |
0 ms |
384 KB |
Output is correct |
12 |
Correct |
0 ms |
384 KB |
Output is correct |
13 |
Correct |
0 ms |
384 KB |
Output is correct |
14 |
Correct |
1 ms |
640 KB |
Output is correct |
15 |
Correct |
2 ms |
640 KB |
Output is correct |
16 |
Correct |
1 ms |
640 KB |
Output is correct |
17 |
Correct |
2 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 |
1 ms |
640 KB |
Output is correct |
25 |
Correct |
2 ms |
640 KB |
Output is correct |
26 |
Correct |
1 ms |
640 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
384 KB |
Output is correct |
2 |
Correct |
0 ms |
384 KB |
Output is correct |
3 |
Correct |
0 ms |
512 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 |
0 ms |
384 KB |
Output is correct |
11 |
Correct |
0 ms |
384 KB |
Output is correct |
12 |
Correct |
0 ms |
384 KB |
Output is correct |
13 |
Correct |
0 ms |
384 KB |
Output is correct |
14 |
Correct |
1 ms |
640 KB |
Output is correct |
15 |
Correct |
2 ms |
640 KB |
Output is correct |
16 |
Correct |
1 ms |
640 KB |
Output is correct |
17 |
Correct |
2 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 |
1 ms |
640 KB |
Output is correct |
25 |
Correct |
2 ms |
640 KB |
Output is correct |
26 |
Correct |
1 ms |
640 KB |
Output is correct |
27 |
Correct |
154 ms |
2040 KB |
Output is correct |
28 |
Correct |
156 ms |
2088 KB |
Output is correct |
29 |
Correct |
149 ms |
2040 KB |
Output is correct |
30 |
Correct |
152 ms |
2040 KB |
Output is correct |
31 |
Correct |
160 ms |
2040 KB |
Output is correct |
32 |
Correct |
164 ms |
2040 KB |
Output is correct |
33 |
Correct |
149 ms |
2040 KB |
Output is correct |
34 |
Correct |
144 ms |
2040 KB |
Output is correct |
35 |
Correct |
143 ms |
2040 KB |
Output is correct |
36 |
Correct |
148 ms |
2040 KB |
Output is correct |
37 |
Correct |
219 ms |
2168 KB |
Output is correct |
38 |
Correct |
239 ms |
2296 KB |
Output is correct |
39 |
Correct |
202 ms |
2300 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
3094 ms |
9104 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |