結果
問題 | No.417 チューリップバブル |
ユーザー | uwi |
提出日時 | 2016-08-27 00:34:04 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 497 ms / 2,000 ms |
コード長 | 4,654 bytes |
コンパイル時間 | 4,661 ms |
コンパイル使用メモリ | 83,596 KB |
実行使用メモリ | 41,788 KB |
最終ジャッジ日時 | 2024-04-26 04:55:53 |
合計ジャッジ時間 | 13,055 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
38,180 KB |
testcase_01 | AC | 64 ms
38,396 KB |
testcase_02 | AC | 63 ms
38,044 KB |
testcase_03 | AC | 62 ms
38,060 KB |
testcase_04 | AC | 62 ms
37,796 KB |
testcase_05 | AC | 62 ms
37,480 KB |
testcase_06 | AC | 64 ms
38,012 KB |
testcase_07 | AC | 63 ms
37,860 KB |
testcase_08 | AC | 104 ms
40,280 KB |
testcase_09 | AC | 117 ms
40,336 KB |
testcase_10 | AC | 120 ms
40,300 KB |
testcase_11 | AC | 176 ms
40,288 KB |
testcase_12 | AC | 170 ms
40,388 KB |
testcase_13 | AC | 126 ms
40,024 KB |
testcase_14 | AC | 199 ms
40,532 KB |
testcase_15 | AC | 113 ms
40,232 KB |
testcase_16 | AC | 112 ms
40,288 KB |
testcase_17 | AC | 154 ms
40,748 KB |
testcase_18 | AC | 148 ms
40,716 KB |
testcase_19 | AC | 153 ms
40,232 KB |
testcase_20 | AC | 307 ms
40,980 KB |
testcase_21 | AC | 307 ms
40,944 KB |
testcase_22 | AC | 311 ms
40,440 KB |
testcase_23 | AC | 314 ms
41,104 KB |
testcase_24 | AC | 62 ms
37,976 KB |
testcase_25 | AC | 288 ms
40,584 KB |
testcase_26 | AC | 123 ms
40,496 KB |
testcase_27 | AC | 233 ms
40,548 KB |
testcase_28 | AC | 286 ms
40,932 KB |
testcase_29 | AC | 284 ms
40,804 KB |
testcase_30 | AC | 311 ms
41,204 KB |
testcase_31 | AC | 285 ms
41,040 KB |
testcase_32 | AC | 62 ms
38,308 KB |
testcase_33 | AC | 100 ms
40,156 KB |
testcase_34 | AC | 156 ms
40,528 KB |
testcase_35 | AC | 454 ms
41,404 KB |
testcase_36 | AC | 442 ms
41,788 KB |
testcase_37 | AC | 468 ms
41,676 KB |
testcase_38 | AC | 473 ms
41,712 KB |
testcase_39 | AC | 497 ms
41,712 KB |
ソースコード
package q4xx; 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 N417 { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), limit = ni(); int[] a = na(n); 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(); to[i] = ni(); w[i] = ni(); } int[][][] g = packWU(n, from, to, w); int[][] pars = parents(g, 0); int[] par = pars[0], ord = pars[1], dep = pars[2]; long[][] dp = new long[n][limit/2+1]; for(int i = n-1;i >= 0;i--){ int cur = ord[i]; Arrays.fill(dp[cur], Long.MIN_VALUE / 3); dp[cur][0] = a[cur]; for(int[] e : g[cur]){ if(par[cur] != e[0]){ for(int j = limit/2;j >= 0;j--){ for(int k = 0;j+k+e[1] <= limit/2;k++){ dp[cur][j+k+e[1]] = Math.max(dp[cur][j+k+e[1]], dp[cur][j] + dp[e[0]][k]); } } } } } out.println(Arrays.stream(dp[0]).max().getAsLong()); } public static int[][] parents(int[][][] g, int root) { int n = g.length; int[] par = new int[n]; Arrays.fill(par, -1); int[] dw = new int[n]; int[] pw = new int[n]; int[] dep = new int[n]; 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[0]) { q[r++] = nex[0]; par[nex[0]] = cur; dep[nex[0]] = dep[cur] + 1; dw[nex[0]] = dw[cur] + nex[1]; pw[nex[0]] = nex[1]; } } } return new int[][] { par, q, dep, dw, pw }; } public static int[][][] packWU(int n, int[] from, int[] to, int[] w) { 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]][2]; for (int i = 0; i < from.length; 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; } 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"); } public static void main(String[] args) throws Exception { new N417().run(); } private byte[] inbuf = new byte[1024]; private 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 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[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, 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 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)); } }