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

提出ソース

結果

問題	No.409 ダイエット
ユーザー	tutuz
提出日時	2019-02-18 16:21:29
言語	Java21 (openjdk 21)
結果	AC
実行時間	232 ms / 2,000 ms
コード長	6,216 bytes
コンパイル時間	2,524 ms
コンパイル使用メモリ	87,052 KB
実行使用メモリ	50,484 KB
最終ジャッジ日時	2024-10-07 04:02:09
合計ジャッジ時間	15,266 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	46 ms 36,836 KB
testcase_01	AC	45 ms 36,976 KB
testcase_02	AC	46 ms 36,720 KB
testcase_03	AC	46 ms 36,720 KB
testcase_04	AC	47 ms 37,020 KB
testcase_05	AC	49 ms 36,932 KB
testcase_06	AC	51 ms 36,712 KB
testcase_07	AC	49 ms 37,036 KB
testcase_08	AC	51 ms 36,568 KB
testcase_09	AC	50 ms 37,080 KB
testcase_10	AC	49 ms 37,104 KB
testcase_11	AC	50 ms 37,172 KB
testcase_12	AC	49 ms 36,720 KB
testcase_13	AC	51 ms 37,120 KB
testcase_14	AC	50 ms 36,824 KB
testcase_15	AC	49 ms 36,552 KB
testcase_16	AC	49 ms 36,848 KB
testcase_17	AC	48 ms 36,840 KB
testcase_18	AC	49 ms 36,968 KB
testcase_19	AC	56 ms 36,960 KB
testcase_20	AC	51 ms 36,764 KB
testcase_21	AC	49 ms 36,824 KB
testcase_22	AC	46 ms 37,120 KB
testcase_23	AC	47 ms 37,120 KB
testcase_24	AC	47 ms 37,052 KB
testcase_25	AC	46 ms 36,700 KB
testcase_26	AC	47 ms 37,160 KB
testcase_27	AC	47 ms 37,084 KB
testcase_28	AC	49 ms 37,288 KB
testcase_29	AC	50 ms 36,848 KB
testcase_30	AC	52 ms 36,720 KB
testcase_31	AC	52 ms 37,020 KB
testcase_32	AC	50 ms 37,032 KB
testcase_33	AC	51 ms 37,160 KB
testcase_34	AC	50 ms 36,908 KB
testcase_35	AC	55 ms 36,800 KB
testcase_36	AC	57 ms 37,316 KB
testcase_37	AC	67 ms 37,344 KB
testcase_38	AC	55 ms 37,060 KB
testcase_39	AC	53 ms 36,968 KB
testcase_40	AC	66 ms 37,092 KB
testcase_41	AC	57 ms 37,240 KB
testcase_42	AC	58 ms 37,364 KB
testcase_43	AC	59 ms 37,288 KB
testcase_44	AC	60 ms 37,080 KB
testcase_45	AC	63 ms 37,316 KB
testcase_46	AC	64 ms 37,148 KB
testcase_47	AC	58 ms 37,296 KB
testcase_48	AC	60 ms 37,160 KB
testcase_49	AC	58 ms 37,184 KB
testcase_50	AC	58 ms 37,192 KB
testcase_51	AC	55 ms 37,232 KB
testcase_52	AC	59 ms 37,228 KB
testcase_53	AC	56 ms 37,232 KB
testcase_54	AC	55 ms 37,340 KB
testcase_55	AC	153 ms 45,844 KB
testcase_56	AC	192 ms 48,712 KB
testcase_57	AC	195 ms 49,080 KB
testcase_58	AC	149 ms 45,036 KB
testcase_59	AC	170 ms 45,360 KB
testcase_60	AC	137 ms 42,552 KB
testcase_61	AC	189 ms 47,844 KB
testcase_62	AC	193 ms 48,216 KB
testcase_63	AC	187 ms 47,688 KB
testcase_64	AC	154 ms 45,632 KB
testcase_65	AC	198 ms 47,980 KB
testcase_66	AC	190 ms 48,724 KB
testcase_67	AC	176 ms 46,556 KB
testcase_68	AC	168 ms 45,408 KB
testcase_69	AC	182 ms 47,448 KB
testcase_70	AC	212 ms 50,312 KB
testcase_71	AC	154 ms 45,632 KB
testcase_72	AC	225 ms 50,376 KB
testcase_73	AC	226 ms 49,508 KB
testcase_74	AC	205 ms 45,152 KB
testcase_75	AC	214 ms 48,832 KB
testcase_76	AC	202 ms 45,808 KB
testcase_77	AC	155 ms 45,400 KB
testcase_78	AC	193 ms 46,424 KB
testcase_79	AC	163 ms 44,944 KB
testcase_80	AC	232 ms 50,084 KB
testcase_81	AC	221 ms 49,596 KB
testcase_82	AC	212 ms 46,128 KB
testcase_83	AC	206 ms 46,316 KB
testcase_84	AC	203 ms 45,268 KB
testcase_85	AC	94 ms 39,648 KB
testcase_86	AC	197 ms 45,044 KB
testcase_87	AC	225 ms 50,484 KB
testcase_88	AC	136 ms 41,956 KB
testcase_89	AC	210 ms 46,104 KB
testcase_90	AC	134 ms 41,920 KB
testcase_91	AC	205 ms 46,636 KB

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

