#include "meetings.h"
#include <iostream>
#include <vector>
using namespace std;
const int maxN = 2e3 + 326;
vector<int> adj[maxN];
void solve(vector<int> vec){
//cout << "vec = "; for(int x : vec) cout << x << " "; cout << endl;
if(vec.size() == 1) return;
if(vec.size() == 2){
//cout << "Bridging: " << vec[0] << ", " << vec[1] << endl;
if(vec[0] > vec[1]) swap(vec[0], vec[1]);
Bridge(vec[0], vec[1]);
return;
}
int cur = vec[1];
for(int i = 2; i < (int)vec.size(); i++){
int res = Query(vec[0], cur, vec[i]);
if(res == vec[i]) cur = res;
}
//cout << "Bridging: " << vec[0] << ", " << cur << endl;
vector<int> l, r;
l.push_back(vec[0]);
r.push_back(cur);
for(int i = 1; i < (int)vec.size(); i++) if(vec[i] != cur){
int res = Query(vec[0], cur, vec[i]);
if(res == vec[0]) l.push_back(vec[i]);
else r.push_back(vec[i]);
}
solve(l);
solve(r);
if(vec[0] > cur) swap(vec[0], cur);
Bridge(vec[0], cur);
}
void Solve(int N){
vector<int> jizz = vector<int>();
for(int i = 0; i < N; i++) jizz.push_back(i);
solve(jizz);
}
# |
Verdict |
Execution time |
Memory |
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 |
0 ms |
364 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
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 |
0 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 |
1 ms |
492 KB |
Output is correct |
17 |
Correct |
1 ms |
492 KB |
Output is correct |
18 |
Correct |
1 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 |
1 ms |
492 KB |
Output is correct |
22 |
Correct |
1 ms |
492 KB |
Output is correct |
23 |
Correct |
1 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 |
# |
Verdict |
Execution time |
Memory |
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 |
0 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 |
1 ms |
492 KB |
Output is correct |
17 |
Correct |
1 ms |
492 KB |
Output is correct |
18 |
Correct |
1 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 |
1 ms |
492 KB |
Output is correct |
22 |
Correct |
1 ms |
492 KB |
Output is correct |
23 |
Correct |
1 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 |
25 ms |
548 KB |
Output is correct |
28 |
Correct |
21 ms |
492 KB |
Output is correct |
29 |
Correct |
26 ms |
492 KB |
Output is correct |
30 |
Correct |
28 ms |
492 KB |
Output is correct |
31 |
Correct |
21 ms |
492 KB |
Output is correct |
32 |
Correct |
20 ms |
492 KB |
Output is correct |
33 |
Correct |
32 ms |
492 KB |
Output is correct |
34 |
Correct |
39 ms |
492 KB |
Output is correct |
35 |
Correct |
35 ms |
492 KB |
Output is correct |
36 |
Correct |
32 ms |
492 KB |
Output is correct |
37 |
Correct |
239 ms |
748 KB |
Output is correct |
38 |
Correct |
323 ms |
876 KB |
Output is correct |
39 |
Correct |
345 ms |
984 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1940 ms |
748 KB |
Output is correct |
2 |
Execution timed out |
2208 ms |
1004 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |