結果
問題 | No.1582 Vertexes vs Edges |
ユーザー | hiromi_ayase |
提出日時 | 2021-07-03 00:04:23 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 327 ms / 2,000 ms |
コード長 | 3,439 bytes |
コンパイル時間 | 2,506 ms |
コンパイル使用メモリ | 83,320 KB |
実行使用メモリ | 61,452 KB |
最終ジャッジ日時 | 2023-09-12 00:25:16 |
合計ジャッジ時間 | 12,906 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 75 ms
50,824 KB |
testcase_01 | AC | 72 ms
50,688 KB |
testcase_02 | AC | 71 ms
50,904 KB |
testcase_03 | AC | 75 ms
51,312 KB |
testcase_04 | AC | 122 ms
53,432 KB |
testcase_05 | AC | 282 ms
59,372 KB |
testcase_06 | AC | 139 ms
53,436 KB |
testcase_07 | AC | 160 ms
56,724 KB |
testcase_08 | AC | 231 ms
57,156 KB |
testcase_09 | AC | 288 ms
61,168 KB |
testcase_10 | AC | 241 ms
58,464 KB |
testcase_11 | AC | 138 ms
55,652 KB |
testcase_12 | AC | 215 ms
56,784 KB |
testcase_13 | AC | 252 ms
57,884 KB |
testcase_14 | AC | 254 ms
58,364 KB |
testcase_15 | AC | 282 ms
60,844 KB |
testcase_16 | AC | 217 ms
57,996 KB |
testcase_17 | AC | 248 ms
58,592 KB |
testcase_18 | AC | 306 ms
58,980 KB |
testcase_19 | AC | 253 ms
58,104 KB |
testcase_20 | AC | 236 ms
58,024 KB |
testcase_21 | AC | 240 ms
58,688 KB |
testcase_22 | AC | 276 ms
59,468 KB |
testcase_23 | AC | 201 ms
58,128 KB |
testcase_24 | AC | 175 ms
57,164 KB |
testcase_25 | AC | 225 ms
57,932 KB |
testcase_26 | AC | 218 ms
57,832 KB |
testcase_27 | AC | 280 ms
59,248 KB |
testcase_28 | AC | 197 ms
57,196 KB |
testcase_29 | AC | 270 ms
60,744 KB |
testcase_30 | AC | 232 ms
58,180 KB |
testcase_31 | AC | 262 ms
59,368 KB |
testcase_32 | AC | 205 ms
57,216 KB |
testcase_33 | AC | 319 ms
61,452 KB |
testcase_34 | AC | 327 ms
61,252 KB |
testcase_35 | AC | 319 ms
61,028 KB |
testcase_36 | AC | 73 ms
50,992 KB |
testcase_37 | AC | 73 ms
50,696 KB |
testcase_38 | AC | 75 ms
50,932 KB |
ソースコード
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)); } }