結果

問題 No.174 カードゲーム（Hard）
ユーザー te-shte-sh
提出日時 2020-02-21 18:40:59
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 253 ms / 2,000 ms
コード長 5,164 bytes
コンパイル時間 2,218 ms
コンパイル使用メモリ 159,592 KB
実行使用メモリ 21,576 KB
最終ジャッジ日時 2024-06-22 05:21:03
合計ジャッジ時間 4,787 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,944 KB
testcase_02 AC 249 ms
20,816 KB
testcase_03 AC 251 ms
19,792 KB
testcase_04 AC 252 ms
20,240 KB
testcase_05 AC 252 ms
21,256 KB
testcase_06 AC 253 ms
21,576 KB
testcase_07 AC 249 ms
19,188 KB
testcase_08 AC 252 ms
20,540 KB
testcase_09 AC 250 ms
19,500 KB
testcase_10 AC 1 ms
6,940 KB
testcase_11 AC 1 ms
6,944 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(195): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", double).put.putMain!(c, double).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-165(165):        instantiated from here: `putMain!(c, double)`
Main.d(51):        instantiated from here: `put!("{}", double)`

ソースコード

diff # 

// URL: https://yukicoder.me/problems/no/174

import std.algorithm, std.array, std.bitmanip, std.container, std.conv, std.format,
       std.functional, std.math, std.range, std.traits, std.typecons, std.stdio, 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 : _bsf = bsf, _bsr = bsr, _popcnt = popcnt;
  pure nothrow @nogc @safe
  {
    bool bitTest(T)(T n, size_t i)
      if (isIntegral!T)
    { return (n & (T(1) << i)) != 0; }
    T bitSet(T)(T n, size_t i)
      if (isIntegral!T)
    { return n | (T(1) << i); }
    T bitReset(T)(T n, size_t i)
      if (isIntegral!T)
    { return n & ~(T(1) << i); }
    T bitComp(T)(T n, size_t i)
      if (isIntegral!T)
    { return n ^ (T(1) << i); }
    int bsf(T)(T n)
      if (is(T == int) || is(T == uint))
    { return _bsf(cast(uint)(n)); }
    int bsf(T)(T n)
      if (is(T == long) || is(T == ulong))
    { return _bsf(cast(ulong)(n)); }
    int bsr(T)(T n)
      if (is(T == int) || is(T == uint))
    { return _bsr(cast(uint)n); }
    int bsr(T)(T n)
      if (is(T == long) || is(T == ulong))
    { return _bsr(cast(ulong)n); }
    int popcnt(T)(T n)
      if (is(T == int) || is(T == uint))
    { return _popcnt(cast(uint)n); }
    int popcnt(T)(T n)
      if (is(T == long) || is(T == ulong))
    { return _popcnt(cast(ulong)n); }
  }
}

pure nothrow @nogc @safe
{
  auto bitSubset(bool includeZero = false, T)(T n)
  {
    return BitSubsetRange!(includeZero, T)(n);
  }

  private struct BitSubsetRange(bool includeZero = false, T)
  {
    private T n, i;

    this(T n) { this.n = this.i = n; }
    pure nothrow @nogc @safe
    {
      static if (includeZero) {
        @property T front() const { return i&n; }
        void popFront() { i &= n; i--; }
        bool empty() const { return i < 0; }
      } else {
        @property T front() const { return i; }
        void popFront() { i = (i-1)&n; }
        bool empty() const { return i <= 0; }
      }
    }
  }
}

auto io = IO!()();
import std.stdio;
struct IO(alias IN = stdin, alias OUT = stdout)
{
  import std.meta : allSatisfy;
  import core.stdc.stdlib : exit;

  void getV(T...)(ref T v)
  {
    foreach (ref w; v) get(w);
  }
  void getA(T)(size_t n, ref T v)
    if (hasAssignableElements!T)
  {
    v = new T(n);
    foreach (ref w; v) get(w);
  }
  void getC(T...)(size_t n, ref T v)
    if (allSatisfy!(hasAssignableElements, T))
  {
    foreach (ref w; v) w = new typeof(w)(n);
    foreach (i; 0..n) foreach (ref w; v) get(w[i]);
  }
  void getM(T)(size_t r, size_t c, ref T v)
    if (hasAssignableElements!T && hasAssignableElements!(ElementType!T))
  {
    v = new T(r);
    foreach (ref w; v) getA(c, w);
  }
  template getS(E...)
  {
    void getS(T)(size_t n, ref T v)
    {
      v = new T(n);
      foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");");
    }
  }

  const struct PutConf
  {
    bool newline = true, flush, exit;
    string floatFormat = "%.10f", delimiter = " ";
  }

  void put(alias conf = "{}", T...)(T v)
  {
    mixin("const PutConf c = "~conf~"; putMain!c(v);");
  }
  void putB(alias conf = "{}", S, T)(bool c, S t, T f)
  {
    if (c) put!conf(t);
    else put!conf(f);
  }
  void 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;
    }
    void get(T)(ref T v)
    {
      if (sp.empty) nextLine();
      v = sp.front.to!T;
      sp.popFront();
    }

    void putMain(PutConf c, T...)(T v)
    {
      foreach (i, w; v) {
        putOne!c(w);
        if (i+1 < v.length) OUT.write(c.delimiter);
      }
      static if (c.newline) OUT.writeln;
      static if (c.flush) OUT.flush();
      static if (c.exit) exit(0);
    }
    void putOne(PutConf c, T)(T v)
    {
      static if (isInputRange!T && !isSomeString!T) putRange!c(v);
      else static if (isFloatingPoint!T) OUT.write(format(c.floatFormat, v));
      else static if (hasMember!(T, "fprint")) v.fprint(OUT);
      else OUT.write(v);
    }
    void putRange(PutConf c, T)(T v)
    {
      auto w = v;
      while (!w.empty) {
        putOne!c(w.front); w.popFront();
        if (!w.empty) OUT.write(c.delimiter);
      }
    }
  }
}
0