#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;
struct DSU {
vector <int> par;
int n;
inline void init(int _n) {
n = _n;
par.resize(n, -1);
}
int root(int x) {
if(par[x] == -1) return x;
return par[x] = root(par[x]);
}
inline void join(int x, int y) {
x = root(x), y = root(y);
if(x != y) {
par[x] = y;
}
}
}dsu;
const int MAXN = 2000;
static int vis[MAXN], now = 0;
void solve(vector <int> &nodes) {
if(nodes.empty()) return ;
int n = nodes.size();
random_shuffle(nodes.begin(), nodes.end());
//sort(nodes.rbegin(), nodes.rend());
int root = nodes[rand() % n];
now++; vis[root] = now;
for(auto it : nodes) {
dsu.par[it] = -1;
//cerr << it << " ";
}
//cerr << "\n";
set <int> special;
for(auto it : nodes) {
if(vis[it] == now || special.find(it) != special.end()) continue;
bool ok = 0;
for(auto x : special) {
//cerr << x << " " << it << " " << root << "\n";
int cur = Query(x, it, root);
if(cur == root) continue;
dsu.join(x, cur);
dsu.join(it, cur);
special.erase(x);
special.insert(cur);
ok = 1;
break;
}
if(ok == 0) {
special.insert(it);
}
}
for(auto cur : special) {
Bridge(min(root, cur), max(root, cur));
vector <int> aux;
for(auto it : nodes) {
if(dsu.root(it) == cur) {
aux.push_back(it);
}
}
solve(aux);
}
}
void Solve(int n) {
srand(time(NULL));
mt19937 rng(time(NULL));
vector <int> nodes(n);
random_shuffle(nodes.begin(), nodes.end());
iota(nodes.begin(), nodes.end(), 0);
dsu.init(n);
solve(nodes);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
248 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
248 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
248 KB |
Output is correct |
| 7 |
Correct |
2 ms |
248 KB |
Output is correct |
| 8 |
Correct |
2 ms |
300 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 |
252 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
252 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
248 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
248 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
248 KB |
Output is correct |
| 7 |
Correct |
2 ms |
248 KB |
Output is correct |
| 8 |
Correct |
2 ms |
300 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 |
252 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
252 KB |
Output is correct |
| 14 |
Correct |
2 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
2 ms |
248 KB |
Output is correct |
| 18 |
Correct |
3 ms |
376 KB |
Output is correct |
| 19 |
Correct |
3 ms |
376 KB |
Output is correct |
| 20 |
Correct |
3 ms |
376 KB |
Output is correct |
| 21 |
Correct |
2 ms |
276 KB |
Output is correct |
| 22 |
Correct |
2 ms |
248 KB |
Output is correct |
| 23 |
Correct |
2 ms |
248 KB |
Output is correct |
| 24 |
Correct |
2 ms |
248 KB |
Output is correct |
| 25 |
Correct |
2 ms |
248 KB |
Output is correct |
| 26 |
Correct |
2 ms |
248 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
248 KB |
Output is correct |
| 3 |
Correct |
2 ms |
376 KB |
Output is correct |
| 4 |
Correct |
2 ms |
248 KB |
Output is correct |
| 5 |
Correct |
2 ms |
376 KB |
Output is correct |
| 6 |
Correct |
2 ms |
248 KB |
Output is correct |
| 7 |
Correct |
2 ms |
248 KB |
Output is correct |
| 8 |
Correct |
2 ms |
300 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 |
252 KB |
Output is correct |
| 12 |
Correct |
2 ms |
376 KB |
Output is correct |
| 13 |
Correct |
2 ms |
252 KB |
Output is correct |
| 14 |
Correct |
2 ms |
376 KB |
Output is correct |
| 15 |
Correct |
3 ms |
376 KB |
Output is correct |
| 16 |
Correct |
3 ms |
376 KB |
Output is correct |
| 17 |
Correct |
2 ms |
248 KB |
Output is correct |
| 18 |
Correct |
3 ms |
376 KB |
Output is correct |
| 19 |
Correct |
3 ms |
376 KB |
Output is correct |
| 20 |
Correct |
3 ms |
376 KB |
Output is correct |
| 21 |
Correct |
2 ms |
276 KB |
Output is correct |
| 22 |
Correct |
2 ms |
248 KB |
Output is correct |
| 23 |
Correct |
2 ms |
248 KB |
Output is correct |
| 24 |
Correct |
2 ms |
248 KB |
Output is correct |
| 25 |
Correct |
2 ms |
248 KB |
Output is correct |
| 26 |
Correct |
2 ms |
248 KB |
Output is correct |
| 27 |
Correct |
45 ms |
376 KB |
Output is correct |
| 28 |
Correct |
46 ms |
604 KB |
Output is correct |
| 29 |
Correct |
31 ms |
376 KB |
Output is correct |
| 30 |
Correct |
43 ms |
400 KB |
Output is correct |
| 31 |
Correct |
38 ms |
376 KB |
Output is correct |
| 32 |
Correct |
75 ms |
644 KB |
Output is correct |
| 33 |
Correct |
79 ms |
632 KB |
Output is correct |
| 34 |
Correct |
89 ms |
504 KB |
Output is correct |
| 35 |
Correct |
71 ms |
632 KB |
Output is correct |
| 36 |
Correct |
19 ms |
296 KB |
Output is correct |
| 37 |
Correct |
13 ms |
488 KB |
Output is correct |
| 38 |
Correct |
12 ms |
376 KB |
Output is correct |
| 39 |
Correct |
13 ms |
424 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3021 ms |
992 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
