結果

問題 No.768 Tapris and Noel play the game on Treeone
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-12-17 03:56:56
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 4,037 bytes
コンパイル時間 5,539 ms
コンパイル使用メモリ 81,660 KB
実行使用メモリ 75,008 KB
最終ジャッジ日時 2023-10-25 23:26:12
合計ジャッジ時間 16,461 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 80 ms
54,260 KB
testcase_01 AC 81 ms
51,192 KB
testcase_02 AC 80 ms
54,260 KB
testcase_03 AC 112 ms
54,848 KB
testcase_04 AC 119 ms
53,508 KB
testcase_05 AC 109 ms
55,116 KB
testcase_06 AC 108 ms
55,036 KB
testcase_07 AC 523 ms
64,716 KB
testcase_08 AC 379 ms
62,504 KB
testcase_09 AC 424 ms
64,112 KB
testcase_10 AC 359 ms
62,732 KB
testcase_11 AC 723 ms
75,008 KB
testcase_12 AC 727 ms
73,468 KB
testcase_13 AC 710 ms
73,384 KB
testcase_14 AC 748 ms
73,068 KB
testcase_15 AC 773 ms
73,596 KB
testcase_16 AC 749 ms
73,464 KB
testcase_17 AC 764 ms
73,868 KB
testcase_18 TLE -
testcase_19 -- -
testcase_20 -- -
testcase_21 -- -
20evil_special_uni1.txt -- -
20evil_special_uni2.txt -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {


  private static void solve() {
    int n = ni();
    int[] from = new int[n - 1];
    int[] to = new int[n - 1];
    int[] w = new int[n - 1];
    for (int i = 0; i < n - 1; i ++) {
      from[i] = ni() - 1;
      to[i] = ni() - 1;
    }
    int[][][] g = packWU(n, from, to, w);

    int[] ret = new int[n];
    int ptr = 0;
    for (int i = 0; i < n; i ++) {
      if (!dfs(i, -1, g)) {
        ret[ptr ++] = i + 1;
      }
    }
    System.out.println(ptr);
    for (int i = 0; i < ptr; i ++) {
      System.out.println(ret[i]);
    }
  }
  
  private static boolean dfs(int now, int pre, int[][][] g) {
    boolean flg = false;
    for (int[] e : g[now]){
      int next = e[0];
      if (next == pre) {
        continue;
      }

      if (g[next].length == 1) {
        e[1] = 1;
        flg = true;
      } else {
        boolean ret = (e[1] == 0) ? !dfs(next, now, g) : (e[1] == 1);
        e[1] = ret ? 1 : 2;
        flg |= ret;
      }
    }
   
    return flg;
  }
  
  public static int[][][] packWU(int n, int[] from, int[] to, int[] w){ return packWU(n, from, to, w, from.length); }
  public static int[][][] packWU(int n, int[] from, int[] to, int[] w, int sup)
  {
      int[][][] g = new int[n][][];
      int[] p = new int[n];
      for(int i = 0;i < sup;i++)p[from[i]]++;
      for(int i = 0;i < sup;i++)p[to[i]]++;
      for(int i = 0;i < n;i++)g[i] = new int[p[i]][2];
      for(int i = 0;i < sup;i++){
          --p[from[i]];
          g[from[i]][p[from[i]]][0] = to[i];
          g[from[i]][p[from[i]]][1] = w[i];
          --p[to[i]];
          g[to[i]][p[to[i]]][0] = from[i];
          g[to[i]][p[to[i]]][1] = w[i];
      }
      return g;
  }
  
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0