結果

問題 No.1488 Max Score of the Tree
ユーザー cyclerecycle9cyclerecycle9
提出日時 2021-09-01 15:18:41
言語 Java21
(openjdk 21)
結果
AC  
実行時間 191 ms / 2,000 ms
コード長 5,276 bytes
コンパイル時間 2,626 ms
コンパイル使用メモリ 80,808 KB
実行使用メモリ 117,640 KB
最終ジャッジ日時 2024-05-05 18:49:09
合計ジャッジ時間 6,660 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 168 ms
114,020 KB
testcase_01 AC 170 ms
110,968 KB
testcase_02 AC 166 ms
114,792 KB
testcase_03 AC 191 ms
117,416 KB
testcase_04 AC 173 ms
117,340 KB
testcase_05 AC 45 ms
36,724 KB
testcase_06 AC 90 ms
62,448 KB
testcase_07 AC 137 ms
93,148 KB
testcase_08 AC 107 ms
71,620 KB
testcase_09 AC 98 ms
64,212 KB
testcase_10 AC 135 ms
93,592 KB
testcase_11 AC 173 ms
117,596 KB
testcase_12 AC 48 ms
37,160 KB
testcase_13 AC 87 ms
53,340 KB
testcase_14 AC 113 ms
75,924 KB
testcase_15 AC 92 ms
62,936 KB
testcase_16 AC 78 ms
44,792 KB
testcase_17 AC 88 ms
52,864 KB
testcase_18 AC 155 ms
98,260 KB
testcase_19 AC 109 ms
71,996 KB
testcase_20 AC 84 ms
53,152 KB
testcase_21 AC 82 ms
45,152 KB
testcase_22 AC 93 ms
63,272 KB
testcase_23 AC 46 ms
36,688 KB
testcase_24 AC 46 ms
36,776 KB
testcase_25 AC 54 ms
36,860 KB
testcase_26 AC 91 ms
55,580 KB
testcase_27 AC 72 ms
39,920 KB
testcase_28 AC 80 ms
49,500 KB
testcase_29 AC 83 ms
52,928 KB
testcase_30 AC 162 ms
102,384 KB
testcase_31 AC 169 ms
117,640 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.RoundingMode;
import java.util.*;

public class Main {
	static final long MOD=1000000007;
	static final long MOD1=998244353;
	static int ans=0;
	public static void main(String[] args){
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc=new InputReader(System.in);
		int N = sc.nextInt();
		int K = sc.nextInt();
		graph G = new graph(N);
		for (int i = 0; i < N-1; i++) {
			int a = sc.nextInt()-1;
			int b = sc.nextInt()-1;
			long w = sc.nextLong();
			G.addEdge(a, b, w);
			G.addEdge(b, a, w);
		}
		int[] child = new int[N];
		G.dfs(0, -1, child);
		int[] idx = new int[1];
		int[] l = new int[N-1];
		long[] w = new long[N-1];
		G.dfs2(0, -1, idx, l, w, child);
		long[][] dp = new long[N][K+1];
		long ans = 0;
		for (int i = 0; i < N-1; i++) {
			ans += w[i];
		}
		for (int i = 1; i < N; i++) {
			for (int j = 0; j <= K; j++) {
				dp[i][j] = dp[i-1][j];
				if (j-l[i-1]>=0) {
					dp[i][j] = Math.max(dp[i][j], dp[i-1][j-l[i-1]] + w[i-1]);
				}
			}
		}
		System.out.println(ans+dp[N-1][K]);
   	}
	static class Edge implements Comparable<Edge>{
		int to;
		long v;
		public Edge(int to,long v) {
			this.to=to;
			this.v=v;
		}
		@Override
    	public boolean equals(Object obj){
    		if(obj instanceof Edge) {
    			Edge other = (Edge) obj;
    			return other.to==this.to && other.v==this.v;
    		}
    		return false;
    	}//同値の定義
    	@Override
    	public int hashCode() {
    		return Objects.hash(this.to,this.v);
    	}
    	@Override
		  public int compareTo( Edge p2 ){
			 if (this.v>p2.v) {
				return 1;
			}
			 else if (this.v<p2.v) {
				return -1;
			}
			 else {
				return 0;
			}
		  }
	} 
	static class graph{
		ArrayList<Edge>[] list;
		int size;
		long INF=Long.MAX_VALUE/2;
		int[] color;
		@SuppressWarnings("unchecked")
		public graph(int n) {
			size = n;
			list = new ArrayList[n];
			color =new int[n];
			for(int i=0;i<n;i++){
				list[i] = new ArrayList<Edge>();
			}
		}
		void addEdge(int from,int to,long w) {
			list[from].add(new Edge(to,w));
		}
		void dfs(int v,int p,int[] child){
			int m = 0;
			for (Edge e: list[v]) {
				if(e.to==p)continue;
				m++;
				dfs(e.to, v, child);
				child[v] += child[e.to];
			}
			if (m==0)child[v] = 1;
		}
		void dfs2(int v,int p,int[] idx,int[] l,long[] w,int[] child){
			for (Edge e: list[v]) {
				if(e.to==p)continue;
				l[idx[0]] = (int)e.v;
				w[idx[0]++] = (long)child[e.to]*e.v;
				dfs2(e.to, v, idx, l, w, child);
			}
		}
	}
	static class InputReader { 
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;
		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}
		public boolean hasNextByte() {
			if (curbuf >= lenbuf) {
				curbuf = 0;
				try {
					lenbuf = in.read(buffer);
				} catch (IOException e) {
					throw new InputMismatchException();
				}
				if (lenbuf <= 0)
					return false;
			}
			return true;
		}
 
		private int readByte() {
			if (hasNextByte())
				return buffer[curbuf++];
			else
				return -1;
		}
 
		private boolean isSpaceChar(int c) {
			return !(c >= 33 && c <= 126);
		}
 
		private void skip() {
			while (hasNextByte() && isSpaceChar(buffer[curbuf]))
				curbuf++;
		}
 
		public boolean hasNext() {
			skip();
			return hasNextByte();
		}
 
		public String next() {
			if (!hasNext())
				throw new NoSuchElementException();
			StringBuilder sb = new StringBuilder();
			int b = readByte();
			while (!isSpaceChar(b)) {
				sb.appendCodePoint(b);
				b = readByte();
			}
			return sb.toString();
		}
 
		public int nextInt() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			int res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		public long nextLong() {
			if (!hasNext())
				throw new NoSuchElementException();
			int c = readByte();
			while (isSpaceChar(c))
				c = readByte();
			boolean minus = false;
			if (c == '-') {
				minus = true;
				c = readByte();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9')
					throw new InputMismatchException();
				res = res * 10 + c - '0';
				c = readByte();
			} while (!isSpaceChar(c));
			return (minus) ? -res : res;
		}
 
		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 double[] nextDoubleArray(int n) {
			double[] a = new double[n];
			for (int i = 0; i < n; i++)
				a[i] = nextDouble();
			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 char[][] nextCharMap(int n, int m) {
			char[][] map = new char[n][m];
			for (int i = 0; i < n; i++)
				map[i] = next().toCharArray();
			return map;
		}
	}
}
0