結果
問題 | No.768 Tapris and Noel play the game on Treeone |
ユーザー | uwi |
提出日時 | 2018-12-16 00:04:32 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 317 ms / 2,000 ms |
コード長 | 4,629 bytes |
コンパイル時間 | 4,209 ms |
コンパイル使用メモリ | 86,756 KB |
実行使用メモリ | 51,720 KB |
最終ジャッジ日時 | 2024-09-25 06:19:36 |
合計ジャッジ時間 | 9,960 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
36,956 KB |
testcase_01 | AC | 51 ms
36,680 KB |
testcase_02 | AC | 51 ms
36,792 KB |
testcase_03 | AC | 55 ms
37,116 KB |
testcase_04 | AC | 54 ms
36,776 KB |
testcase_05 | AC | 56 ms
36,904 KB |
testcase_06 | AC | 56 ms
37,140 KB |
testcase_07 | AC | 204 ms
43,860 KB |
testcase_08 | AC | 139 ms
41,620 KB |
testcase_09 | AC | 147 ms
43,960 KB |
testcase_10 | AC | 134 ms
41,120 KB |
testcase_11 | AC | 238 ms
47,036 KB |
testcase_12 | AC | 269 ms
47,400 KB |
testcase_13 | AC | 271 ms
48,460 KB |
testcase_14 | AC | 248 ms
47,540 KB |
testcase_15 | AC | 255 ms
47,056 KB |
testcase_16 | AC | 247 ms
47,312 KB |
testcase_17 | AC | 260 ms
47,844 KB |
testcase_18 | AC | 279 ms
49,448 KB |
testcase_19 | AC | 317 ms
49,016 KB |
testcase_20 | AC | 292 ms
51,720 KB |
testcase_21 | AC | 294 ms
50,984 KB |
20evil_special_uni1.txt | AC | 260 ms
48,356 KB |
20evil_special_uni2.txt | AC | 264 ms
48,412 KB |
ソースコード
package adv2018; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class Day16 { InputStream is; PrintWriter out; String INPUT = ""; 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; } int[][] g = packU(n, from, to); int[][] pars = parents3(g, 0); int[] par = pars[0], ord = pars[1], dep = pars[2]; int[] dp = new int[n]; for(int i = n-1;i >= 0;i--){ int cur = ord[i]; for(int e : g[cur]){ if(par[cur] == e)continue; if(dp[e] == 0){ dp[cur]++; } } } for(int i = 1;i < n;i++){ int cur = ord[i]; int p = par[cur]; int vp = dp[p] - (dp[cur] == 0 ? 1 : 0); if(vp == 0){ dp[cur]++; } } int ans = 0; for(int i = 0;i < n;i++){ if(dp[i] == 0){ ans++; } } out.println(ans); for(int i = 0;i < n;i++){ if(dp[i] == 0)out.println(i+1); } } public static int[][] parents3(int[][] g, int root) { int n = g.length; int[] par = new int[n]; Arrays.fill(par, -1); int[] depth = new int[n]; depth[0] = 0; int[] q = new int[n]; q[0] = root; for (int p = 0, r = 1; p < r; p++) { int cur = q[p]; for (int nex : g[cur]) { if (par[cur] != nex) { q[r++] = nex; par[nex] = cur; depth[nex] = depth[cur] + 1; } } } return new int[][] { par, q, depth }; } 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; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new Day16().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }