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

提出ソース

結果

問題	No.409 ダイエット
ユーザー	tanzaku
提出日時	2016-08-16 04:43:36
言語	Java21 (openjdk 21)
結果	AC
実行時間	325 ms / 2,000 ms
コード長	7,338 bytes
コンパイル時間	2,551 ms
コンパイル使用メモリ	86,484 KB
実行使用メモリ	59,800 KB
最終ジャッジ日時	2024-06-26 09:58:40
合計ジャッジ時間	17,861 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	55 ms 50,640 KB
testcase_01	AC	55 ms 50,380 KB
testcase_02	AC	56 ms 50,660 KB
testcase_03	AC	57 ms 50,628 KB
testcase_04	AC	56 ms 50,416 KB
testcase_05	AC	59 ms 50,556 KB
testcase_06	AC	58 ms 50,576 KB
testcase_07	AC	58 ms 50,628 KB
testcase_08	AC	57 ms 50,668 KB
testcase_09	AC	56 ms 50,688 KB
testcase_10	AC	56 ms 50,640 KB
testcase_11	AC	56 ms 50,460 KB
testcase_12	AC	59 ms 50,260 KB
testcase_13	AC	57 ms 50,288 KB
testcase_14	AC	55 ms 50,608 KB
testcase_15	AC	55 ms 50,580 KB
testcase_16	AC	56 ms 50,672 KB
testcase_17	AC	58 ms 50,612 KB
testcase_18	AC	57 ms 50,660 KB
testcase_19	AC	56 ms 50,584 KB
testcase_20	AC	56 ms 50,284 KB
testcase_21	AC	55 ms 50,320 KB
testcase_22	AC	58 ms 50,612 KB
testcase_23	AC	56 ms 50,224 KB
testcase_24	AC	57 ms 50,588 KB
testcase_25	AC	55 ms 50,576 KB
testcase_26	AC	56 ms 50,668 KB
testcase_27	AC	56 ms 50,140 KB
testcase_28	AC	56 ms 50,548 KB
testcase_29	AC	55 ms 50,664 KB
testcase_30	AC	57 ms 50,556 KB
testcase_31	AC	56 ms 50,596 KB
testcase_32	AC	57 ms 50,668 KB
testcase_33	AC	56 ms 50,624 KB
testcase_34	AC	58 ms 50,476 KB
testcase_35	AC	70 ms 50,956 KB
testcase_36	AC	78 ms 51,172 KB
testcase_37	AC	69 ms 50,988 KB
testcase_38	AC	71 ms 51,096 KB
testcase_39	AC	77 ms 50,936 KB
testcase_40	AC	74 ms 51,024 KB
testcase_41	AC	70 ms 50,796 KB
testcase_42	AC	72 ms 50,892 KB
testcase_43	AC	67 ms 50,400 KB
testcase_44	AC	65 ms 50,704 KB
testcase_45	AC	68 ms 50,276 KB
testcase_46	AC	71 ms 51,068 KB
testcase_47	AC	69 ms 50,548 KB
testcase_48	AC	77 ms 52,712 KB
testcase_49	AC	67 ms 50,632 KB
testcase_50	AC	73 ms 51,096 KB
testcase_51	AC	78 ms 50,628 KB
testcase_52	AC	67 ms 50,484 KB
testcase_53	AC	73 ms 50,912 KB
testcase_54	AC	69 ms 51,052 KB
testcase_55	AC	192 ms 55,480 KB
testcase_56	AC	268 ms 58,488 KB
testcase_57	AC	288 ms 59,188 KB
testcase_58	AC	189 ms 56,188 KB
testcase_59	AC	226 ms 58,296 KB
testcase_60	AC	187 ms 56,576 KB
testcase_61	AC	230 ms 58,696 KB
testcase_62	AC	247 ms 58,920 KB
testcase_63	AC	253 ms 58,736 KB
testcase_64	AC	201 ms 55,916 KB
testcase_65	AC	285 ms 58,964 KB
testcase_66	AC	249 ms 58,756 KB
testcase_67	AC	230 ms 58,768 KB
testcase_68	AC	252 ms 58,988 KB
testcase_69	AC	253 ms 58,716 KB
testcase_70	AC	323 ms 59,428 KB
testcase_71	AC	211 ms 56,056 KB
testcase_72	AC	325 ms 59,548 KB
testcase_73	AC	276 ms 59,316 KB
testcase_74	AC	234 ms 58,392 KB
testcase_75	AC	277 ms 59,252 KB
testcase_76	AC	249 ms 58,244 KB
testcase_77	AC	234 ms 56,732 KB
testcase_78	AC	212 ms 55,892 KB
testcase_79	AC	207 ms 56,172 KB
testcase_80	AC	269 ms 59,452 KB
testcase_81	AC	313 ms 59,800 KB
testcase_82	AC	251 ms 58,704 KB
testcase_83	AC	275 ms 58,892 KB
testcase_84	AC	260 ms 58,896 KB
testcase_85	AC	109 ms 52,588 KB
testcase_86	AC	257 ms 59,036 KB
testcase_87	AC	274 ms 59,580 KB
testcase_88	AC	197 ms 56,612 KB
testcase_89	AC	313 ms 59,188 KB
testcase_90	AC	189 ms 56,836 KB
testcase_91	AC	271 ms 59,292 KB

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

