#include "meetings.h"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
mt19937 rnd(228);
const int N = 2010;
short lca[N][N], used[N], timer, up[N][20], all;
short nh[20][N], have[N][N], sz_nh[20], sz_have[N];
vector<pair<short, short>> pars[N];
short ptr[N], color[N], skip[N];
int opers, opers2 ;
bool was[N];
inline short get(short a, short b) {
if (a > b) {
swap(a, b);
}
return lca[a][b];
}
inline void update_lca(short a, short b, short c) {
if (a > b) {
swap(a, b);
}
lca[a][b] = c;
}
int get_color(int v) {
if (color[v] != -1) {
return color[v];
}
return color[v] = get_color(pars[v][ptr[v]].F);
}
vector<pair<int, int>> edge;
void Solve(int n) {
short root = rnd() % n;
for (int i = 0; i < n; i++) {
have[root][sz_have[root]++] = i;
}
assert(n <= 2000);
queue<short> q;
q.push(root);
while (!q.empty()) {
int root = q.front();
assert(!was[root]);
was[root] = true;
q.pop();
if (sz_have[root] == 1) {
continue;
}
for (int i = 0; i < sz_have[root]; i++) {
color[have[root][i]] = -1;
}
short id = (have[root][0] == root ? 1 : 0);
short cc = 1;
nh[0][0] = have[root][id];
sz_nh[0] = 1;
up[root][0] = have[root][id];
color[have[root][id]] = 0;
timer++;
for (int i = id + 1; i < sz_have[root]; i++) {
if (have[root][i] == root) {
continue;
}
while (ptr[have[root][i]] < SZ(pars[have[root][i]]) && was[pars[have[root][i]][ptr[have[root][i]]].S]) {
ptr[have[root][i]]++;
opers2++;
}
if (ptr[have[root][i]] < SZ(pars[have[root][i]]) || color[have[root][i]] != -1) {
skip[have[root][i]] = timer;
continue;
}
for (int j = 0; j < cc; j++) {
opers++;
short v;
v = (up[root][j] == have[root][i] ? have[root][i] : Query(root, up[root][j], have[root][i]));
if (v != root) {
if (v != up[root][j]) pars[up[root][j]].pb({have[root][i], v});
else if (have[root][i] != up[root][j]) pars[have[root][i]].pb({up[root][j], v});
up[root][j] = v;
color[v] = j;
nh[j][sz_nh[j]] = have[root][i];
sz_nh[j]++;
color[have[root][i]] = j;
break;
}
}
if (color[have[root][i]] == -1) {
nh[cc][0] = have[root][i];
sz_nh[cc] = 1;
up[root][cc] = have[root][i];
color[have[root][i]] = cc;
cc++;
}
}
assert(opers <= (int)n * n);
assert(opers2 <= (int)n * n);
for (int i = 0; i < cc; i++) {
edge.pb({root, up[root][i]});
}
for (int i = 0; i < sz_have[root]; i++) {
if (have[root][i] != root && skip[have[root][i]] == timer) {
get_color(have[root][i]);
nh[color[have[root][i]]][sz_nh[color[have[root][i]]]] = have[root][i];
sz_nh[color[have[root][i]]]++;
}
}
for (int i = 0; i < cc; i++) {
for (int j = 0; j < sz_nh[i]; j++) {
have[up[root][i]][j] = nh[i][j];
}
sz_have[up[root][i]] = sz_nh[i];
}
for (int i = 0; i < cc; i++) {
q.push(up[root][i]);
}
}
for (auto &it : edge) {
if (it.F > it.S) {
swap(it.F, it.S);
}
Bridge(it.F, it.S);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
424 KB |
Output is correct |
4 |
Correct |
5 ms |
504 KB |
Output is correct |
5 |
Correct |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
5 ms |
376 KB |
Output is correct |
7 |
Correct |
5 ms |
504 KB |
Output is correct |
8 |
Correct |
5 ms |
376 KB |
Output is correct |
9 |
Correct |
5 ms |
376 KB |
Output is correct |
10 |
Correct |
5 ms |
376 KB |
Output is correct |
11 |
Correct |
5 ms |
376 KB |
Output is correct |
12 |
Correct |
5 ms |
504 KB |
Output is correct |
13 |
Correct |
5 ms |
504 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
424 KB |
Output is correct |
4 |
Correct |
5 ms |
504 KB |
Output is correct |
5 |
Correct |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
5 ms |
376 KB |
Output is correct |
7 |
Correct |
5 ms |
504 KB |
Output is correct |
8 |
Correct |
5 ms |
376 KB |
Output is correct |
9 |
Correct |
5 ms |
376 KB |
Output is correct |
10 |
Correct |
5 ms |
376 KB |
Output is correct |
11 |
Correct |
5 ms |
376 KB |
Output is correct |
12 |
Correct |
5 ms |
504 KB |
Output is correct |
13 |
Correct |
5 ms |
504 KB |
Output is correct |
14 |
Correct |
5 ms |
632 KB |
Output is correct |
15 |
Correct |
6 ms |
632 KB |
Output is correct |
16 |
Correct |
5 ms |
632 KB |
Output is correct |
17 |
Correct |
5 ms |
632 KB |
Output is correct |
18 |
Correct |
5 ms |
632 KB |
Output is correct |
19 |
Correct |
5 ms |
760 KB |
Output is correct |
20 |
Correct |
6 ms |
632 KB |
Output is correct |
21 |
Correct |
5 ms |
632 KB |
Output is correct |
22 |
Correct |
5 ms |
760 KB |
Output is correct |
23 |
Correct |
5 ms |
632 KB |
Output is correct |
24 |
Correct |
5 ms |
632 KB |
Output is correct |
25 |
Correct |
5 ms |
632 KB |
Output is correct |
26 |
Correct |
5 ms |
632 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
376 KB |
Output is correct |
2 |
Correct |
5 ms |
376 KB |
Output is correct |
3 |
Correct |
5 ms |
424 KB |
Output is correct |
4 |
Correct |
5 ms |
504 KB |
Output is correct |
5 |
Correct |
5 ms |
376 KB |
Output is correct |
6 |
Correct |
5 ms |
376 KB |
Output is correct |
7 |
Correct |
5 ms |
504 KB |
Output is correct |
8 |
Correct |
5 ms |
376 KB |
Output is correct |
9 |
Correct |
5 ms |
376 KB |
Output is correct |
10 |
Correct |
5 ms |
376 KB |
Output is correct |
11 |
Correct |
5 ms |
376 KB |
Output is correct |
12 |
Correct |
5 ms |
504 KB |
Output is correct |
13 |
Correct |
5 ms |
504 KB |
Output is correct |
14 |
Correct |
5 ms |
632 KB |
Output is correct |
15 |
Correct |
6 ms |
632 KB |
Output is correct |
16 |
Correct |
5 ms |
632 KB |
Output is correct |
17 |
Correct |
5 ms |
632 KB |
Output is correct |
18 |
Correct |
5 ms |
632 KB |
Output is correct |
19 |
Correct |
5 ms |
760 KB |
Output is correct |
20 |
Correct |
6 ms |
632 KB |
Output is correct |
21 |
Correct |
5 ms |
632 KB |
Output is correct |
22 |
Correct |
5 ms |
760 KB |
Output is correct |
23 |
Correct |
5 ms |
632 KB |
Output is correct |
24 |
Correct |
5 ms |
632 KB |
Output is correct |
25 |
Correct |
5 ms |
632 KB |
Output is correct |
26 |
Correct |
5 ms |
632 KB |
Output is correct |
27 |
Correct |
14 ms |
1784 KB |
Output is correct |
28 |
Correct |
14 ms |
1784 KB |
Output is correct |
29 |
Correct |
16 ms |
1656 KB |
Output is correct |
30 |
Correct |
18 ms |
1656 KB |
Output is correct |
31 |
Correct |
16 ms |
1784 KB |
Output is correct |
32 |
Correct |
17 ms |
1660 KB |
Output is correct |
33 |
Correct |
20 ms |
1784 KB |
Output is correct |
34 |
Correct |
23 ms |
1784 KB |
Output is correct |
35 |
Correct |
22 ms |
1788 KB |
Output is correct |
36 |
Correct |
21 ms |
1656 KB |
Output is correct |
37 |
Correct |
66 ms |
1916 KB |
Output is correct |
38 |
Correct |
45 ms |
1656 KB |
Output is correct |
39 |
Correct |
11 ms |
1784 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1253 ms |
8920 KB |
Output is correct |
2 |
Correct |
1077 ms |
8876 KB |
Output is correct |
3 |
Correct |
1162 ms |
8908 KB |
Output is correct |
4 |
Correct |
1171 ms |
8932 KB |
Output is correct |
5 |
Correct |
1140 ms |
8940 KB |
Output is correct |
6 |
Correct |
874 ms |
8776 KB |
Output is correct |
7 |
Correct |
843 ms |
8956 KB |
Output is correct |
8 |
Correct |
891 ms |
8696 KB |
Output is correct |
9 |
Correct |
836 ms |
8880 KB |
Output is correct |
10 |
Correct |
829 ms |
8828 KB |
Output is correct |
11 |
Correct |
1016 ms |
8952 KB |
Output is correct |
12 |
Execution timed out |
3076 ms |
2936 KB |
Time limit exceeded |
13 |
Halted |
0 ms |
0 KB |
- |