#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
void Solve(int n) {
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
int cnt=0;
for(int k=0;k<n;k++){
if(i==k||j==k)continue;
int t=Query(i,j,k);
if(t==i||t==j){
cnt++;
}
}
if(cnt==n-2){
Bridge(i,j);
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
0 ms |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
344 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
0 ms |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
344 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
21 ms |
484 KB |
Output is correct |
15 |
Correct |
20 ms |
484 KB |
Output is correct |
16 |
Correct |
20 ms |
476 KB |
Output is correct |
17 |
Correct |
22 ms |
344 KB |
Output is correct |
18 |
Correct |
22 ms |
488 KB |
Output is correct |
19 |
Correct |
20 ms |
480 KB |
Output is correct |
20 |
Correct |
20 ms |
464 KB |
Output is correct |
21 |
Correct |
19 ms |
344 KB |
Output is correct |
22 |
Correct |
19 ms |
344 KB |
Output is correct |
23 |
Correct |
24 ms |
344 KB |
Output is correct |
24 |
Correct |
31 ms |
484 KB |
Output is correct |
25 |
Correct |
30 ms |
344 KB |
Output is correct |
26 |
Correct |
30 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
0 ms |
344 KB |
Output is correct |
10 |
Correct |
0 ms |
344 KB |
Output is correct |
11 |
Correct |
0 ms |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
344 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
21 ms |
484 KB |
Output is correct |
15 |
Correct |
20 ms |
484 KB |
Output is correct |
16 |
Correct |
20 ms |
476 KB |
Output is correct |
17 |
Correct |
22 ms |
344 KB |
Output is correct |
18 |
Correct |
22 ms |
488 KB |
Output is correct |
19 |
Correct |
20 ms |
480 KB |
Output is correct |
20 |
Correct |
20 ms |
464 KB |
Output is correct |
21 |
Correct |
19 ms |
344 KB |
Output is correct |
22 |
Correct |
19 ms |
344 KB |
Output is correct |
23 |
Correct |
24 ms |
344 KB |
Output is correct |
24 |
Correct |
31 ms |
484 KB |
Output is correct |
25 |
Correct |
30 ms |
344 KB |
Output is correct |
26 |
Correct |
30 ms |
344 KB |
Output is correct |
27 |
Incorrect |
188 ms |
476 KB |
Wrong Answer [2] |
28 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1702 ms |
620 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |