結果

問題 No.417 チューリップバブル
ユーザー hiro116shiro116s
提出日時 2016-08-27 00:00:26
言語 Java19
(openjdk 21)
結果
AC  
実行時間 594 ms / 2,000 ms
コード長 5,015 bytes
コンパイル時間 2,538 ms
コンパイル使用メモリ 78,516 KB
実行使用メモリ 58,368 KB
最終ジャッジ日時 2023-08-08 11:05:04
合計ジャッジ時間 13,047 ms
ジャッジサーバーID
(参考情報)
judge11 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
51,224 KB
testcase_01 AC 44 ms
51,440 KB
testcase_02 AC 44 ms
51,436 KB
testcase_03 AC 44 ms
51,432 KB
testcase_04 AC 45 ms
51,236 KB
testcase_05 AC 43 ms
51,296 KB
testcase_06 AC 45 ms
52,016 KB
testcase_07 AC 45 ms
51,512 KB
testcase_08 AC 93 ms
55,484 KB
testcase_09 AC 141 ms
56,080 KB
testcase_10 AC 151 ms
55,912 KB
testcase_11 AC 216 ms
56,152 KB
testcase_12 AC 239 ms
56,180 KB
testcase_13 AC 106 ms
55,784 KB
testcase_14 AC 238 ms
56,284 KB
testcase_15 AC 116 ms
56,004 KB
testcase_16 AC 119 ms
55,764 KB
testcase_17 AC 157 ms
55,692 KB
testcase_18 AC 210 ms
56,192 KB
testcase_19 AC 164 ms
55,480 KB
testcase_20 AC 287 ms
54,388 KB
testcase_21 AC 379 ms
54,116 KB
testcase_22 AC 294 ms
56,092 KB
testcase_23 AC 355 ms
55,496 KB
testcase_24 AC 52 ms
52,164 KB
testcase_25 AC 319 ms
55,704 KB
testcase_26 AC 156 ms
56,032 KB
testcase_27 AC 257 ms
55,800 KB
testcase_28 AC 383 ms
55,836 KB
testcase_29 AC 317 ms
55,496 KB
testcase_30 AC 374 ms
55,828 KB
testcase_31 AC 361 ms
56,380 KB
testcase_32 AC 45 ms
51,336 KB
testcase_33 AC 117 ms
55,772 KB
testcase_34 AC 141 ms
56,192 KB
testcase_35 AC 580 ms
58,008 KB
testcase_36 AC 594 ms
58,368 KB
testcase_37 AC 561 ms
57,736 KB
testcase_38 AC 551 ms
57,952 KB
testcase_39 AC 579 ms
57,800 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.InputMismatchException;

public class Main {
	InputStream is;

	int __t__ = 1;
	int __f__ = 0;
	int __FILE_DEBUG_FLAG__ = __f__;
	String __DEBUG_FILE_NAME__ = "src/D1";

	FastScanner in;
	PrintWriter out;
	
	class Edge {
		int to;
		int cost;

		Edge(int to, int cost) {
			this.to = to;
			this.cost = cost;
		}
	}
	
	int[] U;
	ArrayList<Edge>[] g;
	
	long[] dfs(int u, int par, int upper) {
		long[] res = new long[upper+1];
		res[0] = U[u];
		for (Edge e : g[u]) {
			if (e.to == par) continue;
			if (upper - e.cost * 2 < 0) continue;
			
			int x = upper - e.cost * 2;
			long[] next = dfs(e.to, u, x);
			for (int i = x; i >= 0; i--) {
				for (int j = x - i; j >= 0; j--) {
					int ni = i + j + e.cost * 2;
					res[ni] = Math.max(res[ni], res[i] + next[j]);
				}
			}
		}
		return res;
	}
	
	public void solve() {
		int N = in.nextInt(), M = in.nextInt();
		U = in.nextIntArray(N);
		
		g = new ArrayList[N];
		for (int i = 0; i < N; i++)
			g[i] = new ArrayList<Edge>();
		for (int i = 0; i < N - 1; i++) {
			int a = in.nextInt(), b = in.nextInt(), c = in.nextInt();
			g[a].add(new Edge(b, c));
			g[b].add(new Edge(a, c));
		}
		
		long[] res = dfs(0, -1, M);
		long ans = 0;
		for (int i = 0; i <= M; i++) {
			ans = Math.max(ans, res[i]);
		}
		System.out.println(ans);
	}

	public void run() {
		if (__FILE_DEBUG_FLAG__ == __t__) {
			try {
				is = new FileInputStream(__DEBUG_FILE_NAME__);
			} catch (FileNotFoundException e) {
				e.printStackTrace();
			}
			System.out.println("FILE_INPUT!");
		} else {
			is = System.in;
		}
		in = new FastScanner(is);
		out = new PrintWriter(System.out);

		Thread t = new Thread(null, new Runnable() {
			
			@Override
			public void run() {
				solve();
			}
		}, "lul", 1 << 27);
		t.start();
	}

	public static void main(String[] args) {
		new Main().run();
	}

	public void mapDebug(int[][] a) {
		System.out.println("--------map display---------");

		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				System.out.printf("%3d ", a[i][j]);
			}
			System.out.println();
		}

		System.out.println("----------------------------");
		System.out.println();
	}

	public void debug(Object... obj) {
		System.out.println(Arrays.deepToString(obj));
	}

	class FastScanner {
		private InputStream stream;
		private byte[] buf = new byte[1024];
		private int curChar;
		private int numChars;

		public FastScanner(InputStream stream) {
			this.stream = stream;
			//stream = new FileInputStream(new File("dec.in"));

		}

		int read() {
			if (numChars == -1)
				throw new InputMismatchException();
			if (curChar >= numChars) {
				curChar = 0;
				try {
					numChars = stream.read(buf);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (numChars <= 0)
					return -1;
			}
			return buf[curChar++];
		}

		boolean isSpaceChar(int c) {
			return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		}

		boolean isEndline(int c) {
			return c == '\n' || c == '\r' || c == -1;
		}

		int nextInt() {
			return Integer.parseInt(next());
		}

		int[] nextIntArray(int n) {
			int[] array = new int[n];
			for (int i = 0; i < n; i++)
				array[i] = nextInt();

			return array;
		}

		int[][] nextIntMap(int n, int m) {
			int[][] map = new int[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextIntArray(m);
			}
			return map;
		}

		long nextLong() {
			return Long.parseLong(next());
		}

		long[] nextLongArray(int n) {
			long[] array = new long[n];
			for (int i = 0; i < n; i++)
				array[i] = nextLong();

			return array;
		}

		long[][] nextLongMap(int n, int m) {
			long[][] map = new long[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextLongArray(m);
			}
			return map;
		}

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

		double[] nextDoubleArray(int n) {
			double[] array = new double[n];
			for (int i = 0; i < n; i++)
				array[i] = nextDouble();

			return array;
		}

		double[][] nextDoubleMap(int n, int m) {
			double[][] map = new double[n][m];
			for (int i = 0; i < n; i++) {
				map[i] = in.nextDoubleArray(m);
			}
			return map;
		}

		String next() {
			int c = read();
			while (isSpaceChar(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isSpaceChar(c));
			return res.toString();
		}

		String[] nextStringArray(int n) {
			String[] array = new String[n];
			for (int i = 0; i < n; i++)
				array[i] = next();

			return array;
		}

		String nextLine() {
			int c = read();
			while (isEndline(c))
				c = read();
			StringBuilder res = new StringBuilder();
			do {
				res.appendCodePoint(c);
				c = read();
			} while (!isEndline(c));
			return res.toString();
		}
	}
}


0