#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int mp[2020][2020];
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];
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 |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
0 ms |
336 KB |
Output is correct |
| 8 |
Correct |
1 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
1 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
0 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 |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
0 ms |
336 KB |
Output is correct |
| 8 |
Correct |
1 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
1 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
0 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 |
472 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 |
0 ms |
336 KB |
Output is correct |
| 4 |
Correct |
0 ms |
336 KB |
Output is correct |
| 5 |
Correct |
0 ms |
336 KB |
Output is correct |
| 6 |
Correct |
0 ms |
336 KB |
Output is correct |
| 7 |
Correct |
0 ms |
336 KB |
Output is correct |
| 8 |
Correct |
1 ms |
336 KB |
Output is correct |
| 9 |
Correct |
0 ms |
336 KB |
Output is correct |
| 10 |
Correct |
1 ms |
336 KB |
Output is correct |
| 11 |
Correct |
0 ms |
336 KB |
Output is correct |
| 12 |
Correct |
0 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 |
472 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 |
8 ms |
1616 KB |
Output is correct |
| 28 |
Correct |
6 ms |
1684 KB |
Output is correct |
| 29 |
Correct |
7 ms |
1616 KB |
Output is correct |
| 30 |
Correct |
8 ms |
1664 KB |
Output is correct |
| 31 |
Correct |
6 ms |
1616 KB |
Output is correct |
| 32 |
Correct |
8 ms |
1616 KB |
Output is correct |
| 33 |
Correct |
12 ms |
1688 KB |
Output is correct |
| 34 |
Correct |
14 ms |
1684 KB |
Output is correct |
| 35 |
Correct |
12 ms |
1624 KB |
Output is correct |
| 36 |
Correct |
7 ms |
1744 KB |
Output is correct |
| 37 |
Correct |
44 ms |
1928 KB |
Output is correct |
| 38 |
Correct |
75 ms |
2008 KB |
Output is correct |
| 39 |
Correct |
172 ms |
2296 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
584 ms |
13524 KB |
Output is correct |
| 2 |
Correct |
719 ms |
13640 KB |
Output is correct |
| 3 |
Correct |
648 ms |
13700 KB |
Output is correct |
| 4 |
Correct |
743 ms |
14088 KB |
Output is correct |
| 5 |
Correct |
544 ms |
13736 KB |
Output is correct |
| 6 |
Correct |
535 ms |
13820 KB |
Output is correct |
| 7 |
Correct |
583 ms |
14032 KB |
Output is correct |
| 8 |
Correct |
629 ms |
13768 KB |
Output is correct |
| 9 |
Correct |
674 ms |
13868 KB |
Output is correct |
| 10 |
Correct |
637 ms |
13816 KB |
Output is correct |
| 11 |
Correct |
681 ms |
13932 KB |
Output is correct |
| 12 |
Execution timed out |
2935 ms |
15212 KB |
Time limit exceeded |
| 13 |
Halted |
0 ms |
0 KB |
- |
