結果

問題 No.417 チューリップバブル
ユーザー 37zigen37zigen
提出日時 2016-08-14 00:43:16
言語 Java21
(openjdk 21)
結果
RE  
実行時間 -
コード長 4,651 bytes
コンパイル時間 4,376 ms
コンパイル使用メモリ 81,164 KB
実行使用メモリ 45,552 KB
最終ジャッジ日時 2024-04-25 07:29:28
合計ジャッジ時間 19,751 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 47 ms
36,980 KB
testcase_01 AC 47 ms
36,784 KB
testcase_02 AC 47 ms
36,356 KB
testcase_03 AC 46 ms
36,892 KB
testcase_04 RE -
testcase_05 AC 46 ms
36,496 KB
testcase_06 AC 49 ms
36,932 KB
testcase_07 RE -
testcase_08 AC 111 ms
39,476 KB
testcase_09 AC 240 ms
42,184 KB
testcase_10 AC 225 ms
41,948 KB
testcase_11 AC 394 ms
43,016 KB
testcase_12 AC 396 ms
42,644 KB
testcase_13 RE -
testcase_14 AC 504 ms
43,584 KB
testcase_15 AC 190 ms
42,196 KB
testcase_16 AC 224 ms
41,924 KB
testcase_17 AC 257 ms
43,204 KB
testcase_18 AC 372 ms
43,276 KB
testcase_19 AC 272 ms
43,100 KB
testcase_20 AC 594 ms
41,920 KB
testcase_21 AC 666 ms
44,188 KB
testcase_22 AC 515 ms
41,588 KB
testcase_23 AC 601 ms
41,868 KB
testcase_24 RE -
testcase_25 AC 424 ms
41,736 KB
testcase_26 AC 273 ms
42,780 KB
testcase_27 AC 345 ms
41,208 KB
testcase_28 AC 644 ms
44,596 KB
testcase_29 AC 527 ms
41,944 KB
testcase_30 AC 666 ms
44,588 KB
testcase_31 AC 810 ms
44,436 KB
testcase_32 AC 69 ms
37,628 KB
testcase_33 AC 149 ms
40,848 KB
testcase_34 RE -
testcase_35 AC 779 ms
43,628 KB
testcase_36 AC 1,055 ms
45,552 KB
testcase_37 AC 665 ms
43,488 KB
testcase_38 AC 639 ms
43,340 KB
testcase_39 AC 685 ms
43,008 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) {

		long[] now = new long[m + 1];
		Arrays.fill(now, -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; j <= m; j++) {
					for (int k = 0; k <= m; k++) {
						if (2 * v.time + j + k <= m && d[j] != -1 && now[k] != -1) {
							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;
		}
	}

	class State {
		long u;
		int t;

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

	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