#433785 (D) No.162 8020運動

提出ソース

結果

問題	No.162 8020運動
ユーザー	te-sh
提出日時	2020-02-23 18:00:59
言語	D (dmd 2.109.1)
結果	AC
実行時間	60 ms / 5,000 ms
コード長	5,225 bytes
コンパイル時間	2,018 ms
コンパイル使用メモリ	162,004 KB
実行使用メモリ	6,948 KB
最終ジャッジ日時	2024-06-22 05:29:56
合計ジャッジ時間	4,050 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	13 ms 6,812 KB
testcase_01	AC	34 ms 6,944 KB
testcase_02	AC	48 ms 6,940 KB
testcase_03	AC	59 ms 6,940 KB
testcase_04	AC	59 ms 6,944 KB
testcase_05	AC	60 ms 6,940 KB
testcase_06	AC	59 ms 6,940 KB
testcase_07	AC	58 ms 6,944 KB
testcase_08	AC	59 ms 6,940 KB
testcase_09	AC	13 ms 6,940 KB
testcase_10	AC	45 ms 6,940 KB
testcase_11	AC	34 ms 6,940 KB
testcase_12	AC	22 ms 6,944 KB
testcase_13	AC	58 ms 6,944 KB
testcase_14	AC	15 ms 6,940 KB
testcase_15	AC	16 ms 6,944 KB
testcase_16	AC	26 ms 6,940 KB
testcase_17	AC	17 ms 6,940 KB
testcase_18	AC	54 ms 6,940 KB
testcase_19	AC	45 ms 6,948 KB
testcase_20	AC	51 ms 6,940 KB
testcase_21	AC	49 ms 6,940 KB
testcase_22	AC	46 ms 6,944 KB
testcase_23	AC	48 ms 6,944 KB
testcase_24	AC	46 ms 6,944 KB
testcase_25	AC	51 ms 6,940 KB
testcase_26	AC	12 ms 6,944 KB
testcase_27	AC	35 ms 6,944 KB
testcase_28	AC	56 ms 6,940 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

Main.d(199): 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-169(169):        instantiated from here: `putMain!(c, double)`
Main.d(55):        instantiated from here: `put!("{}", double)`

ソースコード

raw source code

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

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;
import std.regex;

version(unittest) {} else
void main()
{
  int A; io.getV(A); A = 80-A;
  double[] P; io.getA(3, P); P[] /= 100;

  auto n = 14;

  auto p = new double[][](n+1);
  foreach (i; 1..n+1) {
    p[i] = new double[](1<<i);
    auto j2 = (((1<<i)-1)<<1);
    foreach (j; 0..1<<i) {
      auto q = 1.0;
      foreach (k; 0..i) {
        auto r = P[j2.bitTest(k) + j2.bitTest(k+2)];
        q *= j.bitTest(k) ? 1-r : r;
      }
      p[i][j] = q;
    }
  }

  auto c = new int[][](1<<n);
  foreach (i; 1..1<<n) {
    auto d = 0;
    foreach (j; 0..n+1) {
      if (i.bitTest(j)) {
        ++d;
      } else {
        if (d > 0) {
          c[i] ~= d;
          d = 0;
        }
      }
    }
  }

  auto e = new double[][](A+1, n+1);
  foreach (i; 0..n+1) e[0][i] = i;
  foreach (i; 0..A+1) e[i][0] = 0;

  foreach (y; 1..A+1)
    foreach (t; 1..n+1) {
      e[y][t] = 0;
      foreach (i; 1..1<<t)
        e[y][t] += p[t][i] * c[i].map!(ci => e[y-1][ci]).sum;
    }

  io.put(e[A][n]*2);
}

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);
      }
    }
  }
}