結果
| 問題 |
No.174 カードゲーム(Hard)
|
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2020-01-25 21:24:59 |
| 言語 | D (dmd 2.109.1) |
| 結果 |
AC
|
| 実行時間 | 211 ms / 2,000 ms |
| コード長 | 3,803 bytes |
| コンパイル時間 | 2,832 ms |
| コンパイル使用メモリ | 167,200 KB |
| 実行使用メモリ | 22,476 KB |
| 最終ジャッジ日時 | 2024-06-22 04:32:14 |
| 合計ジャッジ時間 | 5,149 ms |
|
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 12 |
ソースコード
// URL: https://yukicoder.me/problems/no/174
import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string;
version(unittest) {} else
void main()
{
int N; real Pa, Pb; io.getV(N, Pa, Pb);
int[] A; io.getA(N, A);
int[] B; io.getA(N, B);
A.sort; B.sort;
auto calc(int[] a, double p)
{
auto q = new double[][](N, N);
foreach (ref qi; q) qi[] = 0;
auto r = new double[](1<<N);
r[] = 0; r[$-1] = 1;
foreach_reverse (i; 1..1<<N) {
auto c = i.popcnt, f = i.bsf;
if (c == 1) {
q[c-1][f] += r[i];
} else {
auto d = r[i]*p;
q[c-1][f] += d;
r[i.bitReset(f)] += d;
foreach (j; f+1..N)
if (i.bitTest(j)) {
d = r[i]*(1-p)/(c-1);
q[c-1][j] += d;
r[i.bitReset(j)] += d;
}
}
}
return q;
}
auto r1 = calc(A, Pa), r2 = calc(B, Pb), e = 0.0;
foreach (i; 0..N)
foreach (j; 0..N)
foreach (k; 0..N)
if (A[j] > B[k])
e += r1[i][j]*r2[i][k]*(A[j]+B[k]);
io.put(e);
}
pragma(inline)
{
import core.bitop;
pure bool bitTest(T)(T n, size_t i) { return (n & (T(1) << i)) != 0; }
pure T bitSet(T)(T n, size_t i) { return n | (T(1) << i); }
pure T bitReset(T)(T n, size_t i) { return n & ~(T(1) << i); }
pure T bitComp(T)(T n, size_t i) { return n ^ (T(1) << i); }
pure int bsf(T)(T n) { return core.bitop.bsf(ulong(n)); }
pure int bsr(T)(T n) { return core.bitop.bsr(ulong(n)); }
pure int popcnt(T)(T n) { return core.bitop.popcnt(ulong(n)); }
}
struct BitSubsetRange(bool includeZero = false, T)
{
private T n, i;
this(T n) { this.n = this.i = n; }
static if (includeZero) {
@property pure T front() { return i&n; }
void popFront() { i &= n; i--; }
pure bool empty() { return i < 0; }
} else {
@property pure T front() { return i; }
void popFront() { i = (i-1)&n; }
pure bool empty() { return i <= 0; }
}
}
auto bitSubset(bool includeZero = false, T)(T n) { return BitSubsetRange!(includeZero, T)(n); }
auto io = IO!()();
import std.stdio;
struct IO(string floatFormat = "%.10f", string delimiter = " ", alias IN = stdin, alias OUT = stdout)
{
import std.conv, std.format, std.meta, std.traits;
alias assignable = hasAssignableElements;
auto getV(T...)(ref T v) { foreach (ref w; v) get(w); }
auto getA(T)(size_t n, ref T v) if (assignable!T) { v = new T(n); foreach (ref w; v) get(w); }
auto getC(T...)(size_t n, ref T v) if (allSatisfy!(assignable, T))
{
foreach (ref w; v) w = new typeof(w)(n);
foreach (i; 0..n) foreach (ref w; v) get(w[i]);
}
auto getM(T)(size_t r, size_t c, ref T v) if (assignable!T && assignable!(ElementType!T))
{
v = new T(r); foreach (ref w; v) getA(c, w);
}
template getS(E...)
{
auto getS(T)(size_t n, ref T v)
{
v = new T(n); foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");");
}
}
auto put(bool flush = false, T...)(T v)
{
foreach (i, w; v) { putA(w); if (i < v.length-1) OUT.write(delimiter); }
OUT.writeln;
static if (flush) OUT.flush();
}
auto putB(S, T)(bool c, S t, T f) { if (c) put(t); else put(f); }
auto putRaw(T...)(T v) { OUT.write(v); OUT.writeln; }
private
{
dchar[] buf;
auto sp = (new dchar[](0)).splitter;
void nextLine() { IN.readln(buf); sp = buf.splitter; }
auto get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); }
auto putR(T)(T v)
{
auto w = v;
while (!w.empty) { putA(w.front); w.popFront(); if (!w.empty) OUT.write(delimiter); }
}
auto putA(T)(T v)
{
static if (isInputRange!T && !isSomeString!T) putR(v);
else if (isFloatingPoint!T) OUT.write(format(floatFormat, v));
else OUT.write(v);
}
}
}