結果

問題 No.174 カードゲーム（Hard）
ユーザー uwiuwi
提出日時 2015-03-27 00:58:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 455 ms / 2,000 ms
コード長 3,881 bytes
コンパイル時間 4,120 ms
コンパイル使用メモリ 83,756 KB
実行使用メモリ 65,268 KB
最終ジャッジ日時 2023-09-21 02:40:47
合計ジャッジ時間 9,099 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 122 ms
56,272 KB
testcase_01 AC 122 ms
56,092 KB
testcase_02 AC 453 ms
65,200 KB
testcase_03 AC 450 ms
65,116 KB
testcase_04 AC 449 ms
64,916 KB
testcase_05 AC 455 ms
64,896 KB
testcase_06 AC 453 ms
65,268 KB
testcase_07 AC 452 ms
64,908 KB
testcase_08 AC 450 ms
64,900 KB
testcase_09 AC 454 ms
65,156 KB
testcase_10 AC 120 ms
56,032 KB
testcase_11 AC 121 ms
56,284 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q4xx;

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 Q326_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	double[][] makeT(int n, double pa)
	{
		double[][] t = new double[n][n];
		double[] dp = new double[1<<n];
		dp[(1<<n)-1] = 1;
		for(int i = (1<<n)-1;i >= 1;i--){
			int bc = Integer.bitCount(i);
			if(bc > 1){
				int u = Integer.numberOfTrailingZeros(i);
				dp[i^1<<u] += dp[i] * pa;
				t[n-bc][u] += dp[i] * pa;
				for(int j = 0;j < n;j++){
					if(i<<~j<0 && j != u){
						dp[i^1<<j] += dp[i] * (1-pa) / (bc-1);
						t[n-bc][j] += dp[i] * (1-pa) / (bc-1);
					}
				}
			}else{
				int u = Integer.numberOfTrailingZeros(i);
				dp[i^1<<u] += dp[i];
				t[n-bc][u] += dp[i];
			}
		}
		return t;
	}
	
	void solve()
	{
		int n = ni();
		double pa = nd(), pb = nd();
		int[] a = na(n);
		int[] b = na(n);
		Arrays.sort(a);
		Arrays.sort(b);
		
		double[][] ta = makeT(n, pa);
		double[][] tb = makeT(n, pb);
		
		double E = 0;
		for(int i = 0;i < n;i++){
			double qb = 0;
			double scb = 0;
			int p = 0;
			for(int j = 0;j < n;j++){
				while(p < n && a[j] > b[p]){
					qb += tb[i][p];
					scb += tb[i][p] * b[p];
					p++;
				}
				E += ta[i][j] * (a[j] * qb + scb);
			}
		}
		out.printf("%.12f\n", E);
	}

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