提出 #22350913

---

ソースコード 拡げる

#include <stdio.h>

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

void func(int v, int d, list **e, int *visited, int *depth, int *count_alt) {
  list *l = e[v-1];
  
  if (visited[v-1] > 0) {
    return;
  }
  
  visited[v-1] = 1;
  depth[v-1] = d;
  count_alt[d%2]++;
  
  while(l != NULL) {
    func(l->op, d+1, e, visited, depth, count_alt);
    l = l->next;
  }
  
  return;
}

int main () {
  int n = 0;
  
  int res = 0;
  
  list *e[100000] = {};
  list pool[200000] = {};
  int used = 0;
  
  int visited[100000] = {};
  int depth[100000] = {};
  int count_alt[2] = {};
  int print_count = 0;
  
  int alt = 0;
  
  res = scanf("%d", &n);
  
  for (int i = 0; i < n-1; i++) {
    int a = 0;
    int b = 0;
    
    res = scanf("%d", &a);
    res = scanf("%d", &b);
    
    pool[used].op = b;
    pool[used].next = e[a-1];
    e[a-1] = pool+used;
    used++;
    
    pool[used].op = a;
    pool[used].next = e[b-1];
    e[b-1] = pool+used;
    used++;
  }
  
  func(1, 1, e, visited, depth, count_alt);
  
  if (count_alt[0] < count_alt[1]) {
    alt = 1;
  }
  
  for(int i = 0; i < n; i++) {
    if (depth[i] % 2 == alt) {
      print_count++;
      if (print_count < n / 2) {
        printf("%d ", i+1);
      } else if (print_count == n / 2) {
        printf("%d\n", i+1);
      }
    }
  }
  
  return 0;
}

提出情報

ジャッジ結果