結果

問題 No.417 チューリップバブル
ユーザー 37zigen37zigen
提出日時 2016-08-14 00:59:25
言語 Java21
(openjdk 21)
結果
AC  
実行時間 559 ms / 2,000 ms
コード長 4,571 bytes
コンパイル時間 4,231 ms
コンパイル使用メモリ 81,892 KB
実行使用メモリ 44,228 KB
最終ジャッジ日時 2024-11-07 17:51:32
合計ジャッジ時間 14,641 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
36,500 KB
testcase_01 AC 57 ms
36,624 KB
testcase_02 AC 55 ms
36,624 KB
testcase_03 AC 56 ms
36,712 KB
testcase_04 AC 57 ms
36,504 KB
testcase_05 AC 55 ms
36,968 KB
testcase_06 AC 58 ms
36,492 KB
testcase_07 AC 57 ms
37,048 KB
testcase_08 AC 101 ms
39,232 KB
testcase_09 AC 132 ms
40,224 KB
testcase_10 AC 138 ms
40,584 KB
testcase_11 AC 191 ms
41,164 KB
testcase_12 AC 205 ms
41,380 KB
testcase_13 AC 125 ms
40,520 KB
testcase_14 AC 227 ms
41,516 KB
testcase_15 AC 110 ms
40,132 KB
testcase_16 AC 168 ms
40,544 KB
testcase_17 AC 191 ms
41,652 KB
testcase_18 AC 188 ms
41,736 KB
testcase_19 AC 193 ms
41,656 KB
testcase_20 AC 353 ms
43,104 KB
testcase_21 AC 380 ms
42,960 KB
testcase_22 AC 288 ms
42,756 KB
testcase_23 AC 325 ms
41,716 KB
testcase_24 AC 55 ms
37,000 KB
testcase_25 AC 328 ms
41,720 KB
testcase_26 AC 144 ms
41,232 KB
testcase_27 AC 260 ms
42,220 KB
testcase_28 AC 343 ms
43,364 KB
testcase_29 AC 342 ms
41,892 KB
testcase_30 AC 330 ms
43,052 KB
testcase_31 AC 361 ms
43,156 KB
testcase_32 AC 56 ms
36,916 KB
testcase_33 AC 108 ms
39,804 KB
testcase_34 AC 162 ms
40,296 KB
testcase_35 AC 524 ms
42,516 KB
testcase_36 AC 555 ms
44,228 KB
testcase_37 AC 506 ms
43,140 KB
testcase_38 AC 530 ms
42,856 KB
testcase_39 AC 559 ms
42,904 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;

public class チューリップバブル {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";

	class Pair {
		long u;
		int t;

		Pair(long u, int t) {
			this.u = u;
			this.t = t;
		}
	}

	void solver() {

		int n = ni();// 村の数
		int m = ni();// 残り時間

		long[] u = new long[n];
		for (int i = 0; i < n; i++) {
			u[i] = nl();// 税収
		}

		ArrayList<Edge>[] e = new ArrayList[n];
		for (int i = 0; i < n; i++) {
			e[i] = new ArrayList<>();
		}
		for (int i = 0; i < n - 1; i++) {
			int a = ni();
			int b = ni();
			int c = ni();
			e[a].add(new Edge(c, a, b));
			e[b].add(new Edge(c, b, a));
		}

		long[] list = dfs(-1, 0, e, u, m);
		long ans = 0;
		for (int i = 0; i <= m; i++) {
			ans = Math.max(ans, list[i]);
		}

		out.println(ans);
	}

	long[] dfs(int p, int cur, ArrayList<Edge>[] e, long[] u, int m) {
		if (m < 0) {
			return new long[0];
		}
		long[] now = new long[m + 1];
		now[0] = u[cur];
		for (int i = 0; i < e[cur].size(); i++) {
			Edge v = e[cur].get(i);
			if (v.to != p) {
				long[] d = dfs(cur, v.to, e, u, m - 2 * v.time);
				long[] next = Arrays.copyOf(now, now.length);
				for (int j = 0; 2 * v.time + j <= m; j++) {
					for (int k = 0; 2 * v.time + j + k <= m; k++) {
						if (d[j] != 0 && now[k] != 0) {
							if (next[2 * v.time + j + k] < d[j] + now[k]) {
								next[2 * v.time + j + k] = d[j] + now[k];
							}
						}
					}
				}
				now = next;
			}
		}
		return now;
	}

	static class Edge {
		int time;
		int from;
		int to;

		Edge(int time, int from, int to) {
			this.time = time;
			this.from = from;
			this.to = to;
		}
	}

	public static void main(String[] args) throws Exception {
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		long t = System.currentTimeMillis();
		new チューリップバブル().solver();
		System.err.println(System.currentTimeMillis() - t);
		out.flush();
	}

	static void tr(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

	static long nl() {
		try {
			long num = 0;
			boolean minus = false;
			while ((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'))
				;
			if (num == '-') {
				num = 0;
				minus = true;
			} else {
				num -= '0';
			}

			while (true) {
				int b = is.read();
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}

	static char nc() {
		try {
			int b = skip();
			if (b == -1)
				return 0;
			return (char) b;
		} catch (IOException e) {
		}
		return 0;
	}

	static double nd() {
		try {
			return Double.parseDouble(ns());
		} catch (Exception e) {
		}
		return 0;
	}

	static String ns() {
		try {
			int b = skip();
			StringBuilder sb = new StringBuilder();
			if (b == -1)
				return "";
			sb.append((char) b);
			while (true) {
				b = is.read();
				if (b == -1)
					return sb.toString();
				if (b <= ' ')
					return sb.toString();
				sb.append((char) b);
			}
		} catch (IOException e) {
		}
		return "";
	}

	public static char[] ns(int n) {
		char[] buf = new char[n];
		try {
			int b = skip(), p = 0;
			if (b == -1)
				return null;
			buf[p++] = (char) b;
			while (p < n) {
				b = is.read();
				if (b == -1 || b <= ' ')
					break;
				buf[p++] = (char) b;
			}
			return Arrays.copyOf(buf, p);
		} catch (IOException e) {
		}
		return null;
	}

	public static byte[] nse(int n) {
		byte[] buf = new byte[n];
		try {
			int b = skip();
			if (b == -1)
				return null;
			is.read(buf);
			return buf;
		} catch (IOException e) {
		}
		return null;
	}

	static int skip() throws IOException {
		int b;
		while ((b = is.read()) != -1 && !(b >= 33 && b <= 126))
			;
		return b;
	}

	static boolean eof() {
		try {
			is.mark(1000);
			int b = skip();
			is.reset();
			return b == -1;
		} catch (IOException e) {
			return true;
		}
	}

	static int ni() {
		try {
			int num = 0;
			boolean minus = false;
			while ((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'))
				;
			if (num == '-') {
				num = 0;
				minus = true;
			} else {
				num -= '0';
			}

			while (true) {
				int b = is.read();
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}
}
0