#include <stdio.h>
#include <stdlib.h>
#define N 100
#define M (N * 4)
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;
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++)
if (l % 2 == t)
for (h = 0; h < 1 << l && j != 0; h++)
iii[t][i][++mm[t][i]] = j = pp[j];
else
for (h = 0; h < 1 << l; 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 = 0; h <= m * 2; h++)
printf("%d%c", iii[t][i][(h + t) / 2], h < m * 2 ? ' ' : '\n');
return 0;
}
Compilation message
Main.c: In function 'append':
Main.c:14:23: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
14 | if (o >= 2 && (o & o - 1) == 0)
| ~~^~~
Main.c: In function 'main':
Main.c:37:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | scanf("%d", &n);
| ^~~~~~~~~~~~~~~
Main.c:41:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
41 | scanf("%d%d", &i, &j);
| ^~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
4 ms |
860 KB |
Extra tokens on line |
| 2 |
Halted |
0 ms |
0 KB |
- |