ソースコード

raw source code

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;

public class Main {

	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		MyInput in = new MyInput(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskX solver = new TaskX();
		solver.solve(1, in, out);
		out.close();
	}

	static int INF = 1 << 30;
	static long LINF = 1L << 55;
	static int MOD = 1000000007;
	static int[] mh4 = { 0, -1, 1, 0 };
	static int[] mw4 = { -1, 0, 0, 1 };
	static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
	static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };

	static class TaskX {

		public void solve(int testNumber, MyInput in, PrintWriter out) {

			int n = in.nextInt();
			long a = in.nextLong(), b = in.nextLong(), w = in.nextLong();
			long[] d = in.nextLongArray(n);

			ConvexHullTrick cht = new ConvexHullTrick(n + 100);
			long[] dp = new long[n+1];
			dp[0] = 0;

			for (int i = 1; i < n+1; i++) {
				int j = i -1;
				cht.addLine(-j * b, dp[j] + j * a + (long)(j + 1) * j / 2 * b);
				dp[i] = cht.query(i) - (i-1) * a + (long)(i-1) * i / 2 * b + d[i-1];
			}

			long ans = Long.MAX_VALUE;
			for (int i = 0; i < n+1; i++) {
				ans = Math.min(ans, dp[i] - (n - i) * a + (long)(n - i) * (n - i + 1) / 2 * b);
			}

			out.println(w + ans);

		}

		/**
		 * 追加クエリの直線の傾きが単調減少の場合
		 * - insert (a, b): add y = ax + b
		 * - query (x)    : min_i{a[i]x + b}
		 * */
		class ConvexHullTrick {
			long[] A, B;
			int len;

			public ConvexHullTrick(int n) {
				A = new long[n];
				B = new long[n];
			}

			private boolean check(long a, long b) {
				return (B[len - 2] - B[len - 1]) * (a - A[len - 1]) >= (B[len - 1] - b) * (A[len - 1] - A[len - 2]);
			}

			public void addLine(long a, long b) {
				while (len >= 2 && check(a, b)) {
					len--;
				}
				A[len] = a;
				B[len] = b;
				len++;
			}

			public long query(long x) {
				int l = -1, r = len;
				while (r - l > 1) {
					int mid = (r + l) / 2;
					if (get(mid, x) >= get(mid + 1, x)) {
						l = mid;
					} else {
						r = mid;
					}
				}
				return get(r, x);
			}

			private long get(int k, long x) {
				return A[k] * x + B[k];
			}
		}
	}

	static class MyInput {
		private final BufferedReader in;
		private static int pos;
		private static int 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 MyInput(InputStream is) {
			in = new BufferedReader(new InputStreamReader(is));
		}

		public int read() {
			if (pos >= readLen) {
				pos = 0;
				try {
					readLen = in.read(buffer);
				} catch (IOException e) {
					throw new RuntimeException();
				}
				if (readLen <= 0) {
					throw new MyInput.EndOfFileRuntimeException();
				}
			}
			return buffer[pos++];
		}

		public int nextInt() {
			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() {
			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() {
			while (true) {
				final int c = read();
				if (!isSpace[c]) {
					return (char) c;
				}
			}
		}

		public String nextString() {
			return new String(nextChars());
		}

		public char[] nextChars() {
			int len = 0;
			str[len++] = nextChar();
			len = reads(len, isSpace);
			return Arrays.copyOf(str, len);
		}

		public char[][] next2DChars(int h, int w) {
			char[][] s = new char[h][w];
			for (int i = 0; i < h; i++) {
				s[i] = nextChars();
			}
			return s;
		}

		int reads(int len, boolean[] accept) {
			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 (MyInput.EndOfFileRuntimeException e) {
			}
			return len;
		}

		public int[] nextIntArray(final int n) {
			final int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArray1Index(final int n) {
			final int[] res = new int[n + 1];
			for (int i = 1; i < n + 1; i++) {
				res[i] = nextInt();
			}
			return res;
		}

		public int[] nextIntArrayDec(final int n) {
			final int[] res = new int[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextInt() - 1;
			}
			return res;
		}

		public long[] nextLongArray(final int n) {
			final long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArray1Index(final int n) {
			final long[] res = new long[n + 1];
			for (int i = 1; i < n + 1; i++) {
				res[i] = nextLong();
			}
			return res;
		}

		public long[] nextLongArrayDec(final int n) {
			final long[] res = new long[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextLong() - 1;
			}
			return res;
		}

		public double nextDouble() {
			return Double.parseDouble(nextString());
		}

		public double[] nextDoubleArray(int n) {
			double[] res = new double[n];
			for (int i = 0; i < n; i++) {
				res[i] = nextDouble();
			}
			return res;
		}

		static class EndOfFileRuntimeException extends RuntimeException {
		}

	}

}

yukicoder

結果

テストケース

ソースコード