#113005 (Java) No.417 チューリップバブル

• 問題: No.417 チューリップバブル
• ユーザー: tanzaku
• 提出日時: 2016-08-26 23:14:50
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 1,104 ms / 2,000 ms
• コード長: 6,503 bytes
• コンパイル時間: 3,741 ms
• コンパイル使用メモリ: 90,888 KB
• 実行使用メモリ: 43,100 KB
• 最終ジャッジ日時: 2024-11-08 09:47:48
• 合計ジャッジ時間: 20,088 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
other	AC * 40

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
import java.io.*;
import java.math.*;
import java.util.*;
import static java.util.Arrays.*;
public class Main {
    private static final int mod = (int)1e9+7;
    final Random random = new Random(0);
    final IOFast io = new IOFast();
    /// MAIN CODE
    public void run() throws IOException {
//      int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
        int TEST_CASE = 1;
        while(TEST_CASE-- != 0) {
            final int n = io.nextInt();
            m0 = io.nextInt() / 2;
            for(int i = 0; i < n; i++) {
                g.add(new ArrayList<>());
            }
            cost = new long[n];
            for(int i = 0; i < n; i++) {
                cost[i] = io.nextLong();
            }
            for(int i = 0; i < n - 1; i++) {
                int a = io.nextInt();
                int b = io.nextInt();
                int c = io.nextInt();
                g.get(a).add(new Edge(b, c));
                g.get(b).add(new Edge(a, c));
            }
            dp2 = new long[n][];
            io.out.println(dfs(0, -1, m0));
        }
    }
    
    int m0;
    long[] cost;
    List<List<Edge>> g = new ArrayList<>();
    long[][] dp2;
    long dfs(int v, int p, int m) {
        if(dp2[v] == null) {
            long[] dp = new long[m0+1];
            Arrays.fill(dp, -1L<<60);
            dp[0] = cost[v];
            for(Edge e : g.get(v)) if(e.t != p) {
//              System.err.println(v + " " + p + " " + e.t);
                for(int k = m0; k > 0; k--) {
//                  dp[k] = dp[k-1];
                    for(int j = 0; k-j-e.c >= 0; j++) {
                        dp[k] = Math.max(dp[k], dp[j] + dfs(e.t, v, k-j-e.c));
                    }
                }
            }
            for(int i = 1; i <= m0; i++) dp[i] = Math.max(dp[i], dp[i-1]);
            dp2[v] = dp;
//          System.err.println(v + " " + m + " " + Arrays.toString(dp));
//          System.err.println(v + " " + m + " " + ans);
        }
        return dp2[v][m];
    }
    
    static
    class Edge {
        int t;
        int c;
        public Edge(int t, int c) {
            this.t = t;
            this.c = c;
        }
    }
    
    /// TEMPLATE
    static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
    static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
    
    static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
    static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
    
    static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
    
    void main() throws IOException {
        //      IOFast.setFileIO("rle-size.in", "rle-size.out");
        try { run(); }
        catch (EndOfFileRuntimeException e) { }
        io.out.flush();
    }
    public static void main(String[] args) throws IOException { new Main().main(); }
    
    static class EndOfFileRuntimeException extends RuntimeException {
        private static final long serialVersionUID = -8565341110209207657L; }
    static
    public class IOFast {
        private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        private PrintWriter out = new PrintWriter(System.out);
        void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
        void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
        void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }
        private static int pos, readLen;
        private static final char[] buffer = new char[1024 * 8];
        private static char[] str = new char[500*8*2];
        private static boolean[] isDigit = new boolean[256];
        private static boolean[] isSpace = new boolean[256];
        private static boolean[] isLineSep = new boolean[256];
        static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = 
            isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
        public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new 
            EndOfFileRuntimeException(); } } return buffer[pos++]; }
        public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] 
            == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
        public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if
            (str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
        public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
        int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == 
            len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } 
            catch(EndOfFileRuntimeException e) { ; } return len; }
        int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } 
            cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
        public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') 
            { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
        public String nextString() throws IOException { return new String(next()); }
        public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//      public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
        public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
        public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong
            (); } return res; }
        public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } 
            return res; }
        public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { 
            res[i] = nextIntArray(k); } return res; }
        public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < 
            n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
        public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = 
            nextDouble(); } return res; }
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX