#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;
vector <int> T[2020], X;
int S[2020], N[2020];
bool chk[2020];
void dfs2(int p, int r, int x)
{
int v;
for(int t: T[p]){
if(t != r){
v = Query(t, p, x);
if(v == p) continue;
else if(v == t){
dfs2(t, p, x);
return;
}
else{
chk[v] = chk[x] = 1;
X.push_back(v);
for(int &u: T[p]){
if(u == t) u = v;
}
for(int &u: T[t]){
if(u == p) u = v;
}
T[v].push_back(p);
T[v].push_back(t);
if(v != x){
X.push_back(x);
T[v].push_back(x);
T[x].push_back(v);
}
return;
}
}
}
chk[x] = 1;
X.push_back(x);
T[p].push_back(x);
T[x].push_back(p);
}
void Solve(int n)
{
int i, j, v, x;
v = Query(0, 1, 2);
chk[v] = 1;
X.push_back(v);
for(i=0; i<3; i++){
chk[i] = 1;
X.push_back(i);
if(i != v){
T[i].push_back(v);
T[v].push_back(i);
}
}
for(i=3; i<n; i++){
N[i] = i;
}
random_shuffle(N + 3, N + n);
for(i=3; i<n; i++){
if(chk[N[i]]) continue;
x = X[rand() % X.size()];
dfs2(x, x, N[i]);
}
for(i=0; i<n; i++){
for(int &t: T[i]){
if(i < t) Bridge(i, t);
}
}
}
Compilation message
meetings.cpp: In function 'void Solve(int)':
meetings.cpp:52:9: warning: unused variable 'j' [-Wunused-variable]
int i, j, v, x;
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
504 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
380 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
504 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
380 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
376 KB |
Output is correct |
15 |
Correct |
2 ms |
376 KB |
Output is correct |
16 |
Correct |
2 ms |
376 KB |
Output is correct |
17 |
Correct |
2 ms |
504 KB |
Output is correct |
18 |
Correct |
2 ms |
376 KB |
Output is correct |
19 |
Correct |
2 ms |
380 KB |
Output is correct |
20 |
Correct |
2 ms |
404 KB |
Output is correct |
21 |
Correct |
2 ms |
504 KB |
Output is correct |
22 |
Correct |
2 ms |
376 KB |
Output is correct |
23 |
Correct |
2 ms |
376 KB |
Output is correct |
24 |
Correct |
2 ms |
376 KB |
Output is correct |
25 |
Correct |
2 ms |
504 KB |
Output is correct |
26 |
Correct |
2 ms |
504 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
504 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
380 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Correct |
2 ms |
376 KB |
Output is correct |
10 |
Correct |
2 ms |
376 KB |
Output is correct |
11 |
Correct |
2 ms |
376 KB |
Output is correct |
12 |
Correct |
2 ms |
376 KB |
Output is correct |
13 |
Correct |
2 ms |
376 KB |
Output is correct |
14 |
Correct |
2 ms |
376 KB |
Output is correct |
15 |
Correct |
2 ms |
376 KB |
Output is correct |
16 |
Correct |
2 ms |
376 KB |
Output is correct |
17 |
Correct |
2 ms |
504 KB |
Output is correct |
18 |
Correct |
2 ms |
376 KB |
Output is correct |
19 |
Correct |
2 ms |
380 KB |
Output is correct |
20 |
Correct |
2 ms |
404 KB |
Output is correct |
21 |
Correct |
2 ms |
504 KB |
Output is correct |
22 |
Correct |
2 ms |
376 KB |
Output is correct |
23 |
Correct |
2 ms |
376 KB |
Output is correct |
24 |
Correct |
2 ms |
376 KB |
Output is correct |
25 |
Correct |
2 ms |
504 KB |
Output is correct |
26 |
Correct |
2 ms |
504 KB |
Output is correct |
27 |
Correct |
9 ms |
440 KB |
Output is correct |
28 |
Correct |
9 ms |
504 KB |
Output is correct |
29 |
Correct |
9 ms |
376 KB |
Output is correct |
30 |
Correct |
9 ms |
376 KB |
Output is correct |
31 |
Correct |
9 ms |
508 KB |
Output is correct |
32 |
Correct |
9 ms |
376 KB |
Output is correct |
33 |
Correct |
12 ms |
504 KB |
Output is correct |
34 |
Correct |
14 ms |
376 KB |
Output is correct |
35 |
Correct |
13 ms |
380 KB |
Output is correct |
36 |
Correct |
11 ms |
376 KB |
Output is correct |
37 |
Correct |
65 ms |
504 KB |
Output is correct |
38 |
Correct |
65 ms |
504 KB |
Output is correct |
39 |
Correct |
64 ms |
376 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1158 ms |
876 KB |
Output is correct |
2 |
Correct |
1232 ms |
764 KB |
Output is correct |
3 |
Correct |
1220 ms |
864 KB |
Output is correct |
4 |
Correct |
1209 ms |
988 KB |
Output is correct |
5 |
Correct |
747 ms |
724 KB |
Output is correct |
6 |
Correct |
587 ms |
760 KB |
Output is correct |
7 |
Correct |
578 ms |
888 KB |
Output is correct |
8 |
Correct |
711 ms |
760 KB |
Output is correct |
9 |
Correct |
754 ms |
820 KB |
Output is correct |
10 |
Correct |
648 ms |
984 KB |
Output is correct |
11 |
Correct |
804 ms |
1020 KB |
Output is correct |
12 |
Execution timed out |
3036 ms |
936 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |