結果

問題 No.417 チューリップバブル
ユーザー GrenacheGrenache
提出日時 2017-01-08 19:23:02
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,255 ms / 2,000 ms
コード長 5,264 bytes
コンパイル時間 4,223 ms
コンパイル使用メモリ 81,516 KB
実行使用メモリ 55,348 KB
最終ジャッジ日時 2024-12-17 18:14:52
合計ジャッジ時間 22,526 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
50,528 KB
testcase_01 AC 56 ms
50,304 KB
testcase_02 AC 53 ms
50,140 KB
testcase_03 AC 53 ms
50,244 KB
testcase_04 AC 52 ms
50,112 KB
testcase_05 AC 52 ms
50,084 KB
testcase_06 AC 56 ms
50,292 KB
testcase_07 AC 55 ms
50,308 KB
testcase_08 AC 106 ms
54,112 KB
testcase_09 AC 162 ms
54,912 KB
testcase_10 AC 162 ms
55,036 KB
testcase_11 AC 307 ms
55,048 KB
testcase_12 AC 297 ms
54,932 KB
testcase_13 AC 187 ms
54,340 KB
testcase_14 AC 405 ms
55,328 KB
testcase_15 AC 150 ms
55,036 KB
testcase_16 AC 136 ms
54,732 KB
testcase_17 AC 259 ms
54,980 KB
testcase_18 AC 275 ms
54,964 KB
testcase_19 AC 278 ms
55,184 KB
testcase_20 AC 680 ms
55,268 KB
testcase_21 AC 687 ms
55,296 KB
testcase_22 AC 685 ms
55,324 KB
testcase_23 AC 702 ms
55,204 KB
testcase_24 AC 56 ms
50,528 KB
testcase_25 AC 692 ms
54,580 KB
testcase_26 AC 153 ms
54,136 KB
testcase_27 AC 521 ms
55,348 KB
testcase_28 AC 679 ms
55,192 KB
testcase_29 AC 683 ms
55,192 KB
testcase_30 AC 678 ms
55,084 KB
testcase_31 AC 669 ms
54,712 KB
testcase_32 AC 55 ms
50,440 KB
testcase_33 AC 125 ms
53,788 KB
testcase_34 AC 244 ms
54,464 KB
testcase_35 AC 1,244 ms
54,832 KB
testcase_36 AC 1,222 ms
54,916 KB
testcase_37 AC 1,226 ms
54,808 KB
testcase_38 AC 1,225 ms
53,996 KB
testcase_39 AC 1,255 ms
54,640 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;


public class Main_yukicoder417 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int m = sc.nextInt();

		int[] u = new int[n];
		for (int i = 0; i < n; i++) {
			u[i] = sc.nextInt();
		}

		List<List<Edge>> edges = new ArrayList<>();
		for (int i = 0; i < n; i++) {
			edges.add(new ArrayList<>());
		}

		for (int i = 0; i < n - 1; i++) {
			int a = sc.nextInt();
			int b = sc.nextInt();
			int c = sc.nextInt();

			edges.get(a).add(new Edge(a, b, c));
			edges.get(b).add(new Edge(b, a, c));
		}

		boolean[] used = new boolean[n];
		int[] p = new int[n];
		Arrays.fill(p, -1);
		p[0] = 0;
		int[][] dp = new int[n][m + 1];

		Deque<Integer> st = new ArrayDeque<>();
		st.push(0);
		while (!st.isEmpty()) {
			int e = st.peek();

			if (used[e]) {
				st.pop();
				Arrays.fill(dp[e], u[e]);

				for (Edge next : edges.get(e)) {
					if (next.v != p[e]) {
						for (int i = m; i - next.w * 2 >= 0; i--) {
							for (int j = 0; i - next.w * 2 - j >= 0; j++) {
								dp[e][i] = Math.max(dp[e][i], dp[e][i - next.w * 2 - j] + dp[next.v][j]);
							}
						}
					}
				}

				continue;
			}

			for (Edge next : edges.get(e)) {
				if (next.v != p[e]) {
					st.push(next.v);
					p[next.v] = e;
				}
			}
			used[e] = true;
		}

		pr.println(dp[0][m]);
	}

	private static class Edge {
		@SuppressWarnings("unused")
		int u; // from
		int v; // to
		int w; // cost

		Edge(int u, int v, int w) {
			this.u = u;
			this.v = v;
			this.w = w;
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0