結果

問題 No.472 平均順位
ユーザー GrenacheGrenache
提出日時 2016-12-22 18:44:33
言語 Java21
(openjdk 21)
結果
MLE  
実行時間 -
コード長 4,885 bytes
コンパイル時間 3,936 ms
コンパイル使用メモリ 79,336 KB
実行使用メモリ 541,124 KB
最終ジャッジ日時 2024-05-08 11:13:56
合計ジャッジ時間 11,104 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 122 ms
60,880 KB
testcase_01 AC 126 ms
53,676 KB
testcase_02 AC 125 ms
53,848 KB
testcase_03 AC 122 ms
54,212 KB
testcase_04 AC 130 ms
54,340 KB
testcase_05 AC 121 ms
53,948 KB
testcase_06 AC 115 ms
52,804 KB
testcase_07 AC 139 ms
53,868 KB
testcase_08 AC 175 ms
58,768 KB
testcase_09 AC 220 ms
67,096 KB
testcase_10 AC 206 ms
63,168 KB
testcase_11 AC 357 ms
115,984 KB
testcase_12 AC 301 ms
86,824 KB
testcase_13 AC 661 ms
194,388 KB
testcase_14 MLE -
testcase_15 -- -
testcase_16 -- -
testcase_17 -- -
testcase_18 -- -
testcase_19 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder472 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int p = sc.nextInt();

		int[] a = new int[n];
		int[] b = new int[n];
		int[] c = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = sc.nextInt();
			b[i] = sc.nextInt();
			c[i] = sc.nextInt();
		}

		final long INF = Long.MAX_VALUE / 2;
		long[][] dp = new long[p + 1][n];
		for (int i = 0; i <= p; i++) {
			Arrays.fill(dp[i], INF);
		}

		dp[p][0] = a[0];
		if (p - 1 >= 0) {
			dp[p - 1][0] = b[0];
		}
		if (p - 2 >= 0) {
			dp[p - 2][0] = c[0];
		}
		if (p - 3 >= 0) {
			dp[p - 3][0] = 1;
		}

		for (int i = 0; i < n - 1; i++) {
			for (int j = 0; j <= p; j++) {
				dp[j][i + 1] = Math.min(dp[j][i + 1], dp[j][i] + a[i + 1]);
				if (j - 1 >= 0) {
					dp[j - 1][i + 1] = Math.min(dp[j - 1][i + 1], dp[j][i] + b[i + 1]);
				}
				if (j - 2 >= 0) {
					dp[j - 2][i + 1] = Math.min(dp[j - 2][i + 1], dp[j][i] + c[i + 1]);
				}
				if (j - 3 >= 0) {
					dp[j - 3][i + 1] = Math.min(dp[j - 3][i + 1], dp[j][i] + 1);
				}
			}
		}

		pr.printf("%.6f\n", (double)dp[0][n - 1] / n);
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(System.in);
		pr = new Printer(System.out);

		solve();

		pr.close();
		sc.close();
	}

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(PrintStream out) {
			super(out);
		}
	}
}
0