# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1073104 | rainboy | Infiltration (CCO24_day2problem1) | C11 | 6 ms | 1624 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <stdlib.h>
#define N 100
#define M 1440
int max(int a, int b) { return a > b ? a : b; }
int *ej[N], eo[N];
void append(int i, int j) {
int o = eo[i]++;
if (o >= 2 && (o & o - 1) == 0)
ej[i] = (int *) realloc(ej[i], o * 2 * sizeof *ej[i]);
ej[i][o] = j;
}
int pp[N];
void dfs(int p, int i) {
int o;
pp[i] = p;
for (o = eo[i]; o--; ) {
int j = ej[i][o];
if (j != p)
dfs(i, j);
}
}
int main() {
static int iii[2][N][M + 1], mm[2][N];
int n, m, h, i, j, t, l, d;
scanf("%d", &n);
for (i = 0; i < n; i++)
ej[i] = (int *) malloc(2 * sizeof *ej[i]);
for (h = 0; h < n - 1; h++) {
scanf("%d%d", &i, &j);
append(i, j), append(j, i);
}
dfs(-1, 0);
m = 0;
for (t = 0; t < 2; t++) {
for (i = 0; i < n; i++) {
mm[t][i] = 0, iii[t][i][mm[t][i]] = j = i, l = 0;
for (l = 0; j != 0; l++) {
d = l == 0 ? 1 : 3 << l - 1;
if (l % 2 == t)
for (h = 0; h < d && j != 0; h++)
iii[t][i][++mm[t][i]] = j = pp[j];
else
for (h = 0; h < d; h++)
iii[t][i][++mm[t][i]] = j;
}
m = max(m, mm[t][i]);
}
}
printf("%d\n", m * 2);
for (t = 0; t < 2; t++)
for (i = 0; i < n; i++)
for (h = 1; h <= m * 2; h++)
printf("%d%c", iii[t][i][(h + 1 - t) / 2], h < m * 2 ? ' ' : '\n');
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |