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

提出ソース

結果

問題	No.409 ダイエット
ユーザー	uwi
提出日時	2016-08-06 01:30:44
言語	Java21 (openjdk 21)
結果	AC
実行時間	155 ms / 2,000 ms
コード長	4,025 bytes
コンパイル時間	4,262 ms
コンパイル使用メモリ	82,352 KB
実行使用メモリ	47,080 KB
最終ジャッジ日時	2024-06-26 09:48:41
合計ジャッジ時間	14,095 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	50 ms 37,028 KB
testcase_01	AC	50 ms 36,572 KB
testcase_02	AC	50 ms 37,120 KB
testcase_03	AC	51 ms 36,816 KB
testcase_04	AC	50 ms 36,992 KB
testcase_05	AC	50 ms 37,004 KB
testcase_06	AC	50 ms 37,128 KB
testcase_07	AC	52 ms 36,720 KB
testcase_08	AC	50 ms 37,016 KB
testcase_09	AC	50 ms 37,004 KB
testcase_10	AC	51 ms 36,796 KB
testcase_11	AC	51 ms 37,144 KB
testcase_12	AC	50 ms 37,256 KB
testcase_13	AC	49 ms 37,016 KB
testcase_14	AC	49 ms 36,764 KB
testcase_15	AC	49 ms 36,864 KB
testcase_16	AC	50 ms 37,016 KB
testcase_17	AC	51 ms 37,076 KB
testcase_18	AC	49 ms 37,032 KB
testcase_19	AC	52 ms 36,992 KB
testcase_20	AC	51 ms 36,764 KB
testcase_21	AC	50 ms 36,632 KB
testcase_22	AC	52 ms 36,832 KB
testcase_23	AC	53 ms 36,428 KB
testcase_24	AC	54 ms 36,632 KB
testcase_25	AC	52 ms 36,948 KB
testcase_26	AC	51 ms 36,544 KB
testcase_27	AC	50 ms 36,984 KB
testcase_28	AC	49 ms 36,904 KB
testcase_29	AC	50 ms 37,128 KB
testcase_30	AC	50 ms 36,720 KB
testcase_31	AC	49 ms 36,928 KB
testcase_32	AC	50 ms 36,968 KB
testcase_33	AC	49 ms 36,780 KB
testcase_34	AC	49 ms 36,964 KB
testcase_35	AC	52 ms 37,132 KB
testcase_36	AC	53 ms 37,132 KB
testcase_37	AC	52 ms 37,000 KB
testcase_38	AC	53 ms 37,168 KB
testcase_39	AC	53 ms 37,132 KB
testcase_40	AC	52 ms 36,764 KB
testcase_41	AC	52 ms 37,112 KB
testcase_42	AC	52 ms 37,100 KB
testcase_43	AC	52 ms 36,992 KB
testcase_44	AC	54 ms 36,920 KB
testcase_45	AC	55 ms 36,960 KB
testcase_46	AC	55 ms 36,760 KB
testcase_47	AC	65 ms 36,760 KB
testcase_48	AC	52 ms 36,812 KB
testcase_49	AC	53 ms 37,024 KB
testcase_50	AC	52 ms 36,964 KB
testcase_51	AC	53 ms 36,876 KB
testcase_52	AC	53 ms 37,020 KB
testcase_53	AC	53 ms 36,876 KB
testcase_54	AC	54 ms 36,952 KB
testcase_55	AC	121 ms 44,132 KB
testcase_56	AC	96 ms 42,280 KB
testcase_57	AC	154 ms 47,056 KB
testcase_58	AC	116 ms 41,908 KB
testcase_59	AC	143 ms 45,348 KB
testcase_60	AC	109 ms 41,624 KB
testcase_61	AC	141 ms 45,980 KB
testcase_62	AC	153 ms 46,300 KB
testcase_63	AC	149 ms 45,932 KB
testcase_64	AC	132 ms 43,984 KB
testcase_65	AC	148 ms 46,200 KB
testcase_66	AC	143 ms 47,080 KB
testcase_67	AC	125 ms 45,316 KB
testcase_68	AC	135 ms 45,236 KB
testcase_69	AC	148 ms 45,708 KB
testcase_70	AC	155 ms 45,312 KB
testcase_71	AC	138 ms 43,692 KB
testcase_72	AC	132 ms 46,552 KB
testcase_73	AC	154 ms 46,192 KB
testcase_74	AC	147 ms 44,828 KB
testcase_75	AC	150 ms 46,136 KB
testcase_76	AC	149 ms 44,412 KB
testcase_77	AC	141 ms 42,144 KB
testcase_78	AC	150 ms 44,512 KB
testcase_79	AC	138 ms 41,884 KB
testcase_80	AC	152 ms 46,384 KB
testcase_81	AC	137 ms 46,080 KB
testcase_82	AC	135 ms 44,560 KB
testcase_83	AC	155 ms 44,760 KB
testcase_84	AC	152 ms 45,152 KB
testcase_85	AC	87 ms 38,796 KB
testcase_86	AC	152 ms 45,000 KB
testcase_87	AC	148 ms 45,532 KB
testcase_88	AC	112 ms 41,480 KB
testcase_89	AC	137 ms 44,680 KB
testcase_90	AC	125 ms 41,156 KB
testcase_91	AC	143 ms 45,068 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_3 {
	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 ind = 0;
		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++;
			ind = Math.min(ind, qp-1);
			while(ind+1 < qp && qw[ind+1] <= i){
				ind++;
			}
			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_3().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

結果

テストケース

ソースコード