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

提出ソース

結果

問題	No.409 ダイエット
ユーザー	tutuz
提出日時	2019-02-18 15:15:50
言語	Java21 (openjdk 21)
結果	MLE
実行時間	-
コード長	5,315 bytes
コンパイル時間	2,736 ms
コンパイル使用メモリ	90,008 KB
実行使用メモリ	762,520 KB
最終ジャッジ日時	2024-10-06 16:19:18
合計ジャッジ時間	43,313 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	61 ms 38,256 KB
testcase_01	AC	58 ms 37,696 KB
testcase_02	AC	62 ms 37,948 KB
testcase_03	AC	67 ms 37,896 KB
testcase_04	AC	59 ms 37,244 KB
testcase_05	AC	61 ms 38,024 KB
testcase_06	AC	63 ms 37,504 KB
testcase_07	AC	60 ms 37,744 KB
testcase_08	AC	59 ms 37,552 KB
testcase_09	AC	56 ms 37,644 KB
testcase_10	AC	56 ms 37,784 KB
testcase_11	AC	57 ms 37,420 KB
testcase_12	AC	60 ms 38,188 KB
testcase_13	AC	65 ms 37,788 KB
testcase_14	AC	62 ms 37,744 KB
testcase_15	AC	60 ms 37,560 KB
testcase_16	AC	59 ms 37,548 KB
testcase_17	AC	60 ms 38,316 KB
testcase_18	AC	58 ms 37,604 KB
testcase_19	AC	62 ms 38,040 KB
testcase_20	AC	63 ms 38,256 KB
testcase_21	AC	59 ms 37,828 KB
testcase_22	AC	58 ms 37,696 KB
testcase_23	AC	61 ms 37,660 KB
testcase_24	AC	63 ms 37,952 KB
testcase_25	AC	59 ms 37,444 KB
testcase_26	AC	58 ms 37,604 KB
testcase_27	AC	59 ms 37,888 KB
testcase_28	AC	60 ms 38,088 KB
testcase_29	AC	60 ms 37,996 KB
testcase_30	AC	58 ms 37,740 KB
testcase_31	AC	60 ms 37,544 KB
testcase_32	AC	58 ms 37,632 KB
testcase_33	AC	57 ms 37,680 KB
testcase_34	AC	59 ms 37,548 KB
testcase_35	AC	157 ms 101,624 KB
testcase_36	AC	162 ms 102,368 KB
testcase_37	AC	160 ms 101,932 KB
testcase_38	AC	160 ms 101,996 KB
testcase_39	AC	159 ms 102,548 KB
testcase_40	AC	162 ms 101,940 KB
testcase_41	AC	184 ms 122,728 KB
testcase_42	AC	183 ms 123,064 KB
testcase_43	AC	160 ms 100,668 KB
testcase_44	AC	158 ms 101,720 KB
testcase_45	AC	163 ms 100,608 KB
testcase_46	AC	179 ms 120,688 KB
testcase_47	AC	163 ms 101,548 KB
testcase_48	AC	161 ms 102,308 KB
testcase_49	AC	185 ms 122,376 KB
testcase_50	AC	161 ms 101,208 KB
testcase_51	AC	163 ms 102,384 KB
testcase_52	AC	182 ms 122,576 KB
testcase_53	AC	183 ms 122,828 KB
testcase_54	AC	156 ms 101,996 KB
testcase_55	MLE	-
testcase_56	MLE	-
testcase_57	MLE	-
testcase_58	MLE	-
testcase_59	MLE	-
testcase_60	MLE	-
testcase_61	MLE	-
testcase_62	MLE	-
testcase_63	MLE	-
testcase_64	MLE	-
testcase_65	MLE	-
testcase_66	MLE	-
testcase_67	MLE	-
testcase_68	MLE	-
testcase_69	MLE	-
testcase_70	MLE	-
testcase_71	MLE	-
testcase_72	MLE	-
testcase_73	MLE	-
testcase_74	MLE	-
testcase_75	MLE	-
testcase_76	MLE	-
testcase_77	MLE	-
testcase_78	MLE	-
testcase_79	MLE	-
testcase_80	MLE	-
testcase_81	MLE	-
testcase_82	MLE	-
testcase_83	MLE	-
testcase_84	MLE	-
testcase_85	MLE	-
testcase_86	MLE	-
testcase_87	MLE	-
testcase_88	MLE	-
testcase_89	MLE	-
testcase_90	MLE	-
testcase_91	MLE	-

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

ソースコード

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(), a = in.nextInt(), b = in.nextInt(), w = in.nextInt();
			long[] d = in.nextLongArray(n);

			long[][] dp = new long[n+1][n+1];
			fill(dp, -LINF);

			dp[0][0] = 0;
			for (int i = 0; i < n; i++) {
				for (int j = 0; j <= i; j++) {
					dp[i+1][0] = Math.max(dp[i+1][0], dp[i][j] - d[i]);
					dp[i+1][j+1] = Math.max(dp[i+1][j+1], dp[i][j] + a - b * (j+1));
				}
			}

			out.println(w - Arrays.stream(dp[n]).max().getAsLong());
		}
	}

	static void fill(long[][] a, long v) {
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[0].length; j++) {
				a[i][j] = v;
			}
		}
	}

	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

結果

テストケース

ソースコード