結果

問題 No.409 ダイエット
ユーザー 37zigen37zigen
提出日時 2016-08-07 01:58:10
言語 Java19
(openjdk 21)
結果
AC  
実行時間 249 ms / 2,000 ms
コード長 4,916 bytes
コンパイル時間 2,309 ms
コンパイル使用メモリ 79,504 KB
実行使用メモリ 61,712 KB
最終ジャッジ日時 2023-09-08 16:59:28
合計ジャッジ時間 22,226 ms
ジャッジサーバーID
(参考情報)
judge14 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 118 ms
55,732 KB
testcase_01 AC 119 ms
55,628 KB
testcase_02 AC 119 ms
55,472 KB
testcase_03 AC 120 ms
55,540 KB
testcase_04 AC 119 ms
55,936 KB
testcase_05 AC 118 ms
55,460 KB
testcase_06 AC 118 ms
55,564 KB
testcase_07 AC 116 ms
55,764 KB
testcase_08 AC 118 ms
55,696 KB
testcase_09 AC 117 ms
57,500 KB
testcase_10 AC 120 ms
55,580 KB
testcase_11 AC 120 ms
55,620 KB
testcase_12 AC 117 ms
55,372 KB
testcase_13 AC 121 ms
55,736 KB
testcase_14 AC 118 ms
55,712 KB
testcase_15 AC 117 ms
55,624 KB
testcase_16 AC 118 ms
55,404 KB
testcase_17 AC 119 ms
55,404 KB
testcase_18 AC 118 ms
55,796 KB
testcase_19 AC 121 ms
55,900 KB
testcase_20 AC 118 ms
55,652 KB
testcase_21 AC 118 ms
55,616 KB
testcase_22 AC 117 ms
55,404 KB
testcase_23 AC 118 ms
55,756 KB
testcase_24 AC 118 ms
55,864 KB
testcase_25 AC 118 ms
55,488 KB
testcase_26 AC 120 ms
55,528 KB
testcase_27 AC 120 ms
55,936 KB
testcase_28 AC 121 ms
55,808 KB
testcase_29 AC 118 ms
55,684 KB
testcase_30 AC 117 ms
55,624 KB
testcase_31 AC 117 ms
55,632 KB
testcase_32 AC 117 ms
55,580 KB
testcase_33 AC 118 ms
55,516 KB
testcase_34 AC 118 ms
55,644 KB
testcase_35 AC 137 ms
55,400 KB
testcase_36 AC 136 ms
55,636 KB
testcase_37 AC 136 ms
55,900 KB
testcase_38 AC 135 ms
55,640 KB
testcase_39 AC 138 ms
55,628 KB
testcase_40 AC 137 ms
55,412 KB
testcase_41 AC 137 ms
55,640 KB
testcase_42 AC 139 ms
55,548 KB
testcase_43 AC 139 ms
55,416 KB
testcase_44 AC 137 ms
55,416 KB
testcase_45 AC 138 ms
55,640 KB
testcase_46 AC 138 ms
55,588 KB
testcase_47 AC 135 ms
55,748 KB
testcase_48 AC 136 ms
55,828 KB
testcase_49 AC 138 ms
55,420 KB
testcase_50 AC 140 ms
55,712 KB
testcase_51 AC 135 ms
55,748 KB
testcase_52 AC 138 ms
55,764 KB
testcase_53 AC 139 ms
55,888 KB
testcase_54 AC 139 ms
55,776 KB
testcase_55 AC 218 ms
58,716 KB
testcase_56 AC 235 ms
61,088 KB
testcase_57 AC 228 ms
60,828 KB
testcase_58 AC 217 ms
58,936 KB
testcase_59 AC 217 ms
61,240 KB
testcase_60 AC 222 ms
59,052 KB
testcase_61 AC 230 ms
61,060 KB
testcase_62 AC 227 ms
60,844 KB
testcase_63 AC 205 ms
60,984 KB
testcase_64 AC 222 ms
56,676 KB
testcase_65 AC 240 ms
61,300 KB
testcase_66 AC 207 ms
60,612 KB
testcase_67 AC 225 ms
60,764 KB
testcase_68 AC 229 ms
61,236 KB
testcase_69 AC 214 ms
61,044 KB
testcase_70 AC 226 ms
60,576 KB
testcase_71 AC 222 ms
58,400 KB
testcase_72 AC 241 ms
60,868 KB
testcase_73 AC 237 ms
61,088 KB
testcase_74 AC 209 ms
61,156 KB
testcase_75 AC 247 ms
60,956 KB
testcase_76 AC 232 ms
61,116 KB
testcase_77 AC 224 ms
58,396 KB
testcase_78 AC 218 ms
58,860 KB
testcase_79 AC 209 ms
59,048 KB
testcase_80 AC 232 ms
61,220 KB
testcase_81 AC 234 ms
61,448 KB
testcase_82 AC 229 ms
61,396 KB
testcase_83 AC 249 ms
61,404 KB
testcase_84 AC 231 ms
60,980 KB
testcase_85 AC 165 ms
56,556 KB
testcase_86 AC 238 ms
61,636 KB
testcase_87 AC 244 ms
61,440 KB
testcase_88 AC 200 ms
59,048 KB
testcase_89 AC 246 ms
61,712 KB
testcase_90 AC 192 ms
58,796 KB
testcase_91 AC 246 ms
61,456 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package No400番台;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";

	public static void main(String[] args) throws Exception {
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);

		solver();
		out.flush();
	}

	static long nl() {
		try {
			long num = 0;
			boolean minus = false;
			while ((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'))
				;
			if (num == '-') {
				num = 0;
				minus = true;
			} else {
				num -= '0';
			}

			while (true) {
				int b = is.read();
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}

	static char nc() {
		try {
			int b = skip();
			if (b == -1)
				return 0;
			return (char) b;
		} catch (IOException e) {
		}
		return 0;
	}

	static double nd() {
		try {
			return Double.parseDouble(ns());
		} catch (Exception e) {
		}
		return 0;
	}

	static String ns() {
		try {
			int b = skip();
			StringBuilder sb = new StringBuilder();
			if (b == -1)
				return "";
			sb.append((char) b);
			while (true) {
				b = is.read();
				if (b == -1)
					return sb.toString();
				if (b <= ' ')
					return sb.toString();
				sb.append((char) b);
			}
		} catch (IOException e) {
		}
		return "";
	}

	public static char[] ns(int n) {
		char[] buf = new char[n];
		try {
			int b = skip(), p = 0;
			if (b == -1)
				return null;
			buf[p++] = (char) b;
			while (p < n) {
				b = is.read();
				if (b == -1 || b <= ' ')
					break;
				buf[p++] = (char) b;
			}
			return Arrays.copyOf(buf, p);
		} catch (IOException e) {
		}
		return null;
	}

	public static byte[] nse(int n) {
		byte[] buf = new byte[n];
		try {
			int b = skip();
			if (b == -1)
				return null;
			is.read(buf);
			return buf;
		} catch (IOException e) {
		}
		return null;
	}

	static int skip() throws IOException {
		int b;
		while ((b = is.read()) != -1 && !(b >= 33 && b <= 126))
			;
		return b;
	}

	static boolean eof() {
		try {
			is.mark(1000);
			int b = skip();
			is.reset();
			return b == -1;
		} catch (IOException e) {
			return true;
		}
	}

	static int ni() {
		try {
			int num = 0;
			boolean minus = false;
			while ((num = is.read()) != -1 && !((num >= '0' && num <= '9') || num == '-'))
				;
			if (num == '-') {
				num = 0;
				minus = true;
			} else {
				num -= '0';
			}

			while (true) {
				int b = is.read();
				if (b >= '0' && b <= '9') {
					num = num * 10 + (b - '0');
				} else {
					return minus ? -num : num;
				}
			}
		} catch (IOException e) {
		}
		return -1;
	}

	static void solver() {
		Scanner sc = new Scanner(System.in);
		int n = ni();// the duration
		long a = nl();// the effet of fasting
		long b = nl();// the effect of stress
		long w = nl();// current weight
		long[] d = new long[n];
		for (int i = 0; i < n; i++) {
			d[i] = nl();
		}
		/*
		 * F[0]=W F[k]=D[k]+min(F[i]+(k-i-1)*(k-i)/2*B-(k-i-1)*A) (0<=i<=k-1)
		 * 
		 * answer:min(F[i]-(n-i)*A+1/2*(n-i)(n-i+1)*B) (0<=i<=n)
		 * 
		 * F[k]=D[k]-(k-1)*A+(k-1)*k/2*B+min(F[i]+-ikB+i*(i+1)/2*B+iA)
		 */
		int[] deq = new int[n + 3];
		long[] F = new long[n + 1];
		F[0] = w;

		int s = 0;
		int t = 1;
		for (int i = 1; i <= n; i++) {
			while (s + 1 < t && f(deq[s], i, d, b, a, F) >= f(deq[s + 1], i, d, b, a, F))
				s++;
			F[i] = f(deq[s], i, d, b, a, F) + (long)d[i - 1] - (long)(i - 1) *(long) a + ((long)i * (long)i - (long)i) / 2 * (long)b;
			while (s + 1 < t && check(deq[t - 2], deq[t - 1], i, b, F, a))
				t--;
			deq[t++] = i;
		}
		long ans = 1L << 60;
		for (int i = 0; i <= n; i++) {
			long D = n - i;
			ans = Math.min(ans, F[i] + (long) b * ((long) D + 1L) * (long) D / 2 - (long) a * (long) D);
		}
		System.out.println(ans);

	}

	static class Pair {
		long a, b;

		Pair(long a, long b) {
			this.a = a;
			this.b = b;
		}
	}

	static boolean check(int k1, int k2, int k3, long b, long[] F, long a) {
		long a1 = -(long) k1 * (long) b;
		long a2 = -(long) k2 * (long) b;
		long a3 = -(long) k3 * (long) b;
		long b1 = F[k1] + (long) k1 * (long) a + ((long) k1 * (long) k1 + (long) k1) / 2 * (long) b;
		long b2 = F[k2] + (long) k2 * (long) a + ((long) k2 * (long) k2 + (long) k2) / 2 * (long) b;
		long b3 = F[k3] + (long) k3 * (long) a + ((long) k3 * (long) k3 + (long) k3) / 2 * (long) b;
		return ( a2 - a1) * ( b3 - b1) >= (b1 - b2) * ( a1 -  a3);

	}

	static long f(int j, long x, long[] d, long b, long a, long[] F) {
		return -(long) j * (long) b * (long) x + F[j] + (long) j * (long) a
				+ ((long) j * (long) j + (long) j) / 2 * (long) b;
	}

	static void tr(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}
}
0