#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);
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;
memset(ds, -1, n * sizeof *ds);
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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
10 ms |
1100 KB |
Output is correct |
7 |
Correct |
238 ms |
22048 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
10 ms |
1100 KB |
Output is correct |
7 |
Correct |
238 ms |
22048 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
10 ms |
1100 KB |
Output is correct |
13 |
Correct |
238 ms |
22064 KB |
Output is correct |
14 |
Correct |
0 ms |
204 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
5 ms |
716 KB |
Output is correct |
17 |
Correct |
112 ms |
12156 KB |
Output is correct |
18 |
Correct |
0 ms |
332 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
59 ms |
5808 KB |
Output is correct |
21 |
Correct |
249 ms |
22164 KB |
Output is correct |
22 |
Correct |
233 ms |
22172 KB |
Output is correct |
23 |
Correct |
246 ms |
22120 KB |
Output is correct |
24 |
Correct |
233 ms |
22172 KB |
Output is correct |
25 |
Correct |
108 ms |
12284 KB |
Output is correct |
26 |
Correct |
101 ms |
12160 KB |
Output is correct |
27 |
Correct |
246 ms |
22176 KB |
Output is correct |
28 |
Correct |
238 ms |
22104 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 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 |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
60 ms |
6112 KB |
Output is correct |
5 |
Correct |
240 ms |
24020 KB |
Output is correct |
6 |
Correct |
233 ms |
24004 KB |
Output is correct |
7 |
Correct |
247 ms |
23996 KB |
Output is correct |
8 |
Correct |
1 ms |
204 KB |
Output is correct |
9 |
Correct |
60 ms |
6120 KB |
Output is correct |
10 |
Correct |
251 ms |
23924 KB |
Output is correct |
11 |
Correct |
231 ms |
23912 KB |
Output is correct |
12 |
Correct |
245 ms |
23916 KB |
Output is correct |
13 |
Correct |
0 ms |
204 KB |
Output is correct |
14 |
Correct |
0 ms |
204 KB |
Output is correct |
15 |
Incorrect |
1 ms |
204 KB |
Answer gives possible 0 while actual possible 1 |
16 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
10 ms |
1100 KB |
Output is correct |
7 |
Correct |
238 ms |
22048 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
10 ms |
1100 KB |
Output is correct |
13 |
Correct |
238 ms |
22064 KB |
Output is correct |
14 |
Correct |
0 ms |
204 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
5 ms |
716 KB |
Output is correct |
17 |
Correct |
112 ms |
12156 KB |
Output is correct |
18 |
Correct |
0 ms |
332 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
59 ms |
5808 KB |
Output is correct |
21 |
Correct |
249 ms |
22164 KB |
Output is correct |
22 |
Correct |
233 ms |
22172 KB |
Output is correct |
23 |
Correct |
246 ms |
22120 KB |
Output is correct |
24 |
Correct |
233 ms |
22172 KB |
Output is correct |
25 |
Correct |
108 ms |
12284 KB |
Output is correct |
26 |
Correct |
101 ms |
12160 KB |
Output is correct |
27 |
Correct |
246 ms |
22176 KB |
Output is correct |
28 |
Correct |
238 ms |
22104 KB |
Output is correct |
29 |
Correct |
0 ms |
204 KB |
Output is correct |
30 |
Correct |
0 ms |
204 KB |
Output is correct |
31 |
Correct |
0 ms |
204 KB |
Output is correct |
32 |
Incorrect |
0 ms |
204 KB |
Answer gives possible 1 while actual possible 0 |
33 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
10 ms |
1100 KB |
Output is correct |
7 |
Correct |
238 ms |
22048 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |
11 |
Correct |
0 ms |
204 KB |
Output is correct |
12 |
Correct |
10 ms |
1100 KB |
Output is correct |
13 |
Correct |
238 ms |
22064 KB |
Output is correct |
14 |
Correct |
0 ms |
204 KB |
Output is correct |
15 |
Correct |
0 ms |
204 KB |
Output is correct |
16 |
Correct |
5 ms |
716 KB |
Output is correct |
17 |
Correct |
112 ms |
12156 KB |
Output is correct |
18 |
Correct |
0 ms |
332 KB |
Output is correct |
19 |
Correct |
0 ms |
204 KB |
Output is correct |
20 |
Correct |
59 ms |
5808 KB |
Output is correct |
21 |
Correct |
249 ms |
22164 KB |
Output is correct |
22 |
Correct |
233 ms |
22172 KB |
Output is correct |
23 |
Correct |
246 ms |
22120 KB |
Output is correct |
24 |
Correct |
233 ms |
22172 KB |
Output is correct |
25 |
Correct |
108 ms |
12284 KB |
Output is correct |
26 |
Correct |
101 ms |
12160 KB |
Output is correct |
27 |
Correct |
246 ms |
22176 KB |
Output is correct |
28 |
Correct |
238 ms |
22104 KB |
Output is correct |
29 |
Correct |
0 ms |
204 KB |
Output is correct |
30 |
Correct |
0 ms |
204 KB |
Output is correct |
31 |
Correct |
0 ms |
204 KB |
Output is correct |
32 |
Incorrect |
0 ms |
204 KB |
Answer gives possible 1 while actual possible 0 |
33 |
Halted |
0 ms |
0 KB |
- |