| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 544720 | rainboy | Network (BOI15_net) | C11 | 359 ms | 45840 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 500000
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 qu[N], cnt;
void dfs(int p, int i) {
int o;
if (eo[i] == 1)
qu[cnt++] = i;
for (o = 0; o < eo[i]; o++) {
int j = ej[i][o];
if (j != p)
dfs(i, j);
}
}
int main() {
int n, h, i, j;
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), i--, j--;
append(i, j), append(j, i);
}
i = 0;
while (eo[i] == 1)
i++;
dfs(-1, i);
printf("%d\n", (cnt + 1) / 2);
for (h = 0; h < (cnt + 1) / 2; h++)
printf("%d %d\n", qu[h] + 1, qu[h + cnt / 2] + 1);
return 0;
}Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
