結果

問題 No.1151 チャレンジゲーム
コンテスト
ユーザー uwi
提出日時 2020-08-15 16:59:48
言語 Java
(openjdk 23)
結果
AC  
実行時間 279 ms / 2,000 ms
コード長 4,692 bytes
コンパイル時間 3,992 ms
コンパイル使用メモリ 82,748 KB
実行使用メモリ 49,120 KB
最終ジャッジ日時 2024-10-10 18:13:03
合計ジャッジ時間 16,546 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 50
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no1xxx;
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 No1152 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		
		int O = 0;
		for(int v : a){
			O += v;
		}
		O = O / 2 + 2;
		
		double[][][] P = new double[2][1<<n][2*O+1];
		for(int j = O+1;j <= 2*O;j++){
			P[0][0][j] = 1;
			P[1][0][j] = 1;
		}
		double[] r = new double[n];
		for(int k = 0;k < n;k++){
			r[k] = 1 - 1./a[k];
		}
		for(int i = 1;i < 1<<n;i++){
			int[] b = new int[Integer.bitCount(i)];
			int p = 0;
			for(int j = 0;j < n;j++){
				if(i<<~j<0){
					b[p++] = j;
				}
			}
			
			double[] h1 = new double[n];
			double[] h2 = new double[n];
			outer:
			for(int j = 0;j <= 2*O;j++){
				for(int k : b){
					h1[k] = ((j+a[k] <= 2*O ? P[1][i^1<<k][j+a[k]] : 1.)) / a[k];
					h2[k] = ((j-a[k] >= 0 ? P[0][i^1<<k][j-a[k]] : 0.)) / a[k];
				}
				for(int is = 0;is < b.length;is++){
					inner:
					for(int it = 0;it < b.length;it++){
						int s = b[is], t = b[it];
						// h1[s] + mi * r[s] = pl
						// h2[t] + pl * r[t] = mi
						// 1 - rs  hs
						// -rt 1   ht
						
						double pl = 1/(1-r[s]*r[t]) * (h1[s] + r[s] * h2[t]);
						double mi = 1/(1-r[s]*r[t]) * (h2[t] + r[t] * h1[s]);
						for(int k : b){
							if(pl < h1[k] + mi * r[k] - 1e-9){
								continue inner;
							}
							if(mi > h2[k] + pl * r[k] + 1e-9){
								continue inner;
							}
						}
						
						P[0][i][j] = pl;
						P[1][i][j] = mi;
						continue outer;
					}
				}
				assert false;
			}
		}
		out.printf("%.14f\n", P[0][(1<<n)-1][O]);
	}
	
	void run() throws Exception
	{
//		int n = 10, m = 99999;
//		Random gen = new Random();
//		StringBuilder sb = new StringBuilder();
//		sb.append(n + " ");
//		for (int i = 0; i < n; i++) {
//			sb.append(gen.nextInt(20)+1 + " ");
//		}
//		INPUT = sb.toString();

		
		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 No1152().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