結果

問題 No.1174 盆栽の剪定
ユーザー uwiuwi
提出日時 2020-08-19 19:14:28
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,918 bytes
コンパイル時間 3,961 ms
コンパイル使用メモリ 90,268 KB
実行使用メモリ 71,912 KB
最終ジャッジ日時 2024-10-12 05:14:48
合計ジャッジ時間 14,316 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
36,796 KB
testcase_01 AC 51 ms
36,852 KB
testcase_02 AC 51 ms
36,852 KB
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 51 ms
37,024 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 50 ms
36,552 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 50 ms
36,620 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 AC 528 ms
60,068 KB
testcase_21 WA -
testcase_22 AC 542 ms
67,120 KB
testcase_23 AC 593 ms
65,584 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no1xxx;
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 No1174 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		// 1853
		int n = ni();
		int m = Integer.highestOneBit(n)*2;
		m--;
		int[] a = Arrays.copyOf(na(n), m);
		n = m;
		long[][][] dp = new long[n+1][][];
		
		for(int i = n;i >= 1;i--) {
			if(i >= (n+1)/2) {
				dp[i] = new long[][] {{a[i-1]}};
			}else {
				long[][] L = dp[2*i], R = dp[2*i+1];
				int len = L[0].length;
				int nlen = len + 2;
				long[][] res = new long[nlen][];
				long[] maxs = new long[nlen];
				Arrays.fill(maxs, -1);
				for(long[] l : L) {
					for(long[] r : R) {
						long[] an = new long[nlen];
						an[nlen/2] += a[i-1];
						for(int t = 0;t < len;t++) {
							an[t] += l[t];
							an[t+2] += r[t];
						}
						long s = 0;
						long cs = 0;
						long bal = l[0];
						for(int t = 0;t < nlen;t++) {
							s += an[t];
							if(t+1 < len)bal += l[t+1];
							if(t >= 2)bal -= r[t-2];
							cs += s;
							if(cs > maxs[t] && bal >= 0) {
								maxs[t] = cs;
								res[t] = an;
							}
						}
					}
				}
				for(long[] l : L) {
					for(long[] r : R) {
						long[] an = new long[nlen];
						an[nlen/2] += a[i-1];
						for(int t = 0;t < len;t++) {
							an[t] += r[t];
							an[t+2] += l[t];
						}
						long s = 0;
						long cs = 0;
						long bal = r[0];
						for(int t = 0;t < nlen;t++) {
							s += an[t];
							if(t+1 < len)bal += r[t+1];
							if(t >= 2)bal -= l[t-2];
							cs += s;
							if(cs > maxs[t] && bal >= 0) {
								maxs[t] = cs;
								res[t] = an;
							}
						}
					}
				}
				dp[i] = res;
			}
		}
		
		long[] last = dp[1][dp[1].length/2-1];
		long ans = 0;
		for(int h = last.length/2, u = 0;h >= 0;h--, u++) {
			ans += last[h] * u;
		}
		out.println(ans);
	}
	
	void run() throws Exception
	{
//		int n = 100000, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(gen.nextInt(1000000000) + " ");
//		}
//		INPUT = sb.toString();

		
		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 No1174().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