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

提出ソース

結果

問題	No.409 ダイエット
ユーザー	tutuz
提出日時	2019-02-18 16:10:50
言語	Java21 (openjdk 21)
結果	WA
実行時間	-
コード長	6,184 bytes
コンパイル時間	2,442 ms
コンパイル使用メモリ	80,280 KB
実行使用メモリ	63,256 KB
最終ジャッジ日時	2024-04-16 08:18:21
合計ジャッジ時間	16,344 ms
ジャッジサーバーID （参考情報）	judge4 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	59 ms 50,348 KB
testcase_01	AC	55 ms 50,112 KB
testcase_02	AC	54 ms 50,292 KB
testcase_03	AC	54 ms 50,344 KB
testcase_04	AC	55 ms 50,436 KB
testcase_05	AC	54 ms 50,128 KB
testcase_06	AC	54 ms 50,168 KB
testcase_07	AC	54 ms 50,136 KB
testcase_08	AC	54 ms 50,492 KB
testcase_09	AC	55 ms 50,288 KB
testcase_10	AC	54 ms 50,440 KB
testcase_11	AC	55 ms 50,052 KB
testcase_12	WA	-
testcase_13	AC	54 ms 50,140 KB
testcase_14	AC	56 ms 50,452 KB
testcase_15	AC	56 ms 49,820 KB
testcase_16	AC	56 ms 50,324 KB
testcase_17	AC	55 ms 50,312 KB
testcase_18	AC	55 ms 50,436 KB
testcase_19	WA	-
testcase_20	AC	55 ms 50,064 KB
testcase_21	AC	55 ms 49,992 KB
testcase_22	AC	56 ms 50,116 KB
testcase_23	AC	55 ms 50,384 KB
testcase_24	AC	55 ms 50,356 KB
testcase_25	AC	55 ms 50,372 KB
testcase_26	AC	54 ms 49,988 KB
testcase_27	AC	54 ms 50,052 KB
testcase_28	AC	54 ms 49,964 KB
testcase_29	AC	54 ms 50,108 KB
testcase_30	AC	54 ms 50,172 KB
testcase_31	AC	54 ms 50,244 KB
testcase_32	AC	56 ms 50,456 KB
testcase_33	AC	55 ms 50,300 KB
testcase_34	AC	56 ms 50,420 KB
testcase_35	AC	68 ms 50,536 KB
testcase_36	AC	65 ms 50,200 KB
testcase_37	AC	69 ms 50,716 KB
testcase_38	AC	65 ms 50,504 KB
testcase_39	AC	65 ms 50,680 KB
testcase_40	WA	-
testcase_41	AC	65 ms 50,472 KB
testcase_42	AC	64 ms 50,548 KB
testcase_43	AC	66 ms 50,336 KB
testcase_44	AC	65 ms 50,548 KB
testcase_45	AC	66 ms 50,124 KB
testcase_46	AC	67 ms 50,504 KB
testcase_47	AC	65 ms 50,528 KB
testcase_48	AC	66 ms 50,200 KB
testcase_49	AC	67 ms 50,588 KB
testcase_50	AC	70 ms 49,992 KB
testcase_51	AC	66 ms 50,564 KB
testcase_52	AC	67 ms 50,408 KB
testcase_53	AC	65 ms 50,700 KB
testcase_54	AC	63 ms 50,360 KB
testcase_55	WA	-
testcase_56	AC	188 ms 61,344 KB
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	WA	-
testcase_61	WA	-
testcase_62	WA	-
testcase_63	WA	-
testcase_64	WA	-
testcase_65	WA	-
testcase_66	WA	-
testcase_67	WA	-
testcase_68	WA	-
testcase_69	WA	-
testcase_70	WA	-
testcase_71	WA	-
testcase_72	WA	-
testcase_73	WA	-
testcase_74	WA	-
testcase_75	WA	-
testcase_76	WA	-
testcase_77	WA	-
testcase_78	WA	-
testcase_79	WA	-
testcase_80	WA	-
testcase_81	WA	-
testcase_82	WA	-
testcase_83	WA	-
testcase_84	WA	-
testcase_85	AC	90 ms 52,244 KB
testcase_86	WA	-
testcase_87	WA	-
testcase_88	WA	-
testcase_89	WA	-
testcase_90	WA	-
testcase_91	WA	-

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

ソースコード

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++) {
				dp[i] = cht.query(i-1) - (i-1) * a + (long)(i-1) * i / 2 * b + d[i-1];
				cht.addLine(-i * b, dp[i] + i * a + (long)(i - 1) * i / 2 * b);
			}

			long ans = LINF;
			for (int i = 0; i < n+1; i++) {
				ans = Math.min(ans, dp[i] - (n - i) * a + (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

結果

テストケース

ソースコード