#include "meetings.h"
#include<bits/stdc++.h>
using namespace std;
const int MAXN=302;
vector<int> G[MAXN], V[MAXN];
int LCA[MAXN][MAXN];
bool isRoot[MAXN];
void FindEdges(int x){
for(auto i:V[x]) isRoot[i]=1;
for(auto i:V[x]){
for(auto j:V[x]){
if(i!=j&&LCA[i][j]!=x&&LCA[i][j]!=i){
isRoot[i]=0;
}
}
}
for(auto i:V[x]){
if(isRoot[i]){
G[x].push_back(i);
for(auto j:V[x]){
if(i!=j&&LCA[i][j]==i){
V[i].push_back(j);
}
}
}
}
}
void dfs(int x){
FindEdges(x);
for(auto i:G[x]){
dfs(i);
}
}
void Solve(int N) {
for(int i=1;i<N;i++){
for(int j=i+1;j<N;j++){
int x=Query(0,i,j);
LCA[i][j]=LCA[j][i]=x;
}
}
for(int i=1;i<N;i++) V[0].push_back(i);
dfs(0);
for(int i=0;i<N;i++){
for(auto j:G[i]){
//cout<<i<<" "<<j<<"\n";
int x=min(i,j), y=max(i,j);
Bridge(x,y);
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
492 KB |
Output is correct |
15 |
Correct |
1 ms |
492 KB |
Output is correct |
16 |
Correct |
2 ms |
492 KB |
Output is correct |
17 |
Correct |
2 ms |
492 KB |
Output is correct |
18 |
Correct |
2 ms |
492 KB |
Output is correct |
19 |
Correct |
1 ms |
492 KB |
Output is correct |
20 |
Correct |
1 ms |
492 KB |
Output is correct |
21 |
Correct |
2 ms |
492 KB |
Output is correct |
22 |
Correct |
1 ms |
492 KB |
Output is correct |
23 |
Correct |
2 ms |
492 KB |
Output is correct |
24 |
Correct |
2 ms |
492 KB |
Output is correct |
25 |
Correct |
2 ms |
492 KB |
Output is correct |
26 |
Correct |
2 ms |
492 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
364 KB |
Output is correct |
4 |
Correct |
1 ms |
364 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
364 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |
11 |
Correct |
1 ms |
364 KB |
Output is correct |
12 |
Correct |
1 ms |
364 KB |
Output is correct |
13 |
Correct |
1 ms |
364 KB |
Output is correct |
14 |
Correct |
1 ms |
492 KB |
Output is correct |
15 |
Correct |
1 ms |
492 KB |
Output is correct |
16 |
Correct |
2 ms |
492 KB |
Output is correct |
17 |
Correct |
2 ms |
492 KB |
Output is correct |
18 |
Correct |
2 ms |
492 KB |
Output is correct |
19 |
Correct |
1 ms |
492 KB |
Output is correct |
20 |
Correct |
1 ms |
492 KB |
Output is correct |
21 |
Correct |
2 ms |
492 KB |
Output is correct |
22 |
Correct |
1 ms |
492 KB |
Output is correct |
23 |
Correct |
2 ms |
492 KB |
Output is correct |
24 |
Correct |
2 ms |
492 KB |
Output is correct |
25 |
Correct |
2 ms |
492 KB |
Output is correct |
26 |
Correct |
2 ms |
492 KB |
Output is correct |
27 |
Correct |
162 ms |
748 KB |
Output is correct |
28 |
Correct |
163 ms |
876 KB |
Output is correct |
29 |
Correct |
163 ms |
748 KB |
Output is correct |
30 |
Correct |
164 ms |
748 KB |
Output is correct |
31 |
Correct |
179 ms |
876 KB |
Output is correct |
32 |
Correct |
156 ms |
748 KB |
Output is correct |
33 |
Correct |
149 ms |
748 KB |
Output is correct |
34 |
Correct |
148 ms |
748 KB |
Output is correct |
35 |
Correct |
149 ms |
876 KB |
Output is correct |
36 |
Correct |
181 ms |
876 KB |
Output is correct |
37 |
Correct |
272 ms |
960 KB |
Output is correct |
38 |
Correct |
283 ms |
1004 KB |
Output is correct |
39 |
Correct |
244 ms |
1004 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
13 ms |
1644 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |