結果

問題 No.472 平均順位
コンテスト
ユーザー Grenache
提出日時 2016-12-22 19:00:12
言語 Java
(openjdk 23)
結果
AC  
実行時間 631 ms / 2,000 ms
コード長 5,194 bytes
コンパイル時間 3,551 ms
コンパイル使用メモリ 79,832 KB
実行使用メモリ 56,316 KB
最終ジャッジ日時 2024-12-17 14:18:35
合計ジャッジ時間 9,614 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 16
権限があれば一括ダウンロードができます

ソースコード

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[2][p + 1];
		Arrays.fill(dp[0], INF);
//		Arrays.fill(dp[1], INF);

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

		for (int i = 0; i < n - 1; i++) {
			int ci = (i) % 2;
			int ni = (i + 1) % 2;
			Arrays.fill(dp[ni], INF);

			for (int j = 0; j <= p; j++) {
				if (j > (n - 1 - i) * 3) {
					break;
				}

				dp[ni][j] = Math.min(dp[ni][j], dp[ci][j] + a[i + 1]);
				if (j - 3 >= 0) {
					dp[ni][j - 3] = Math.min(dp[ni][j - 3], dp[ci][j] + 1);
					dp[ni][j - 2] = Math.min(dp[ni][j - 2], dp[ci][j] + c[i + 1]);
					dp[ni][j - 1] = Math.min(dp[ni][j - 1], dp[ci][j] + b[i + 1]);
				} else if (j - 2 >= 0) {
					dp[ni][j - 2] = Math.min(dp[ni][j - 2], dp[ci][j] + c[i + 1]);
					dp[ni][j - 1] = Math.min(dp[ni][j - 1], dp[ci][j] + b[i + 1]);
				} else if (j - 1 >= 0) {
					dp[ni][j - 1] = Math.min(dp[ni][j - 1], dp[ci][j] + b[i + 1]);
				}
			}
		}

		pr.printf("%.6f\n", (double)dp[(n - 1) % 2][0] / 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