#include "supertrees.h"
#include <string.h>
using namespace std;
typedef vector<int> vi;
const int N = 1000;
int abs_(int a) { return a > 0 ? a : -a; }
int ds[N];
int find(int i) {
return ds[i] < 0 ? i : (ds[i] = find(ds[i]));
}
void join(int i, int j) {
i = find(i);
j = find(j);
if (i == j)
return;
if (ds[i] > ds[j])
ds[i] = j;
else {
if (ds[i] == ds[j])
ds[i]--;
ds[j] = i;
}
}
int construct(vector<vi> pp) {
int n = pp.size(), i, j, k;
vector<vi> aa(n);
for (i = 0; i < n; i++)
aa[i].resize(n);
memset(ds, -1, n * sizeof *ds);
memset(ds, -1, n * sizeof *ds);
for (i = 0; i < n; i++)
for (j = i + 1; j < n; j++)
if (pp[i][j] == 1)
join(i, j);
for (i = 0; i < n; i++)
for (j = i + 1; j < n; j++)
if ((find(i) == find(j)) != (pp[i][j] == 1))
return 0;
for (i = 0; i < n; i++)
if ((j = find(i)) != i)
aa[i][j] = aa[j][i] = 1;
for (i = 0; i < n; i++)
for (j = i + 1; j < n; j++)
if (pp[i][j] == 2)
join(i, j);
for (i = 0; i < n; i++)
for (j = i + 1; j < n; j++)
if ((find(i) == find(j)) != (pp[i][j] == 2))
return 0;
for (i = 0; i < n; i++)
if (ds[i] < 0) {
k = i;
for (j = 0; j < n; j++)
if (j != i && find(j) == i)
aa[j][k] = aa[k][j] = 1, k = j;
if (k != i)
aa[i][k] = aa[k][i] = 1, k = j;
}
build(aa);
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Answer gives possible 0 while actual possible 1 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Answer gives possible 0 while actual possible 1 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
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 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Incorrect |
0 ms |
204 KB |
Answer gives possible 1 while actual possible 0 |
5 |
Halted |
0 ms |
0 KB |
- |
# |
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 |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Answer gives possible 0 while actual possible 1 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Incorrect |
0 ms |
204 KB |
Answer gives possible 0 while actual possible 1 |
3 |
Halted |
0 ms |
0 KB |
- |