結果
問題 | No.174 カードゲーム(Hard) |
ユーザー | ぴろず |
提出日時 | 2015-03-28 18:45:04 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 51 ms / 2,000 ms |
コード長 | 4,990 bytes |
コンパイル時間 | 3,026 ms |
コンパイル使用メモリ | 78,908 KB |
実行使用メモリ | 50,764 KB |
最終ジャッジ日時 | 2024-07-06 21:37:56 |
合計ジャッジ時間 | 3,094 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 51 ms
50,676 KB |
testcase_01 | AC | 46 ms
50,380 KB |
testcase_02 | AC | 50 ms
50,676 KB |
testcase_03 | AC | 49 ms
50,764 KB |
testcase_04 | AC | 48 ms
50,696 KB |
testcase_05 | AC | 50 ms
50,692 KB |
testcase_06 | AC | 48 ms
50,668 KB |
testcase_07 | AC | 48 ms
50,580 KB |
testcase_08 | AC | 51 ms
50,680 KB |
testcase_09 | AC | 51 ms
50,584 KB |
testcase_10 | AC | 46 ms
50,536 KB |
testcase_11 | AC | 46 ms
50,608 KB |
ソースコード
package no174; 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 = 20005; static int MAX = 40010; 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]); } //q[i][j] := i+1ターン目にj+1番目に小さいカードを出す確率 double[][][] q = new double[2][n][n]; for(int pl=0;pl<2;pl++) { for(int j=0;j<n;j++) { // dp_j[k]^(i) := i+1ターン目で、j+1番目に小さいカードより小さいカードがk枚ある確率 double[] dp = new double[n]; dp[j] = 1; for(int i=0;i<n;i++) { //配るDP if (i == n - 1) { q[pl][i][j] += dp[0]; }else{ q[pl][i][j] += p[pl] * dp[0]; dp[0] *= 1 - p[pl]; for(int k=1;k<n;k++) { dp[k-1] += dp[k] * (p[pl] + (k-1) * (1-p[pl]) / (n-i-1)); q[pl][i][j] += dp[k] * (1-p[pl]) / (n-i-1); dp[k] *= (n-i-k-1) * (1-p[pl]) / (n-i-1); } } } } } double ans = 0; for(int t=0;t<n;t++) { for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if (hand[0][i] > hand[1][j]) { ans += q[0][t][i] * q[1][t][j] * (hand[0][i] + hand[1][j]); } } } } 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) {}} }