結果

問題 No.475 最終日 - Writerの怠慢
ユーザー uwiuwi
提出日時 2016-12-25 00:09:10
言語 Java21
(openjdk 21)
結果
AC  
実行時間 194 ms / 2,000 ms
コード長 3,615 bytes
コンパイル時間 4,142 ms
コンパイル使用メモリ 87,472 KB
実行使用メモリ 41,776 KB
最終ジャッジ日時 2024-06-06 10:42:32
合計ジャッジ時間 7,400 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 126 ms
40,648 KB
testcase_01 AC 125 ms
40,388 KB
testcase_02 AC 128 ms
40,876 KB
testcase_03 AC 142 ms
40,856 KB
testcase_04 AC 188 ms
41,776 KB
testcase_05 AC 185 ms
41,296 KB
testcase_06 AC 191 ms
41,316 KB
testcase_07 AC 187 ms
41,668 KB
testcase_08 AC 182 ms
41,668 KB
testcase_09 AC 194 ms
41,632 KB
testcase_10 AC 193 ms
41,620 KB
testcase_11 AC 188 ms
41,700 KB
testcase_12 AC 185 ms
41,308 KB
testcase_13 AC 88 ms
38,692 KB
testcase_14 AC 55 ms
36,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 N475 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), s = ni();
		int wid = ni();
		int[] a = na(n);
		int b = a[wid]+100*s;
		int[] f = new int[n];
		for(int i = 0;i < n;i++){
			if(i == wid)continue;
			if(a[i]+(50*s+500*s/(8+2*(n-1))) > b){
				out.println(0);
				return;
			}
			int low = 0, high = n;
			while(high - low > 1){
				int h = high+low>>>1;
				int plus = 50*s+500*s/(8+2*h);
				if(a[i] + plus > b){
					low = h;
				}else{
					high = h;
				}
			}
			f[low]++;
		}
		double P = 1;
		int ok = f[0];
		for(int i = 1;i <= n-1;i++){
			P = P * (double)ok / (n-i);
			ok--;
			ok += f[i];
		}
		out.printf("%.14f\n", P);
	}
	
	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 N475().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