結果

問題 No.2317 Expression Menu
ユーザー AsahiAsahi
提出日時 2023-05-26 22:53:00
言語 Java21
(openjdk 21)
結果
AC  
実行時間 676 ms / 2,000 ms
コード長 7,531 bytes
コンパイル時間 3,156 ms
コンパイル使用メモリ 82,220 KB
実行使用メモリ 257,088 KB
最終ジャッジ日時 2024-06-07 08:24:46
合計ジャッジ時間 23,005 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
36,740 KB
testcase_01 AC 49 ms
36,776 KB
testcase_02 AC 135 ms
54,832 KB
testcase_03 AC 491 ms
255,108 KB
testcase_04 AC 478 ms
255,100 KB
testcase_05 AC 470 ms
256,752 KB
testcase_06 AC 485 ms
255,064 KB
testcase_07 AC 479 ms
256,652 KB
testcase_08 AC 468 ms
254,468 KB
testcase_09 AC 465 ms
256,996 KB
testcase_10 AC 482 ms
254,608 KB
testcase_11 AC 478 ms
256,896 KB
testcase_12 AC 477 ms
254,788 KB
testcase_13 AC 489 ms
257,088 KB
testcase_14 AC 485 ms
254,500 KB
testcase_15 AC 488 ms
256,652 KB
testcase_16 AC 493 ms
254,828 KB
testcase_17 AC 541 ms
256,760 KB
testcase_18 AC 491 ms
254,500 KB
testcase_19 AC 489 ms
256,700 KB
testcase_20 AC 528 ms
254,740 KB
testcase_21 AC 484 ms
256,396 KB
testcase_22 AC 482 ms
254,500 KB
testcase_23 AC 503 ms
257,088 KB
testcase_24 AC 512 ms
254,464 KB
testcase_25 AC 510 ms
256,892 KB
testcase_26 AC 515 ms
256,268 KB
testcase_27 AC 511 ms
256,760 KB
testcase_28 AC 505 ms
254,840 KB
testcase_29 AC 515 ms
256,884 KB
testcase_30 AC 506 ms
255,068 KB
testcase_31 AC 507 ms
256,748 KB
testcase_32 AC 507 ms
254,744 KB
testcase_33 AC 50 ms
42,704 KB
testcase_34 AC 49 ms
36,956 KB
testcase_35 AC 72 ms
38,656 KB
testcase_36 AC 51 ms
36,804 KB
testcase_37 AC 50 ms
36,812 KB
testcase_38 AC 676 ms
254,712 KB
testcase_39 AC 657 ms
254,912 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

class Main{
    void solve(PrintWriter out, In in) {        
        int n = in.nextInt() , x = in.nextInt() , y = in.nextInt();
        int [] A = new int[n];
        int [] B = new int[n];
        int [] C = new int[n];
        for(int i = 0 ; i < n ; i ++ ) {
            A[i] = in.nextInt() ; B[i] = in.nextInt() ; C[i] = in.nextInt();
        }
        long [][][] dp = new long[n+1][x+1][y+1];
        dp[0][0][0] = 0 ;
        for(int i = 0 ; i < n ; i ++ ) {
            for(int j = 0 ; j <= x ; j ++ ) {
                for(int k =0 ; k <= y ; k ++ ) {
                    dp[i+1][j][k] = Math.max(dp[i+1][j][k],dp[i][j][k]);
                    if(j + A[i] <= x && k + B[i] <= y) {
                        dp[i+1][j+A[i]][k+B[i]] = Math.max(dp[i+1][j+A[i]][k+B[i]],dp[i][j][k] + C[i]);
                    }
                }
            }
        }
        long answer = 0;
        for(int i = 0 ; i <= x ; i ++ ) {
            for(int j = 0 ; j <= y ; j ++ ) {
                answer = Math.max(answer,dp[n][i][j]);
            }
        }
        out.println(answer);
    }   
    /* Library */   
    class DSU {
        private int[] rank;
        private int [] parent;
        private int [] size;
        DSU(int n) {
            this.parent = new int[n];
            this.rank = new int[n];
            this.size = new int[n];
            for (int i = 0 ; i < n; i ++ ) {
                parent[i] = i;
                rank[i] = 0;
                size[i] = 1;
            }
        }
        int groups() {
            int count = 0;
            for(int i = 0;i < parent.length ; i ++ ) {
                if(i == find(i)) {
                    count++;
                }
            }
            return count;
        }
        int size(int x){
            return size[find(x)];
        }
        int find(int x) {
            if (x == parent[x]) {
                return x;
            } else {
                parent[x] = find(parent[x]);
                return parent[x];
            }
        }
        boolean same(int x, int y) {
            return find(x) == find(y);
        }
        void unite(int x, int y) {
            int xRoot = find(x);
            int yRoot = find(y);
            if (xRoot == yRoot) {
                return;
            }
            if (rank[xRoot] > rank[yRoot]) {
                parent[yRoot] = xRoot;
            } else if (rank[xRoot] < rank[yRoot]) {
                parent[xRoot] = yRoot;
            } else {
                parent[xRoot] = yRoot;
                rank[xRoot]++;
                size[yRoot] += size[xRoot];
            }
        }
    }
    /* ------- */
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        In in  = new In();
        new Main().solve(out,in);
        out.flush();
    }
    /* Const */
    final long MOD7 = 1000000007; final long MOD9 = 998244353 ;
    final int [] X4 = {0,1,0,-1}; final int [] Y4 = {-1,0,1,0};
    final int [] X8 = {-1,-1,0,1,1,1,0,-1}; final int [] Y8 = {0,1,1,1,0,-1,-1,-1};
    final int Inf = (int)1e9; final long Lnf = (long)1e18;
    final String yes = "Yes"; final String no = "No";
    /* ----- */
}
/* Class */

/* ----- */
class Pair{
    private int first ;
    private int second;
    Pair(int first,int second) {
        this.first = first;
        this.second = second;
    }
    int first()  { return this.first ; }
    int second() { return this.second; }
    @Override
    public String toString(){ return first()+" = "+second(); }
}
class PairII {
    private int first ;
    private int second ;
    private int third;
    PairII(int first, int second, int third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }
    int first()  { return this.first ; }
    int second() { return this.second; }
    int third()  { return this.third ; }
    @Override
    public String toString(){ return first()+" = "+second()+" = "+third() ; }
}
class In{
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    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;
    }
    public boolean hasNext() { 
        while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
            ptr++; 
        }
        return hasNextByte();
    }
    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();
    }

    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();
        }
    }
    int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    double nextDouble() { 
        return Double.parseDouble(next());
    }
    int [] IntArray(int n) {
        final int [] Array = new int [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextInt();
        }
        return Array;
    }
    int [][] IntArray(int n , int m) {
        final int [][] Array = new int [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = IntArray(m);
        }
        return Array;
    }   
    long [] LongArray(int n) {
        final long [] Array = new long [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextLong();
        }
        return Array;
    }
    long [][] LongArray(int n , int m) {
        final long [][] Array = new long [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = LongArray(m);
        }
        return Array;
    }
    String [] StringArray(int n) {
        final String [] Array = new String [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next();
        }
        return Array;
    }
    char [] CharArray(int n) {
        final char [] Array = new char[n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().charAt(0);
        }
        return Array;
    }
    char [][] CharArray(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().toCharArray();
        }
        return Array;
    }
}
0