結果

問題 No.1199 お菓子配り-2
ユーザー uwiuwi
提出日時 2020-08-28 21:23:22
言語 Java21
(openjdk 21)
結果
AC  
実行時間 196 ms / 1,000 ms
コード長 3,517 bytes
コンパイル時間 5,672 ms
コンパイル使用メモリ 86,420 KB
実行使用メモリ 57,088 KB
最終ジャッジ日時 2024-04-26 14:13:43
合計ジャッジ時間 16,471 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,260 KB
testcase_01 AC 51 ms
50,080 KB
testcase_02 AC 50 ms
50,068 KB
testcase_03 AC 117 ms
53,672 KB
testcase_04 AC 158 ms
55,016 KB
testcase_05 AC 63 ms
50,428 KB
testcase_06 AC 82 ms
51,136 KB
testcase_07 AC 124 ms
54,544 KB
testcase_08 AC 139 ms
54,736 KB
testcase_09 AC 123 ms
54,720 KB
testcase_10 AC 94 ms
50,924 KB
testcase_11 AC 119 ms
52,148 KB
testcase_12 AC 122 ms
51,684 KB
testcase_13 AC 95 ms
51,532 KB
testcase_14 AC 92 ms
51,476 KB
testcase_15 AC 74 ms
51,144 KB
testcase_16 AC 128 ms
54,532 KB
testcase_17 AC 119 ms
52,624 KB
testcase_18 AC 135 ms
54,860 KB
testcase_19 AC 100 ms
51,612 KB
testcase_20 AC 155 ms
54,884 KB
testcase_21 AC 126 ms
54,816 KB
testcase_22 AC 121 ms
54,704 KB
testcase_23 AC 120 ms
54,728 KB
testcase_24 AC 135 ms
54,808 KB
testcase_25 AC 97 ms
51,732 KB
testcase_26 AC 160 ms
54,824 KB
testcase_27 AC 145 ms
54,768 KB
testcase_28 AC 187 ms
55,128 KB
testcase_29 AC 178 ms
57,088 KB
testcase_30 AC 189 ms
55,200 KB
testcase_31 AC 189 ms
55,620 KB
testcase_32 AC 190 ms
55,368 KB
testcase_33 AC 192 ms
55,300 KB
testcase_34 AC 182 ms
55,160 KB
testcase_35 AC 196 ms
55,668 KB
testcase_36 AC 193 ms
55,404 KB
testcase_37 AC 189 ms
55,216 KB
testcase_38 AC 186 ms
55,148 KB
testcase_39 AC 177 ms
55,248 KB
testcase_40 AC 194 ms
55,192 KB
testcase_41 AC 180 ms
55,112 KB
testcase_42 AC 181 ms
55,160 KB
testcase_43 AC 190 ms
55,536 KB
testcase_44 AC 189 ms
54,948 KB
testcase_45 AC 185 ms
55,356 KB
testcase_46 AC 186 ms
55,120 KB
testcase_47 AC 185 ms
55,336 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200828;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class B {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		long[] ss = new long[n];
		for(int i = 0;i < n;i++){
			long[] b = new long[m];
			for(int j = 0;j < m;j++){
				b[j] = nl();
			}
			long s = 0;
			for(int j = 0;j < m;j++){
				s += b[j];
			}
			ss[i] = s;
		}
		long[] dp = new long[2];
		dp[1] = Long.MIN_VALUE / 2;
		for(int i = 0;i < n;i++){
			long[] ndp = new long[2];
			ndp[0] = Math.max(dp[0], dp[1] - ss[i]);
			ndp[1] = Math.max(dp[1], dp[0] + ss[i]);
			dp = ndp;
		}
		
		out.println(Math.max(dp[0], dp[1]));
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new B().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0