結果

問題 No.1199 お菓子配り-2
ユーザー AsahiAsahi
提出日時 2023-06-02 15:11:46
言語 Java21
(openjdk 21)
結果
AC  
実行時間 241 ms / 1,000 ms
コード長 5,840 bytes
コンパイル時間 3,023 ms
コンパイル使用メモリ 80,484 KB
実行使用メモリ 66,816 KB
最終ジャッジ日時 2024-06-08 21:56:18
合計ジャッジ時間 18,543 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,480 KB
testcase_01 AC 47 ms
36,688 KB
testcase_02 AC 48 ms
36,944 KB
testcase_03 AC 162 ms
46,740 KB
testcase_04 AC 206 ms
56,264 KB
testcase_05 AC 74 ms
37,936 KB
testcase_06 AC 84 ms
38,436 KB
testcase_07 AC 151 ms
46,708 KB
testcase_08 AC 176 ms
50,276 KB
testcase_09 AC 135 ms
45,692 KB
testcase_10 AC 93 ms
39,428 KB
testcase_11 AC 130 ms
44,980 KB
testcase_12 AC 122 ms
42,340 KB
testcase_13 AC 99 ms
39,516 KB
testcase_14 AC 91 ms
39,556 KB
testcase_15 AC 97 ms
39,648 KB
testcase_16 AC 169 ms
50,252 KB
testcase_17 AC 135 ms
46,168 KB
testcase_18 AC 214 ms
54,672 KB
testcase_19 AC 116 ms
42,072 KB
testcase_20 AC 240 ms
57,560 KB
testcase_21 AC 201 ms
55,036 KB
testcase_22 AC 172 ms
51,168 KB
testcase_23 AC 191 ms
53,740 KB
testcase_24 AC 185 ms
54,840 KB
testcase_25 AC 100 ms
40,012 KB
testcase_26 AC 195 ms
54,704 KB
testcase_27 AC 169 ms
50,472 KB
testcase_28 AC 216 ms
66,620 KB
testcase_29 AC 225 ms
66,420 KB
testcase_30 AC 224 ms
66,564 KB
testcase_31 AC 214 ms
66,640 KB
testcase_32 AC 217 ms
66,752 KB
testcase_33 AC 215 ms
66,776 KB
testcase_34 AC 218 ms
66,756 KB
testcase_35 AC 233 ms
66,744 KB
testcase_36 AC 215 ms
66,768 KB
testcase_37 AC 241 ms
66,496 KB
testcase_38 AC 230 ms
66,724 KB
testcase_39 AC 218 ms
66,608 KB
testcase_40 AC 225 ms
66,608 KB
testcase_41 AC 217 ms
66,648 KB
testcase_42 AC 224 ms
66,680 KB
testcase_43 AC 222 ms
66,496 KB
testcase_44 AC 220 ms
66,680 KB
testcase_45 AC 239 ms
66,816 KB
testcase_46 AC 224 ms
66,616 KB
testcase_47 AC 223 ms
66,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

class Main{
    void solve(PrintWriter out, In in) {       
        int n = in.nextInt() , m = in.nextInt();
        long [][] dp = new long[n+1][n+1];
        long [][] A = in.LongArray(n, m);
        long [] S = new long[n];
        for(int i = 0 ; i < n ; i ++ ) {
            for(int j = 0 ; j < m ; j ++ ) {
                S[i] += A[i][j];
            }
        }
        for(int i = 0 ; i < n ; i ++ ) {
            for(int j = 0 ; j < n ; j ++ ) {
                dp[i+1][j] = Math.max(dp[i+1][j],dp[i][j]);
                if((j + 1) % 2 == 0) {
                    dp[i+1][j+1] = Math.max(dp[i+1][j+1],dp[i][j] - S[i]);
                }
                else{
                    dp[i+1][j+1] = Math.max(dp[i+1][j+1],dp[i][j] + S[i]);
                }  
            }
        }
        long ans = 0 ;
        for(int i = 0 ; i <= n ; i ++ ) {
            ans = Math.max(dp[n][i],ans);
        }
        out.print(ans);
    }   
    /* Library */   
    /* ------- */
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        In in  = new In();
        new Main().solve(out,in);
        out.flush();
    }
    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