結果

問題 No.472 平均順位
ユーザー uwi
提出日時 2016-12-22 00:06:46
言語 Java8
(openjdk 1.8.0.191)
結果
AC  
実行時間 1,017 ms
コード長 3,458 Byte
コンパイル時間 2,713 ms
使用メモリ 36,672 KB
最終ジャッジ日時 2019-07-17 07:10:38

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
0_sample1 AC 112 ms
32,680 KB
0_sample2 AC 110 ms
33,852 KB
0_sample3 AC 109 ms
31,932 KB
0_sample4 AC 111 ms
31,812 KB
1_randsmall AC 115 ms
31,972 KB
1_randsmall1 AC 110 ms
30,056 KB
1_randsmall2 AC 113 ms
31,992 KB
1_randsmall3 AC 125 ms
31,844 KB
1_randsmall4 AC 152 ms
34,124 KB
2_randmid1 AC 170 ms
34,648 KB
2_randmid2 AC 163 ms
34,388 KB
2_randmid3 AC 223 ms
35,520 KB
2_randmid4 AC 203 ms
36,672 KB
3_randmax AC 344 ms
34,648 KB
3_randmax1 AC 873 ms
35,464 KB
3_randmax2 AC 338 ms
35,520 KB
3_randmax3 AC 979 ms
35,520 KB
4_maxmax AC 1,017 ms
34,640 KB
system_test1.txt AC 200 ms
32,896 KB
system_test2.txt AC 245 ms
34,652 KB
テストケース一括ダウンロード

ソースコード

diff #
package adv2016;
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 N472 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), P = ni();
		int[] dp = new int[P+1];
		Arrays.fill(dp, 999999999);
		dp[0] = 0;
		for(int i = 0;i < n;i++){
			int[] a = na(3);
			int[] ndp = new int[P+1];
			Arrays.fill(ndp, 999999999);
			for(int j = P;j >= 0;j--){
				for(int k = 3;k >= 0;k--){
					if(j+k <= P){
						int v = k == 3 ? 1 : a[k];
						ndp[j+k] = Math.min(ndp[j+k], dp[j] + v);
					}
				}
			}
			dp = ndp;
		}
		out.printf("%.14f\n", (double)dp[P]/n);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new N472().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private 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 boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private 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 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 int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private 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 int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private 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) { System.out.println(Arrays.deepToString(o)); }
}
0