結果

問題 No.1488 Max Score of the Tree
ユーザー shojin_pro
提出日時 2021-04-23 22:30:27
言語 Java
(openjdk 23)
結果
AC  
実行時間 201 ms / 2,000 ms
コード長 5,292 bytes
コンパイル時間 2,524 ms
コンパイル使用メモリ 81,372 KB
実行使用メモリ 118,164 KB
最終ジャッジ日時 2024-07-04 08:19:41
合計ジャッジ時間 7,473 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class Main {
    static FastScanner sc = new FastScanner(System.in);
    static PrintWriter pw = new PrintWriter(System.out);
    static StringBuilder sb = new StringBuilder();
    static long mod = (long) 1e9 + 7;
    static ArrayList<ArrayList<Edge>> map;
    static int[] cnt;
    static boolean[] arrived;
    public static void main(String[] args) throws Exception {
        solve();
        pw.flush();
    }

    public static void solve() {
        int n = sc.nextInt(),K = sc.nextInt();
        Edge[] arr = new Edge[n-1];
        map = new ArrayList<>();
        for(int i = 0; i < n; i++){
            map.add(new ArrayList<>());
        }
        for(int i = 0; i < n-1; i++){
            int f = sc.nextInt()-1;
            int t = sc.nextInt()-1;
            int k = sc.nextInt();
            map.get(f).add(new Edge(t,i,k));
            map.get(t).add(new Edge(f,i,k));
            arr[i] = new Edge(t,i,k);
        }
        cnt = new int[n-1];
        arrived = new boolean[n];
        arrived[0] = true;
        dfs(0,new HashSet<Integer>());
        //pw.println(ArraysToString(cnt));
        long[][] dp = new long[n][K+1];
        for(int i = 0; i < n-1; i++){
            Edge e = arr[i];
            int dist = e.d;
            for(int j = 0; j <= K; j++){
                dp[i+1][j] = Math.max(dp[i+1][j],dp[i][j]+(cnt[i]*dist));
                if(j+dist <= K)dp[i+1][j+dist] = Math.max(dp[i+1][j+dist],dp[i][j]+(2*cnt[i]*dist));
            }
        }
        long ans = 0;
        for(int i = 0; i <= K; i++) ans = Math.max(ans,dp[n-1][i]);
        pw.println(ans);
    }
    
    private static void dfs(int now, HashSet<Integer> keep){
        for(Edge e : map.get(now)){
            int next = e.t;
            int index = e.i;
            if(!arrived[next]){
                arrived[next] = true;
                keep.add(index);
                dfs(next,keep);
                keep.remove(index);
            }
        }
        if(map.get(now).size() == 1 && now != 0){
            for(int a : keep){
                cnt[a]++;
            }
        }
    }
    
    private static String ArraysToString(int[] arr){
        String s = Arrays.toString(arr);
        s = s.replaceAll(",","");
        s = s.substring(1,s.length()-1);
        return s;
    }

    static class GeekInteger {
        public static void save_sort(int[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static int[] shuffle(int[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                int randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

        public static void save_sort(long[] array) {
            shuffle(array);
            Arrays.sort(array);
        }

        public static long[] shuffle(long[] array) {
            int n = array.length;
            Random random = new Random();
            for (int i = 0, j; i < n; i++) {
                j = i + random.nextInt(n - i);
                long randomElement = array[j];
                array[j] = array[i];
                array[i] = randomElement;
            }
            return array;
        }

    }
    
    static class Edge{
    	int t,i,d;
    	public Edge(int t, int i, int d) {
    		this.t = t;
    		this.i = i;
    		this.d = d;
    	}
    }
}

class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public FastScanner(FileReader in) {
        reader = new BufferedReader(in);
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

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

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

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

    public String[] nextArray(int n) {
        String[] a = new String[n];
        for (int i = 0; i < n; i++)
            a[i] = next();
        return a;
    }

    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;
    }
}
0