結果

問題 No.1582 Vertexes vs Edges
ユーザー hiromi_ayasehiromi_ayase
提出日時 2021-07-03 00:04:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 313 ms / 2,000 ms
コード長 3,439 bytes
コンパイル時間 3,530 ms
コンパイル使用メモリ 93,692 KB
実行使用メモリ 61,116 KB
最終ジャッジ日時 2024-06-29 13:36:01
合計ジャッジ時間 13,040 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 78 ms
50,956 KB
testcase_01 AC 77 ms
50,916 KB
testcase_02 AC 76 ms
51,292 KB
testcase_03 AC 81 ms
51,276 KB
testcase_04 AC 119 ms
52,512 KB
testcase_05 AC 280 ms
58,540 KB
testcase_06 AC 146 ms
53,180 KB
testcase_07 AC 167 ms
56,572 KB
testcase_08 AC 224 ms
56,320 KB
testcase_09 AC 278 ms
60,560 KB
testcase_10 AC 229 ms
57,512 KB
testcase_11 AC 142 ms
55,300 KB
testcase_12 AC 205 ms
55,924 KB
testcase_13 AC 245 ms
57,600 KB
testcase_14 AC 245 ms
57,588 KB
testcase_15 AC 281 ms
60,640 KB
testcase_16 AC 212 ms
56,788 KB
testcase_17 AC 237 ms
57,048 KB
testcase_18 AC 303 ms
60,728 KB
testcase_19 AC 244 ms
57,588 KB
testcase_20 AC 230 ms
57,752 KB
testcase_21 AC 220 ms
56,964 KB
testcase_22 AC 277 ms
60,716 KB
testcase_23 AC 199 ms
56,060 KB
testcase_24 AC 174 ms
57,052 KB
testcase_25 AC 225 ms
57,056 KB
testcase_26 AC 209 ms
56,996 KB
testcase_27 AC 261 ms
58,540 KB
testcase_28 AC 181 ms
56,080 KB
testcase_29 AC 256 ms
59,816 KB
testcase_30 AC 222 ms
56,128 KB
testcase_31 AC 256 ms
58,076 KB
testcase_32 AC 199 ms
56,064 KB
testcase_33 AC 300 ms
61,116 KB
testcase_34 AC 300 ms
60,948 KB
testcase_35 AC 313 ms
60,752 KB
testcase_36 AC 77 ms
51,292 KB
testcase_37 AC 77 ms
50,940 KB
testcase_38 AC 76 ms
50,828 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;

@SuppressWarnings("unused")
public class Main {

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

    int[] ret = new int[n];
    dfs(0, -1, g, ret);
    int cnt = 0;
    for (int v : ret) {
      if (v == 1) cnt ++;
    }
    System.out.println(cnt);
  }

  private static void dfs(int cur, int pre, int[][] g, int[] ret) {
    for (int nex : g[cur]) {
      if (nex == pre)
        continue;

      dfs(nex, cur, g, ret);
      if (ret[nex] == 0) {
        ret[cur] = 1;
      }
    }
  }

  private static int[][] packU(int n, int[] from, int[] to) {
    int[][] g = new int[n][];
    int[] p = new int[n];
    for (int f : from)
      p[f]++;
    for (int t : to)
      p[t]++;
    for (int i = 0; i < n; i++)
      g[i] = new int[p[i]];
    for (int i = 0; i < from.length; i++) {
      g[from[i]][--p[from[i]]] = to[i];
      g[to[i]][--p[to[i]]] = from[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