#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int mp[2020][2020], qcnt;
int query(int x, int y, int z){
if (x==1){
if (y > z) swap(y, z);
if (mp[y][z]) return mp[y][z];
assert(qcnt++ <= 100000);
return mp[y][z] = Query(x-1, y-1, z-1) + 1;
}
return Query(x-1, y-1, z-1) + 1;
}
void answer(int x, int y){
if (x > y) swap(x, y);
Bridge(x-1, y-1);
}
void dfs(int s, const vector<int> &a){
vector<vector<int>> subtree;
for (const auto &x:a){
bool flag = 0;
for (auto &V:subtree){
if (query(1, x, V[0])!=s){
flag = 1;
V.push_back(x);
break;
}
}
if (flag) continue;
subtree.emplace_back();
subtree.back().push_back(x);
}
for (auto &V:subtree){
vector<int> C = V;
while(C.size() > 1){
int x = C.back(); C.pop_back();
int y = C.back(); C.pop_back();
int z = query(1, x, y);
if (x==z) C.push_back(x);
if (y==z) C.push_back(y);
}
answer(s, C[0]);
V.erase(find(V.begin(), V.end(), C[0]));
dfs(C[0], V);
}
}
void Solve(int N) {
vector<int> a;
for (int i=2;i<=N;i++) a.push_back(i);
dfs(1, a);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
336 KB |
Output is correct |
| 4 |
Correct |
1 ms |
336 KB |
Output is correct |
| 5 |
Correct |
1 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
0 ms |
336 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
336 KB |
Output is correct |
| 4 |
Correct |
1 ms |
336 KB |
Output is correct |
| 5 |
Correct |
1 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
0 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
464 KB |
Output is correct |
| 15 |
Correct |
1 ms |
464 KB |
Output is correct |
| 16 |
Correct |
1 ms |
464 KB |
Output is correct |
| 17 |
Correct |
1 ms |
464 KB |
Output is correct |
| 18 |
Correct |
1 ms |
464 KB |
Output is correct |
| 19 |
Correct |
1 ms |
464 KB |
Output is correct |
| 20 |
Correct |
1 ms |
464 KB |
Output is correct |
| 21 |
Correct |
1 ms |
464 KB |
Output is correct |
| 22 |
Correct |
1 ms |
464 KB |
Output is correct |
| 23 |
Correct |
1 ms |
464 KB |
Output is correct |
| 24 |
Correct |
1 ms |
464 KB |
Output is correct |
| 25 |
Correct |
1 ms |
464 KB |
Output is correct |
| 26 |
Correct |
1 ms |
464 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
336 KB |
Output is correct |
| 2 |
Correct |
1 ms |
336 KB |
Output is correct |
| 3 |
Correct |
1 ms |
336 KB |
Output is correct |
| 4 |
Correct |
1 ms |
336 KB |
Output is correct |
| 5 |
Correct |
1 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
1 ms |
336 KB |
Output is correct |
| 8 |
Correct |
0 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
0 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
1 ms |
336 KB |
Output is correct |
| 13 |
Correct |
0 ms |
336 KB |
Output is correct |
| 14 |
Correct |
1 ms |
464 KB |
Output is correct |
| 15 |
Correct |
1 ms |
464 KB |
Output is correct |
| 16 |
Correct |
1 ms |
464 KB |
Output is correct |
| 17 |
Correct |
1 ms |
464 KB |
Output is correct |
| 18 |
Correct |
1 ms |
464 KB |
Output is correct |
| 19 |
Correct |
1 ms |
464 KB |
Output is correct |
| 20 |
Correct |
1 ms |
464 KB |
Output is correct |
| 21 |
Correct |
1 ms |
464 KB |
Output is correct |
| 22 |
Correct |
1 ms |
464 KB |
Output is correct |
| 23 |
Correct |
1 ms |
464 KB |
Output is correct |
| 24 |
Correct |
1 ms |
464 KB |
Output is correct |
| 25 |
Correct |
1 ms |
464 KB |
Output is correct |
| 26 |
Correct |
1 ms |
464 KB |
Output is correct |
| 27 |
Correct |
6 ms |
1616 KB |
Output is correct |
| 28 |
Correct |
6 ms |
1616 KB |
Output is correct |
| 29 |
Correct |
7 ms |
1616 KB |
Output is correct |
| 30 |
Correct |
8 ms |
1744 KB |
Output is correct |
| 31 |
Correct |
8 ms |
1616 KB |
Output is correct |
| 32 |
Correct |
8 ms |
1708 KB |
Output is correct |
| 33 |
Correct |
15 ms |
1616 KB |
Output is correct |
| 34 |
Correct |
14 ms |
1616 KB |
Output is correct |
| 35 |
Correct |
15 ms |
1640 KB |
Output is correct |
| 36 |
Correct |
10 ms |
1616 KB |
Output is correct |
| 37 |
Correct |
48 ms |
1824 KB |
Output is correct |
| 38 |
Correct |
86 ms |
2108 KB |
Output is correct |
| 39 |
Correct |
179 ms |
2172 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
585 ms |
13544 KB |
Output is correct |
| 2 |
Correct |
781 ms |
13728 KB |
Output is correct |
| 3 |
Correct |
653 ms |
13692 KB |
Output is correct |
| 4 |
Correct |
754 ms |
14092 KB |
Output is correct |
| 5 |
Correct |
578 ms |
13688 KB |
Output is correct |
| 6 |
Correct |
590 ms |
13868 KB |
Output is correct |
| 7 |
Correct |
592 ms |
13860 KB |
Output is correct |
| 8 |
Correct |
697 ms |
13808 KB |
Output is correct |
| 9 |
Correct |
710 ms |
13904 KB |
Output is correct |
| 10 |
Correct |
660 ms |
13820 KB |
Output is correct |
| 11 |
Correct |
696 ms |
13844 KB |
Output is correct |
| 12 |
Execution timed out |
3044 ms |
15372 KB |
Time limit exceeded |
| 13 |
Halted |
0 ms |
0 KB |
- |
