#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
void build(vector<vector<int>>);
struct dsu {
vector<int> p;
vector<int> sz;
int n;
dsu(int _n) : n(_n) {
p.resize(n);
iota(p.begin(), p.end(), 0);
sz.assign(n, 1);
}
inline int get(int x) {
if (p[x] == x) {
return x;
} else {
return p[x] = get(p[x]);
}
}
inline bool unite(int x, int y) {
x = get(x);
y = get(y);
if (x == y) {
return false;
}
if (sz[x] > sz[y]) {
swap(x, y);
}
p[x] = y;
sz[y] += sz[x];
return true;
}
inline bool same(int x, int y) {
return (get(x) == get(y));
}
};
int construct(vector<vector<int>> p) {
int n = (int) p.size();
dsu uf1(n);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (p[i][j] == 1) {
uf1.unite(i, j);
}
}
}
vector<vector<int>> res(n, vector<int>(n));
vector<vector<int>> c(n);
for (int i = 0; i < n; i++) {
int a = uf1.get(i);
if (a < i) {
res[a][i] = res[i][a] = 1;
}
c[a].emplace_back(i);
}
for (int i = 0; i < n; i++) {
for (int x = 0; x < (int) c[i].size(); x++) {
for (int y = x + 1; y < (int) c[i].size(); y++) {
if (p[x][y] != 1) {
return 0;
}
}
}
}
dsu uf2(n);
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (uf1.get(i) == i && uf1.get(j) == j && p[i][j] == 2) {
uf2.unite(i, j);
}
}
}
c = vector<vector<int>>(n);
for (int i = 0; i < n; i++) {
if (uf1.get(i) == i) {
c[uf2.get(i)].emplace_back(i);
}
}
for (int i = 0; i < n; i++) {
int sz = (int) c[i].size();
if (sz == 0 || sz == 1) {
continue;
}
if (sz == 2) {
return 0;
}
for (int j = 0; j < sz; j++) {
res[c[i][j]][c[i][(j + 1) % sz]] = res[c[i][(j + 1) % sz]][c[i][j]] = 1;
}
for (int x = 0; x < sz; x++) {
for (int y = x + 1; y < sz; y++) {
if (p[c[i][x]][c[i][y]] != 2) {
return 0;
}
}
}
}
build(res);
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
224 KB |
Output is correct |
2 |
Incorrect |
1 ms |
248 KB |
Too few ways to get from 0 to 1, should be 1 found 0 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
224 KB |
Output is correct |
2 |
Incorrect |
1 ms |
248 KB |
Too few ways to get from 0 to 1, should be 1 found 0 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
204 KB |
Output is correct |
6 |
Correct |
1 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
9 ms |
1088 KB |
Output is correct |
9 |
Correct |
218 ms |
22016 KB |
Output is correct |
10 |
Correct |
1 ms |
204 KB |
Output is correct |
11 |
Correct |
1 ms |
204 KB |
Output is correct |
12 |
Correct |
11 ms |
1100 KB |
Output is correct |
13 |
Correct |
246 ms |
21984 KB |
Output is correct |
14 |
Correct |
1 ms |
204 KB |
Output is correct |
15 |
Correct |
1 ms |
204 KB |
Output is correct |
16 |
Correct |
6 ms |
788 KB |
Output is correct |
17 |
Correct |
102 ms |
14056 KB |
Output is correct |
18 |
Correct |
1 ms |
292 KB |
Output is correct |
19 |
Correct |
1 ms |
272 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
83 ms |
6196 KB |
Output is correct |
22 |
Correct |
182 ms |
23952 KB |
Output is correct |
23 |
Correct |
213 ms |
24044 KB |
Output is correct |
24 |
Correct |
226 ms |
24008 KB |
Output is correct |
25 |
Correct |
90 ms |
14148 KB |
Output is correct |
26 |
Correct |
116 ms |
14112 KB |
Output is correct |
27 |
Correct |
206 ms |
24040 KB |
Output is correct |
28 |
Correct |
189 ms |
24008 KB |
Output is correct |
29 |
Correct |
99 ms |
14112 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Incorrect |
0 ms |
204 KB |
Answer gives possible 0 while actual possible 1 |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
224 KB |
Output is correct |
2 |
Incorrect |
1 ms |
248 KB |
Too few ways to get from 0 to 1, should be 1 found 0 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
224 KB |
Output is correct |
2 |
Incorrect |
1 ms |
248 KB |
Too few ways to get from 0 to 1, should be 1 found 0 |
3 |
Halted |
0 ms |
0 KB |
- |