提出 #21903493

---

ソースコード 拡げる

#include <stdio.h>
#include <stdlib.h>

typedef struct edge {
  int op;
  struct edge *next;
} edge;

int func(int v, int i, int *e, edge **p) {
  edge *next = p[i];
  e[i] = v;
  while(next != NULL) {
    int op = next->op;
    if (e[op] < 1) {
      v = func(v+1,op,e,p);
    }
    next = next->next;
  }
  return (v+1);
}

int main () {
  int n = 0;
  int degree[200000] = {};
  int e[200000] = {};
  edge *p[200000] = {};
  
  int res = 0;
  
  int init_node = 0;
  
  res = scanf("%d", &n);
  
  for(int i = 0; i < n - 1; i++) {
    int a = 0;
    int b = 0;
    edge *e_a = (edge *)malloc(sizeof(edge));
    edge *e_b = (edge *)malloc(sizeof(edge));
    res = scanf("%d", &a);
    res = scanf("%d", &b);
    degree[a-1]++;
    degree[b-1]++;
    e_a->op = b-1;
    e_a->next = p[a-1];
    p[a-1] = e_a;
    e_b->op = a-1;
    e_b->next = p[b-1];
    p[b-1] = e_b;
  }
  
  while (degree[init_node] != 1) {
    init_node++;
  }
  
  (void) func(1,init_node,e,p);
  
  for(int i = 0; i < n; i++) {
    printf("%d ", e[i]);
  }
  
  return 0;
}

提出情報

ジャッジ結果