結果

問題 No.818 Dinner time
ユーザー uwiuwi
提出日時 2019-04-19 21:42:08
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,655 bytes
コンパイル時間 4,018 ms
コンパイル使用メモリ 83,404 KB
実行使用メモリ 54,148 KB
最終ジャッジ日時 2024-09-22 17:53:05
合計ジャッジ時間 7,941 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,088 KB
testcase_01 AC 52 ms
50,192 KB
testcase_02 AC 52 ms
50,180 KB
testcase_03 AC 53 ms
49,852 KB
testcase_04 AC 53 ms
49,852 KB
testcase_05 AC 53 ms
50,204 KB
testcase_06 AC 55 ms
50,188 KB
testcase_07 AC 53 ms
50,184 KB
testcase_08 AC 53 ms
49,964 KB
testcase_09 WA -
testcase_10 AC 53 ms
50,228 KB
testcase_11 WA -
testcase_12 AC 53 ms
50,304 KB
testcase_13 AC 53 ms
50,204 KB
testcase_14 AC 52 ms
50,216 KB
testcase_15 AC 53 ms
50,204 KB
testcase_16 AC 53 ms
50,164 KB
testcase_17 AC 109 ms
53,804 KB
testcase_18 AC 105 ms
53,676 KB
testcase_19 AC 103 ms
53,792 KB
testcase_20 AC 117 ms
53,956 KB
testcase_21 AC 111 ms
53,920 KB
testcase_22 AC 107 ms
51,656 KB
testcase_23 AC 103 ms
53,940 KB
testcase_24 AC 109 ms
53,888 KB
testcase_25 AC 111 ms
54,044 KB
testcase_26 AC 103 ms
51,852 KB
testcase_27 AC 119 ms
53,668 KB
testcase_28 AC 110 ms
53,888 KB
testcase_29 AC 120 ms
53,912 KB
testcase_30 AC 112 ms
53,724 KB
testcase_31 AC 120 ms
54,148 KB
testcase_32 AC 107 ms
53,456 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190419;
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 D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// a
		// b
		// aaaaaaa
		// aaaaaab
		
		int n = ni(), m = ni();
		long[] a = new long[n];
		long[] b = new long[n];
		for(int i = 0;i < n;i++) {
			a[i] = ni();
			b[i] = ni();
		}
		
		long[] abc = new long[n+1];
		for(int i = 0;i < n;i++) {
			abc[i+1] = abc[i] + Math.max(a[i], b[i]);
		}
		
		long[] axc = new long[n+1];
		for(int i = 0;i < n;i++) {
			axc[i+1] = axc[i] + Math.max(b[i], Math.max(a[i]*(m-1)+b[i], a[i]*m));
		}
		
		long und = Long.MIN_VALUE;
		long ans = Long.MIN_VALUE;
		for(int i = 0;i <= n;i++) {
			und = Math.max(und, axc[i] - abc[i]);
			if(i > 0)ans = Math.max(ans, und + abc[i]);
		}
		out.println(ans);
	}
	
	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 D().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