結果

問題 No.248 ミラー君の宿題
ユーザー uwiuwi
提出日時 2015-07-20 14:21:49
言語 Java21
(openjdk 21)
結果
AC  
実行時間 398 ms / 5,000 ms
コード長 4,923 bytes
コンパイル時間 3,717 ms
コンパイル使用メモリ 88,364 KB
実行使用メモリ 65,356 KB
最終ジャッジ日時 2023-09-22 20:34:13
合計ジャッジ時間 10,325 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 281 ms
64,004 KB
testcase_01 AC 266 ms
61,040 KB
testcase_02 AC 276 ms
63,324 KB
testcase_03 AC 296 ms
64,996 KB
testcase_04 AC 326 ms
65,356 KB
testcase_05 AC 226 ms
61,836 KB
testcase_06 AC 281 ms
61,592 KB
testcase_07 AC 284 ms
62,620 KB
testcase_08 AC 185 ms
60,592 KB
testcase_09 AC 393 ms
63,744 KB
testcase_10 AC 398 ms
63,728 KB
testcase_11 AC 300 ms
62,924 KB
testcase_12 AC 284 ms
61,720 KB
testcase_13 AC 338 ms
64,492 KB
testcase_14 AC 359 ms
63,992 KB
testcase_15 AC 395 ms
63,840 KB
testcase_16 AC 351 ms
64,824 KB
testcase_17 AC 248 ms
60,512 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q5xx;

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 Q580_4 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		double[] twos = new double[1000];
		twos[0] = 1;
		for(int i = 1;i < 1000;i++){
			twos[i] = twos[i-1] * 2;
		}
		
		for(int T = ni();T >= 1;T--){
			int n = ni();
			long[] ps = new long[n];
			for(int i = 0;i < n;i++)ps[i] = nl();
			long[] qs = new long[n];
			int[] hs = new int[n];
			for(int i = 0;i < n;i++){
				qs[i] = ps[i]-1;
				while(qs[i] % 2 == 0){
					qs[i] /= 2;
					hs[i]++;
				}
			}
			
			int[] rems = new int[1<<n];
			for(int i = 0;i < 1<<n;i++){
				int rem = 99;
				for(int j = 0;j < n;j++){
					if(i<<~j<0)rem = Math.min(rem, hs[j]);
				}
				rems[i] = rem;
			}
			
			double[] E = new double[1<<n];
			for(int i = 1;i < 1<<n;i++){
				if(Integer.bitCount(i) == 1){
					E[i] = 1;
				}else{
					double xt = 1;
					double m = 1;
					int[] lh = new int[64];
					for(int j = 0;j < n;j++){
						if(i<<~j<0){
							xt = xt * qs[j];
							m = m * ps[j];
							lh[hs[j]]++;
						}
					}
					double[] vh = new double[64];
					double last = 0;
					for(int j = 63;j >= 0;j--){
						if(lh[j] == 0)continue;
						int[] es = new int[j+1];
						es[1] = Integer.bitCount(i);
						for(int k = 0;k < j-1;k++)es[k+1] -= lh[k];
						for(int k = 1;k < j;k++)es[k] += es[k-1];
						for(int k = 1;k < j;k++)es[k] += es[k-1];
						for(int k = 1;k < j;k++)vh[j] += twos[es[k]];//Math.pow(2, es[k]);
						vh[j]++;
						vh[j] *= xt;
						last = vh[j];
					}
					double e = 0;
					double w = 1;
					for(int k = 0;k < n;k++){
						if(i<<~k<0){
							if((i-1&i)<<~k<0){
								w /= ps[k];
							}else{
								w *= 1.-1./ps[k];
							}
						}
					}
					for(int j = i-1&i;j > 0;j=j-1&i){ 
						int rem = rems[i^j];
						e += (E[j] + E[i^j]) * vh[rem] / m;
						e += (E[j] + E[i^j]) * w;
						
						for(int x = j&~(j-1&i);x != 0;x &= x-1){ // disappeared
							int k = Integer.numberOfTrailingZeros(x);
							w *= ps[k]-1;
						}
						for(int x = (j-1&i)&~j;x != 0;x &= x-1){ // appeared
							int k = Integer.numberOfTrailingZeros(x);
							w /= ps[k]-1;
						}
					} // not include j=0
					
					E[i] = (e+1) / (1. - (xt+last+1)/m);
				}
			}
			out.printf("%.9f\n", E[(1<<n)-1]);
		}
	}
	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q580_4().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private 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 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