結果

問題 No.952 危険な火薬庫
ユーザー uwiuwi
提出日時 2019-12-15 00:10:56
言語 Java21
(openjdk 21)
結果
AC  
実行時間 210 ms / 2,000 ms
コード長 3,901 bytes
コンパイル時間 3,913 ms
コンパイル使用メモリ 80,456 KB
実行使用メモリ 39,744 KB
最終ジャッジ日時 2024-06-28 04:03:56
合計ジャッジ時間 8,232 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,960 KB
testcase_01 AC 53 ms
36,820 KB
testcase_02 AC 52 ms
37,032 KB
testcase_03 AC 171 ms
39,404 KB
testcase_04 AC 174 ms
39,332 KB
testcase_05 AC 162 ms
39,252 KB
testcase_06 AC 186 ms
39,360 KB
testcase_07 AC 134 ms
39,128 KB
testcase_08 AC 209 ms
39,744 KB
testcase_09 AC 210 ms
39,528 KB
testcase_10 AC 156 ms
39,268 KB
testcase_11 AC 52 ms
37,112 KB
testcase_12 AC 145 ms
39,244 KB
testcase_13 AC 152 ms
39,252 KB
testcase_14 AC 103 ms
38,980 KB
testcase_15 AC 167 ms
39,228 KB
testcase_16 AC 127 ms
38,900 KB
testcase_17 AC 106 ms
39,108 KB
testcase_18 AC 123 ms
39,096 KB
testcase_19 AC 56 ms
37,076 KB
testcase_20 AC 56 ms
36,908 KB
testcase_21 AC 148 ms
39,244 KB
testcase_22 AC 101 ms
39,376 KB
testcase_23 AC 59 ms
37,076 KB
testcase_24 AC 81 ms
38,592 KB
testcase_25 AC 198 ms
39,396 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2019;
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 D15 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	int[] a;
	long[] cum;
	
	void solve()
	{
		int n = ni();
		a = na(n);
		a = Arrays.copyOf(a, n+1);
		n++;
		
		cum = new long[n+1];
		for(int i = 0;i < n;i++)cum[i+1] = cum[i] + a[i];
		
		long[] dp = new long[n+1];
		Arrays.fill(dp, Long.MAX_VALUE / 10);
		dp[0] = 0;
		
		int[] args = new int[n+1];
		long[] ans = new long[n+1];
		for(int k = 0;k < n;k++){
			int sup = n;
			for(int i = n;i >= k+1;i--){
				long min = Long.MAX_VALUE;
				int arg = -1;
				for(int j = args[i];j <= sup;j++){
//					long v = (j > i-1 ? 0 : f[j][i-1]) + dp[j];
					long v = f(j, i, dp);
					if(v < min){
						min = v;
						arg = j;
					}
				}
				dp[i] = min;
				args[i] = arg;
				sup = arg;
			}
			dp[k] = Long.MAX_VALUE / 10;
			ans[n-k] = dp[n];
		}
		for(int i = 2;i <= n;i++){
			out.println(ans[i]);
		}
	}

	long f(int l, int r, long[] dp)
	{
		return dp[l] + (cum[r-1] - cum[l]) * (cum[r-1] - cum[l]);
	}
	
	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 D15().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