#include "bits/stdc++.h"
#include "meetings.h"
//#include "grader.cpp"
using namespace std;
#define MAX_N 2003
int comm_anc[MAX_N][MAX_N];
set <int> anc[MAX_N] ,sbtree[MAX_N];
void Solve(int N) {
for(int i=0; i<N; i++)
sbtree[0].insert(i) ,anc[i].insert(0)
,sbtree[i].insert(i) ,anc[i].insert(i);
for(int u=1; u<N; u++)
for(int v=u+1; v<N; v++){
int o = comm_anc[v][u] = comm_anc[u][v] = Query(0 ,u ,v);
sbtree[o].insert(u) ,sbtree[o].insert(v);
anc[v].insert(o) ,anc[u].insert(o);
}
for(int i=1; i<N; i++){
pair <int ,int> mi = {1e9 ,-1};
for(auto&u : anc[i])
if(u != i)
mi = min(mi ,make_pair((int)sbtree[u].size() ,u));
//cout << i << ' ' << mi.second << endl;
Bridge(min(i ,mi.second) ,max(i ,mi.second));
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
504 KB |
Output is correct |
| 4 |
Correct |
2 ms |
504 KB |
Output is correct |
| 5 |
Correct |
2 ms |
632 KB |
Output is correct |
| 6 |
Correct |
2 ms |
504 KB |
Output is correct |
| 7 |
Correct |
2 ms |
504 KB |
Output is correct |
| 8 |
Correct |
2 ms |
504 KB |
Output is correct |
| 9 |
Correct |
2 ms |
632 KB |
Output is correct |
| 10 |
Correct |
2 ms |
504 KB |
Output is correct |
| 11 |
Correct |
2 ms |
508 KB |
Output is correct |
| 12 |
Correct |
2 ms |
504 KB |
Output is correct |
| 13 |
Correct |
2 ms |
632 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
504 KB |
Output is correct |
| 4 |
Correct |
2 ms |
504 KB |
Output is correct |
| 5 |
Correct |
2 ms |
632 KB |
Output is correct |
| 6 |
Correct |
2 ms |
504 KB |
Output is correct |
| 7 |
Correct |
2 ms |
504 KB |
Output is correct |
| 8 |
Correct |
2 ms |
504 KB |
Output is correct |
| 9 |
Correct |
2 ms |
632 KB |
Output is correct |
| 10 |
Correct |
2 ms |
504 KB |
Output is correct |
| 11 |
Correct |
2 ms |
508 KB |
Output is correct |
| 12 |
Correct |
2 ms |
504 KB |
Output is correct |
| 13 |
Correct |
2 ms |
632 KB |
Output is correct |
| 14 |
Correct |
3 ms |
808 KB |
Output is correct |
| 15 |
Correct |
3 ms |
760 KB |
Output is correct |
| 16 |
Correct |
3 ms |
760 KB |
Output is correct |
| 17 |
Correct |
3 ms |
888 KB |
Output is correct |
| 18 |
Correct |
3 ms |
756 KB |
Output is correct |
| 19 |
Correct |
2 ms |
760 KB |
Output is correct |
| 20 |
Correct |
3 ms |
760 KB |
Output is correct |
| 21 |
Correct |
3 ms |
760 KB |
Output is correct |
| 22 |
Correct |
3 ms |
760 KB |
Output is correct |
| 23 |
Correct |
3 ms |
888 KB |
Output is correct |
| 24 |
Correct |
4 ms |
888 KB |
Output is correct |
| 25 |
Correct |
3 ms |
888 KB |
Output is correct |
| 26 |
Correct |
3 ms |
888 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
504 KB |
Output is correct |
| 2 |
Correct |
2 ms |
504 KB |
Output is correct |
| 3 |
Correct |
2 ms |
504 KB |
Output is correct |
| 4 |
Correct |
2 ms |
504 KB |
Output is correct |
| 5 |
Correct |
2 ms |
632 KB |
Output is correct |
| 6 |
Correct |
2 ms |
504 KB |
Output is correct |
| 7 |
Correct |
2 ms |
504 KB |
Output is correct |
| 8 |
Correct |
2 ms |
504 KB |
Output is correct |
| 9 |
Correct |
2 ms |
632 KB |
Output is correct |
| 10 |
Correct |
2 ms |
504 KB |
Output is correct |
| 11 |
Correct |
2 ms |
508 KB |
Output is correct |
| 12 |
Correct |
2 ms |
504 KB |
Output is correct |
| 13 |
Correct |
2 ms |
632 KB |
Output is correct |
| 14 |
Correct |
3 ms |
808 KB |
Output is correct |
| 15 |
Correct |
3 ms |
760 KB |
Output is correct |
| 16 |
Correct |
3 ms |
760 KB |
Output is correct |
| 17 |
Correct |
3 ms |
888 KB |
Output is correct |
| 18 |
Correct |
3 ms |
756 KB |
Output is correct |
| 19 |
Correct |
2 ms |
760 KB |
Output is correct |
| 20 |
Correct |
3 ms |
760 KB |
Output is correct |
| 21 |
Correct |
3 ms |
760 KB |
Output is correct |
| 22 |
Correct |
3 ms |
760 KB |
Output is correct |
| 23 |
Correct |
3 ms |
888 KB |
Output is correct |
| 24 |
Correct |
4 ms |
888 KB |
Output is correct |
| 25 |
Correct |
3 ms |
888 KB |
Output is correct |
| 26 |
Correct |
3 ms |
888 KB |
Output is correct |
| 27 |
Correct |
144 ms |
2452 KB |
Output is correct |
| 28 |
Correct |
144 ms |
2364 KB |
Output is correct |
| 29 |
Correct |
143 ms |
2344 KB |
Output is correct |
| 30 |
Correct |
146 ms |
2428 KB |
Output is correct |
| 31 |
Correct |
148 ms |
2408 KB |
Output is correct |
| 32 |
Correct |
146 ms |
2300 KB |
Output is correct |
| 33 |
Correct |
143 ms |
2248 KB |
Output is correct |
| 34 |
Correct |
148 ms |
2280 KB |
Output is correct |
| 35 |
Correct |
146 ms |
2268 KB |
Output is correct |
| 36 |
Correct |
156 ms |
2504 KB |
Output is correct |
| 37 |
Correct |
242 ms |
4392 KB |
Output is correct |
| 38 |
Correct |
266 ms |
5312 KB |
Output is correct |
| 39 |
Correct |
276 ms |
6364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3039 ms |
10640 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