ソースコード

raw source code

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			// f(i), i <= [0,n]
			// f(0) := 0
			// f(i+1) = min_{j=[0,i]}[f(j) + D[i] + B*(i-j)*(i-j+1)/2 - A*(i-j)]
			// ans = min_{i=[0,n]}[f(i) + B*(n-i)*(n-i+1)/2 - A*(n-i)]

			// (ii-ij+i-ij+jj-j)/2 = (ii+i  + jj - j - 2ij) / 2
			// f(i+1) = D[i] - A*i + B*(i+1)*i/2 + min_{j=[0,i]}[f(j) - i*j*B + B*(j-1)*j/2 + A*j)]

			// a = -j*B
			// b = f(j) + B*(j-1)*j/2 + A*j
			// f(i+1) = D[i] - A*i + B*(i+1)*i/2 + min_{j=[0,i]}[a*i + b)]

			final int n = io.nextInt();
			final long A = io.nextLong();
			final long B = io.nextLong();
			final long W = io.nextLong();
			final int[] D = io.nextIntArray(n);
			final long[] dp = new long[n+1];
			
			Deque<long[]> deq = new ArrayDeque<>();
			deq.addLast(new long[2]);
			for (int i = 0; i < n; i++) {
				while(deq.size() >= 2) {
					final long[] p1 = deq.pollLast();
					final long[] p2 = deq.peekLast();
					if(p1[0]*i+p1[1] < p2[0]*i+p2[1]) {
						deq.addLast(p1);
						break;
					}
				}
				final long[] c = deq.peekLast();
				dp[i+1] = D[i] - A*i + B*(i+1)*i/2 + c[0]*i + c[1];
				deq.addFirst(new long[]{-(i+1)*B, dp[i+1] + B*i*(i+1)/2 + A*(i+1)});
				while(deq.size() >= 3) {
					final long[] p1 = deq.pollFirst();
					final long[] p2 = deq.pollFirst();
					final long[] p3 = deq.pollFirst();
					final long dx13 = p1[0]-p3[0];
					final long dy13 = p1[1]-p3[1];
					final long dx23 = p2[0]-p3[0];
					final long dy23 = p2[1]-p3[1];
					// y=ax+b, y=cx+d, x=-(b-d)/(a-c)
//					if(-dy13/dx13 <= -dy23/dx23) {
					if(dy13*dx23 >= dy23*dx13) {
					} else {
//						System.err.println(i + " " + (-dy13/(double)dx13) + " " + (-dy23/(double)dx23));
						deq.addFirst(p3);
						deq.addFirst(p2);
						deq.addFirst(p1);
						break;
					}
					deq.addFirst(p3);
					deq.addFirst(p1);
				}
			}

			// ans = min_{i=[0,n]}[f(i) + B*(n-i)*(n-i+1)/2 - A*(n-i)]
			long ans = Long.MAX_VALUE;
			for(int i = 0; i <= n; i++) {
//				System.err.println(i + " " + (dp[i] + B*(n-i)*(n-i+1)/2 - A*(n-i)));
				ans = Math.min(ans, dp[i] + B*(n-i)*(n-i+1)/2 - A*(n-i));
			}
			io.out.println(W + ans);
		}
	}
	
	static
	class ConvexHullOptimization {
		
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}

yukicoder

結果

テストケース

ソースコード