#109012 (Java21) No.409 ダイエット

提出ソース

結果

問題	No.409 ダイエット
ユーザー	uwi
提出日時	2016-08-06 01:02:56
言語	Java21 (openjdk 21)
結果	AC
実行時間	148 ms / 2,000 ms
コード長	3,996 bytes
コンパイル時間	4,924 ms
コンパイル使用メモリ	86,600 KB
実行使用メモリ	58,956 KB
最終ジャッジ日時	2023-09-08 16:55:47
合計ジャッジ時間	15,416 ms
ジャッジサーバーID （参考情報）	judge14 / judge13

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	42 ms 49,312 KB
testcase_01	AC	41 ms 49,196 KB
testcase_02	AC	42 ms 49,252 KB
testcase_03	AC	42 ms 49,332 KB
testcase_04	AC	42 ms 49,236 KB
testcase_05	AC	42 ms 49,204 KB
testcase_06	AC	42 ms 49,080 KB
testcase_07	AC	42 ms 49,220 KB
testcase_08	AC	42 ms 49,196 KB
testcase_09	AC	42 ms 49,064 KB
testcase_10	AC	42 ms 49,328 KB
testcase_11	AC	42 ms 49,380 KB
testcase_12	AC	42 ms 49,276 KB
testcase_13	AC	42 ms 49,088 KB
testcase_14	AC	42 ms 49,184 KB
testcase_15	AC	42 ms 49,380 KB
testcase_16	AC	42 ms 49,184 KB
testcase_17	AC	42 ms 49,092 KB
testcase_18	AC	42 ms 49,208 KB
testcase_19	AC	42 ms 49,220 KB
testcase_20	AC	42 ms 49,392 KB
testcase_21	AC	42 ms 49,336 KB
testcase_22	AC	43 ms 49,336 KB
testcase_23	AC	42 ms 49,096 KB
testcase_24	AC	42 ms 49,376 KB
testcase_25	AC	42 ms 49,204 KB
testcase_26	AC	42 ms 49,288 KB
testcase_27	AC	42 ms 49,204 KB
testcase_28	AC	42 ms 49,340 KB
testcase_29	AC	42 ms 49,420 KB
testcase_30	AC	42 ms 49,336 KB
testcase_31	AC	43 ms 49,188 KB
testcase_32	AC	42 ms 49,224 KB
testcase_33	AC	43 ms 49,288 KB
testcase_34	AC	43 ms 49,288 KB
testcase_35	AC	47 ms 49,216 KB
testcase_36	AC	47 ms 49,332 KB
testcase_37	AC	47 ms 49,264 KB
testcase_38	AC	47 ms 49,220 KB
testcase_39	AC	47 ms 49,208 KB
testcase_40	AC	46 ms 49,100 KB
testcase_41	AC	47 ms 49,288 KB
testcase_42	AC	47 ms 49,152 KB
testcase_43	AC	47 ms 49,192 KB
testcase_44	AC	47 ms 49,196 KB
testcase_45	AC	47 ms 49,332 KB
testcase_46	AC	47 ms 49,376 KB
testcase_47	AC	46 ms 49,180 KB
testcase_48	AC	48 ms 49,232 KB
testcase_49	AC	47 ms 49,344 KB
testcase_50	AC	46 ms 49,260 KB
testcase_51	AC	47 ms 49,220 KB
testcase_52	AC	47 ms 49,348 KB
testcase_53	AC	47 ms 49,092 KB
testcase_54	AC	47 ms 49,140 KB
testcase_55	AC	124 ms 56,096 KB
testcase_56	AC	88 ms 54,220 KB
testcase_57	AC	145 ms 58,636 KB
testcase_58	AC	111 ms 54,524 KB
testcase_59	AC	145 ms 56,500 KB
testcase_60	AC	108 ms 54,540 KB
testcase_61	AC	144 ms 58,724 KB
testcase_62	AC	135 ms 58,632 KB
testcase_63	AC	130 ms 58,536 KB
testcase_64	AC	125 ms 56,780 KB
testcase_65	AC	137 ms 58,404 KB
testcase_66	AC	147 ms 58,544 KB
testcase_67	AC	131 ms 57,832 KB
testcase_68	AC	140 ms 56,368 KB
testcase_69	AC	130 ms 58,360 KB
testcase_70	AC	136 ms 56,564 KB
testcase_71	AC	124 ms 56,364 KB
testcase_72	AC	140 ms 58,368 KB
testcase_73	AC	138 ms 58,484 KB
testcase_74	AC	125 ms 56,356 KB
testcase_75	AC	146 ms 58,956 KB
testcase_76	AC	131 ms 56,440 KB
testcase_77	AC	136 ms 54,340 KB
testcase_78	AC	131 ms 56,776 KB
testcase_79	AC	137 ms 54,620 KB
testcase_80	AC	148 ms 58,468 KB
testcase_81	AC	139 ms 58,520 KB
testcase_82	AC	131 ms 56,420 KB
testcase_83	AC	134 ms 56,584 KB
testcase_84	AC	131 ms 56,596 KB
testcase_85	AC	81 ms 51,604 KB
testcase_86	AC	129 ms 56,472 KB
testcase_87	AC	135 ms 56,304 KB
testcase_88	AC	113 ms 54,540 KB
testcase_89	AC	137 ms 56,516 KB
testcase_90	AC	110 ms 54,644 KB
testcase_91	AC	144 ms 56,276 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

package contest;
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 N409 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long a = ni(), b = ni(), w = ni();
		int[] d = Arrays.copyOf(na(n), n+1);
		long[] dp = new long[n+2];
		dp[0] = w;
		// dp+b(x-t)(x-t-1)/2-a(x-t)
		// b/2*x^2+x((-bt-bt+b)/2-a)+dp+bt(t+1)/2+at
		
		if(b == 0){
			out.println(w-(long)a*n);
			return;
		}
		
		int[] q = new int[n+2];
		long[] qw = new long[n+2];
		int qp = 0;
		for(int i = 1;i <= n+1;i++){
			int x = i-1;
			long B = -b*x;
			long C = dp[x] + b*x*(x+1)/2+a*x;
			long lwhen = Long.MIN_VALUE;
			while(qp > 0){
				int lx = q[qp-1];
				long LB = -b*lx;
				long LC = dp[lx] + b*lx*(lx+1)/2+a*lx;
				// B*x+C <= LB*x+LC
				long when = (C-LC+(LB-B-1))/(LB-B);
				if(qw[qp-1] >= when){
					qp--;
				}else{
					lwhen = when;
					break;
				}
			}
			q[qp] = x;
			qw[qp] = lwhen;
			qp++;
			int ind = Arrays.binarySearch(qw, 0, qp, i);
			if(ind < 0)ind = -ind-2;
			x = q[ind];
			
			long val = dp[x] + b*(i-x)*(i-x-1)/2 - a*(i-x-1);
			dp[i] = val + d[i-1];
		}
		out.println(dp[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 N409().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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)); }
}

yukicoder

結果

テストケース

ソースコード