結果

問題 No.173 カードゲーム（Medium）
ユーザー ぴろずぴろず
提出日時 2015-03-27 00:25:05
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,364 bytes
コンパイル時間 2,292 ms
コンパイル使用メモリ 78,988 KB
実行使用メモリ 66,784 KB
最終ジャッジ日時 2024-06-29 01:16:24
合計ジャッジ時間 13,362 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
50,384 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 1,297 ms
66,716 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no173;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;

public class Main {
	static IO io = new IO();
	static int GETA = 25000;

	public static void main(String[] args) {
		int n = io.nextInt();
		double[] p = io.nextDoubleArray(2);
		int[][] hand = new int[2][];
		for(int i=0;i<2;i++) {
			hand[i] = io.nextIntArray(n);
			Arrays.sort(hand[i]);
		}
		double[][][] q = new double[2][n][n];
		for(int i=0;i<2;i++) {
			double[] dp = new double[1<<n];
			dp[0] = 1;
			for(int j=0;j<(1<<n)-1;j++) {
				for(int k=0;k<n;k++) {
					if ((j >> k & 1) == 0) {
						double usep;
						if (Integer.bitCount(j) == n-1) {
							usep = 1;
						}else{
							usep = (1<<k) == Integer.lowestOneBit(~j) ? p[i] : (1 - p[i]) / (n - Integer.bitCount(j) - 1);
						}
						q[i][Integer.bitCount(j)][k] += usep * dp[j];
						dp[j | (1<<k)] += usep * dp[j];
					}
				}
			}
//			System.out.println(Arrays.toString(dp));
//			System.out.println(Arrays.deepToString(q[i]));
		}

		double ans = 0;
		double[][] dp = new double[n+1][50000];
		dp[0][GETA] = 1;
		for(int t=0;t<n;t++) {
			for(int k=0;k<50000;k++) {
				if (dp[t][k] < 1E-9) {
					continue;
				}
				for(int i=0;i<n;i++) {
					for(int j=0;j<n;j++) {
						int dpoint = hand[0][i] > hand[1][j] ? (hand[0][i] + hand[1][j]) : -(hand[0][i] + hand[1][j]);
//						System.out.println(q[0][t][i] * q[1][t][j]);
						int nk = k + dpoint;
						if (nk < 0 || nk >= 50000) {
							continue;
						}

						dp[t+1][nk] += dp[t][k] * q[0][t][i] * q[1][t][j];
					}
				}
			}

//			for(int i=GETA-10;i<=GETA+10;i++) {
//				System.out.print(dp[t][i] + ",");
//			}
//			System.out.println();
		}
		for(int i=GETA+1;i<50000;i++) {
			ans += dp[n][i];
		}
		System.out.println(ans);
	}

}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0