結果

問題 No.595 登山
ユーザー uwiuwi
提出日時 2017-11-10 22:45:23
言語 Java21
(openjdk 21)
結果
AC  
実行時間 113 ms / 1,500 ms
コード長 3,481 bytes
コンパイル時間 3,523 ms
コンパイル使用メモリ 85,960 KB
実行使用メモリ 56,844 KB
最終ジャッジ日時 2023-08-16 03:25:11
合計ジャッジ時間 7,280 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 37 ms
49,240 KB
testcase_01 AC 37 ms
47,568 KB
testcase_02 AC 37 ms
49,616 KB
testcase_03 AC 37 ms
49,472 KB
testcase_04 AC 101 ms
56,552 KB
testcase_05 AC 70 ms
51,820 KB
testcase_06 AC 100 ms
54,404 KB
testcase_07 AC 51 ms
50,844 KB
testcase_08 AC 72 ms
51,180 KB
testcase_09 AC 98 ms
54,136 KB
testcase_10 AC 94 ms
54,264 KB
testcase_11 AC 104 ms
54,200 KB
testcase_12 AC 52 ms
50,560 KB
testcase_13 AC 71 ms
49,760 KB
testcase_14 AC 101 ms
56,252 KB
testcase_15 AC 102 ms
56,328 KB
testcase_16 AC 100 ms
56,448 KB
testcase_17 AC 106 ms
54,412 KB
testcase_18 AC 103 ms
56,728 KB
testcase_19 AC 109 ms
56,844 KB
testcase_20 AC 113 ms
56,592 KB
testcase_21 AC 113 ms
56,532 KB
testcase_22 AC 108 ms
54,336 KB
testcase_23 AC 110 ms
56,524 KB
testcase_24 AC 38 ms
49,384 KB
testcase_25 AC 39 ms
49,412 KB
testcase_26 AC 113 ms
56,700 KB
testcase_27 AC 107 ms
56,496 KB
testcase_28 AC 106 ms
56,424 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest171110;
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 E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[] a = na(n);
		long[] lp = new long[n];
		long[] rp = new long[n];
		rp[0] = Long.MAX_VALUE / 2;
		for(int i = 1;i < n;i++){
			lp[i] = lp[i-1] + Math.max(a[i] - a[i-1], 0);
			lp[i] = Math.min(lp[i], lp[i-1] + K);
			lp[i] = Math.min(lp[i], rp[i-1] + K);
			rp[i] = rp[i-1] + Math.max(a[i-1] - a[i], 0);
			rp[i] = Math.min(rp[i], rp[i-1] + K);
			rp[i] = Math.min(rp[i], lp[i-1] + K);
		}
		out.println(Math.min(lp[n-1], rp[n-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 E().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