結果

問題 No.155 生放送とBGM
ユーザー uwiuwi
提出日時 2015-02-18 01:01:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 385 ms / 6,000 ms
コード長 4,466 bytes
コンパイル時間 4,357 ms
コンパイル使用メモリ 83,692 KB
実行使用メモリ 66,348 KB
最終ジャッジ日時 2023-09-06 01:54:56
合計ジャッジ時間 8,460 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 384 ms
66,276 KB
testcase_01 AC 382 ms
66,268 KB
testcase_02 AC 378 ms
66,348 KB
testcase_03 AC 66 ms
50,336 KB
testcase_04 AC 225 ms
59,572 KB
testcase_05 AC 131 ms
56,204 KB
testcase_06 AC 385 ms
65,976 KB
testcase_07 AC 153 ms
55,648 KB
testcase_08 AC 135 ms
55,408 KB
testcase_09 AC 172 ms
56,396 KB
testcase_10 AC 139 ms
55,856 KB
testcase_11 AC 174 ms
56,560 KB
testcase_12 AC 177 ms
56,712 KB
testcase_13 AC 149 ms
55,500 KB
testcase_14 AC 322 ms
65,868 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q1xx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q183_2 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		int n = ni(), L = ni()*60;
		int[] len = new int[n];
		int sum = 0;
		for(int i = 0;i < n;i++){
			len[i] = ni()*60+ni();
			sum += len[i];
		}
		if(L >= sum){
			out.println(n);
			return;
		}
		
		double[] f = new double[60];
		f[0] = 1;
		for(int i = 1;i < 60;i++)f[i] = f[i-1] * i;
		int Q = Math.min(3600*n, L+3600);
		
		long[][] dp = new long[n+1][Q+1];
		dp[0][0] = 1;
		for(int i = 0;i < n;i++){
			for(int j = i;j >= 0;j--){
				for(int k = Q-len[i];k >= 0;k--){
					int nj = j+1;
					int nk = k+len[i];
					dp[nj][nk] += dp[j][k];
				}
			}
		}
		
		double ret = 0;
		double e = 0;
		for(int last = 0;last < n;last++){
			for(int j = 0;j <= n-1;j++){
				for(int k = 0;k <= 3600*n-len[last] && k <= L-1;k++){
					int nj = j+1;
					int nk = k+len[last];
					dp[nj][nk] -= dp[j][k];
				}
			}
			for(int i = 0;i < n;i++){
				long sumk = 0;
				for(int k = L-1;k >= L-len[last] && k >= 0;k--){
					sumk += dp[i][k];
				}
				e += (double)(i+1)*sumk*f[i]*f[n-1-i];
			}
			for(int j = n-1;j >= 0;j--){
				for(int k = Math.min(L-1, 3600*n-len[last]);k >= 0;k--){
					int nj = j+1;
					int nk = k+len[last];
					dp[nj][nk] += dp[j][k];
				}
			}
		}
		out.printf("%.12f\n", e/f[n]+ret);
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private static char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private static char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0