結果

問題 No.417 チューリップバブル
ユーザー ぴろずぴろず
提出日時 2016-08-26 22:59:49
言語 Java
(openjdk 23)
結果
AC  
実行時間 102 ms / 2,000 ms
コード長 4,969 bytes
コンパイル時間 3,152 ms
コンパイル使用メモリ 79,856 KB
実行使用メモリ 40,496 KB
最終ジャッジ日時 2024-11-08 09:43:25
合計ジャッジ時間 6,771 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no417;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {

	static int n;
	static int t;
	static int[] x;
	static int[][] sum;
	static ArrayList<Edge>[] tree;
	public static final int INF = 1 << 29;
	
	@SuppressWarnings("unchecked")
	public static void main(String[] args) {
		IO io = new IO();
		n = io.nextInt();
		t = io.nextInt();
		x = io.nextIntArray(n);
		tree = new ArrayList[n];
		for(int i=0;i<n;i++) tree[i] = new ArrayList<>();
		for(int i=0;i<n-1;i++) {
			int a = io.nextInt();
			int b = io.nextInt();
			int c = io.nextInt();
			tree[a].add(new Edge(b,c));
			tree[b].add(new Edge(a,c));
		}
		sum = new int[n][t+1];
		for(int i=0;i<n;i++) {
			Arrays.fill(sum[i], -INF);
		}
		sum[0][0] = 0;
		tour(0,-1);
		int ans = -INF;
		for(int i=0;i<=t;i++) {
			ans = Math.max(ans, sum[0][i]);
		}
		System.out.println(ans + x[0]);
	}
	
	public static void tour(int v,int p) {
		for(Edge e: tree[v]) {
			int u = e.to;
			if (u == p) continue;
			for(int i=e.cost;i<=t;i++) {
				sum[u][i] = Math.max(sum[u][i], sum[v][i-e.cost]);
			}
			tour(u,v);
			for(int i=e.cost;i<=t;i++) {
				sum[v][i] = Math.max(sum[v][i], sum[u][i-e.cost] + x[u]);
			}
		}
	}

}
class Edge {
	int to;
	int cost;
	public Edge(int to, int cost) {
		super();
		this.to = to;
		this.cost = cost;
	}
	
}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	
	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0