#894108 (Java21) No.2386 Udon Coupon (Easy)

提出ソース

結果

問題	No.2386 Udon Coupon (Easy)
ユーザー	Asahi
提出日時	2023-07-21 22:27:42
言語	Java21 (openjdk 21)
結果	AC
実行時間	94 ms / 2,000 ms
コード長	7,714 bytes
コンパイル時間	2,567 ms
コンパイル使用メモリ	87,060 KB
実行使用メモリ	54,700 KB
最終ジャッジ日時	2024-09-21 23:56:04
合計ジャッジ時間	6,806 ms
ジャッジサーバーID （参考情報）	judge4 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	74 ms 54,420 KB
testcase_01	AC	73 ms 54,196 KB
testcase_02	AC	76 ms 54,476 KB
testcase_03	AC	74 ms 54,152 KB
testcase_04	AC	73 ms 54,376 KB
testcase_05	AC	74 ms 54,548 KB
testcase_06	AC	76 ms 54,464 KB
testcase_07	AC	90 ms 54,700 KB
testcase_08	AC	74 ms 54,456 KB
testcase_09	AC	78 ms 54,180 KB
testcase_10	AC	87 ms 54,476 KB
testcase_11	AC	80 ms 54,424 KB
testcase_12	AC	91 ms 54,556 KB
testcase_13	AC	90 ms 54,276 KB
testcase_14	AC	94 ms 54,576 KB
testcase_15	AC	91 ms 54,524 KB
testcase_16	AC	88 ms 54,464 KB
testcase_17	AC	89 ms 54,340 KB
testcase_18	AC	85 ms 54,248 KB
testcase_19	AC	78 ms 54,272 KB
testcase_20	AC	93 ms 54,528 KB
testcase_21	AC	89 ms 54,480 KB
testcase_22	AC	86 ms 54,380 KB
testcase_23	AC	86 ms 54,324 KB
testcase_24	AC	80 ms 54,328 KB
testcase_25	AC	90 ms 54,572 KB
testcase_26	AC	90 ms 54,292 KB
testcase_27	AC	88 ms 54,468 KB
testcase_28	AC	85 ms 54,432 KB
testcase_29	AC	89 ms 54,424 KB
testcase_30	AC	80 ms 54,424 KB
testcase_31	AC	84 ms 54,320 KB
testcase_32	AC	77 ms 54,480 KB
testcase_33	AC	89 ms 54,480 KB
testcase_34	AC	86 ms 54,428 KB
testcase_35	AC	94 ms 54,548 KB
testcase_36	AC	87 ms 54,568 KB
testcase_37	AC	89 ms 54,348 KB
testcase_38	AC	89 ms 54,512 KB
testcase_39	AC	86 ms 54,420 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

class Main{
    static final int MOD7 = 1000000007;
    static final int MOD9 = 998244353 ;
    static final int  inf = (1 << 30);
    static final long lnf = (1L << 60);
    final String yes = "Yes";
    final String no  = "No" ;

    void solve(PrintWriter out , In in) {   
        int n = in.nextInt() ;
        int A = in.nextInt() , B = in.nextInt() , C = in.nextInt();
        long [] dp = new long[2000000];
        long answer = 0 ;
        Arrays.fill(dp,-lnf);
        dp[0] = 0 ;
        for(int i = 0 ; i <= n ; i ++ ) {
            dp[i + 3] = Math.max(dp[i + 3] , dp[i] + A);
            dp[i + 5] = Math.max(dp[i + 5] , dp[i] + B);
            dp[i + 10] = Math.max(dp[i + 10] , dp[i] + C);
        }
        for(int i = 0 ; i <= n ; i ++ ) {
            answer = Math.max(answer , dp[i]);
        }
        out.print(answer);
    }
    public static void main(String[] args) {
        PrintWriter pw = new PrintWriter(System.out);
        In in = new In();
        new Main().solve(pw,in);
        pw.flush();
    }
}   

class Pair<T extends Comparable<T>, U extends Comparable<U>> implements Comparable<Pair<T, U>> {

    private final T first;
    private final U second;

    Pair(T first, U second) {
        this.first = first;
        this.second = second;
    }

    T first() {
        return first;
    }

    U second() {
        return second;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Pair<?, ?> pair = (Pair<?, ?>) o;
        return Objects.equals(first, pair.first) && Objects.equals(second, pair.second);
    }

    @Override
    public int hashCode() {
        return Objects.hash(first, second);
    }

    @Override
    public int compareTo(Pair<T, U> other) {
        T small_First  = this.first  , large_First  = other.first;
        U small_Second = this.second , large_Second = other.second;
        int First_Result  = small_First.compareTo(large_First);
        int Second_Result = small_Second.compareTo(large_Second);
        return First_Result == 0 ? Second_Result : First_Result ;
    }

    @Override
    public String toString() {
        return this.first+" "+this.second;
    }
}
class Triple<T extends Comparable<T>, U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Triple<T, U, V>> {
    
    private final T first;
    private final U second;
    private final V third;

    Triple(T first, U second, V third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }

    T first() {
        return first;
    }

    U second() {
        return second;
    }

    V third() {
        return third;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Triple<?, ?, ?> triple = (Triple<?, ?, ?>) o;
        return Objects.equals(first, triple.first) 
            && Objects.equals(second, triple.second)
            && Objects.equals(third, triple.third) ;
    }


    @Override
    public int hashCode() {
        return Objects.hash(first, second, third);
    }

    @Override
    public int compareTo(Triple<T, U, V> other) {
        T small_First  = this.first  , large_First  = other.first;
        U small_Second = this.second , large_Second = other.second;
        V small_Third  = this.third  , large_Third  = other.third;
        int First_Result  = small_First.compareTo(large_First);
        int Second_Result = small_Second.compareTo(large_Second);
        int Third_Result  = small_Third.compareTo(large_Third);
        return First_Result == 0 ? (Second_Result == 0 ? Third_Result : Second_Result ) : First_Result;
    }
}
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());
    }
    char nextChar() {
        return next().charAt(0);
    }
    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;
    }
    char [][] CharArray2(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            for(int j = 0 ; j < n ; j ++ ) {
                Array[i][j] = next().charAt(0);
            }
        }
        return Array;
    }
}

yukicoder

結果

テストケース

ソースコード