結果

問題 No.301 サイコロで確率問題 (1)
コンテスト
ユーザー te-sh
提出日時 2020-02-18 17:29:15
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 14 ms / 1,000 ms
コード長 8,545 bytes
コンパイル時間 2,129 ms
コンパイル使用メモリ 164,648 KB
実行使用メモリ 6,940 KB
最終ジャッジ日時 2024-06-22 05:16:56
合計ジャッジ時間 2,388 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 2
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(259): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{floatFormat: \"%.13f\"}", double).put.putMain!(c, double).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-247(247):        instantiated from here: `putMain!(c, double)`
Main.d(19):        instantiated from here: `put!("{floatFormat: \"%.13f\"}", double)`
Main.d(259): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{delimiter: \"\"}", long, string).put.putMain!(c, long, string).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-247(247):        instantiated from here: `putMain!(c, long, string)`
Main.d(21):        instantiated from here: `put!("{delimiter: \"\"}", long, string)`

ソースコード

diff # 

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

import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string;

version(unittest) {} else
void main()
{
  int T; io.getV(T);

  auto m = Matrix(7, 7);
  foreach (i; 0..6) m[0][i] = 1.0/6;
  foreach (i; 0..5) m[i+1][i] = 1;
  m[0][6] = m[6][6] = 1;

  foreach (_; 0..T) {
    long N; io.getV(N);
    if (N < 100) {
      auto r = m^^N;
      io.put!`{floatFormat: "%.13f"}`(r[0][6]/(1-r[0][1..6].sum));
    } else {
      io.put!`{delimiter: ""}`(N+1, ".666666666666");
    }
  }
}

alias me = MatrixElement!(double, 0.0, 1.0), Matrix = me.Matrix;
auto lowerBoundBy(alias conv = "a", alias comp = "a<b", R, T)(R a, T v)
{ return a.sortedTuple!(conv, comp).lowerBound(tuple(a.front, v)).map!"a[0]"; }

auto upperBoundBy(alias conv = "a", alias comp = "a<b", R, T)(R a, T v)
{ return a.sortedTuple!(conv, comp).upperBound(tuple(a.front, v)).map!"a[0]"; }

auto sortedTuple(alias conv = "a", alias comp = "a<b", R)(R a)
{
  import std.functional;
  alias convFun = unaryFun!conv, compFun = binaryFun!comp;
  return a.map!(e => tuple(e, convFun(e))).assumeSorted!((a, b) => compFun(a[1], b[1]));
}

pure T isqrt(T)(T n)
{
  static if (is(T == int)) auto max = 46341;
  else static if (is(T == long)) auto max = 3037000500L;
  return iota(T(0), max).lowerBoundBy!("a^^2", "a<=b")(n).back;
}

pure T icbrt(T)(T n)
{
  static if (is(T == int)) auto max = 1291;
  else static if (is(T == long)) auto max = 2097152L;
  return iota(T(0), max).lowerBoundBy!("a^^3", "a<=b")(n).back;
}

pure T powr(alias pred = "a*b", T, U)(T a, U n, T one)
{
  import std.functional;
  alias predFun = binaryFun!pred;
  if (n == 0) return one;
  auto r = one;
  for (; n > 0; n >>= 1) { if (n&1) r = predFun(r, a); a = predFun(a, a); }
  return r;
}
pure T powr(alias pred = "a*b", T, U)(T a, U n) { return powr!(pred, T, U)(a, n, T(1)); }

pure T extGcd(T)(T a, T b, out T x, out T y)
{
  auto g = a; x = 1; y = 0;
  if (b) { g = extGcd(b, a%b, y, x); y -= a/b*x; }
  return g;
}

template MatrixElement(T, alias zero = 0, alias one = 1)
{
  struct Vector
  {
    size_t n;
    @property T[] array() { return a; }
    alias array this;

    this(size_t n) in { assert(n > 0); } do
    {
      this.n = n;
      a = new T[](n);
      static if (T.init != zero) a[] = zero;
    }
    this(U)(U[] b) in { assert(b.length > 0); } do
    {
      n = b.length;
      static if (is(T == U)) a = b;
      else { a = new T[](n); foreach (i; 0..n) a[i] = b[i]; }
    }

    pure Vector dup() { auto b = Vector(n); b[] = a[]; return b; }

    pure Vector opBinary(string op)(Vector b) if (op=="+"||op=="-") in { assert(n == b.n); } do
    { auto x = Vector(n); foreach (i; 0..n) x[i] = mixin("a[i]"~op~"b[i]"); return x; }
    ref Vector opOpAssign(string op)(Vector b) if (op=="+"||op=="-") in { assert(n == b.n); } do
    { foreach (i; 0..n) mixin("a[i]"~op~"=b[i];"); return this; }
    pure Vector opBinary(string op: "*")(T b)
    { auto x = Vector(n); foreach (i; 0..n) x[i] = a[i]*b; return x; }
    ref Vector opOpAssign(string op: "*")(T b)
    { foreach (i; 0..n) a[i] *= b; return this; }

    pure T opBinary(string op: "*")(Vector b) in { assert(n == b.n); } do
    { auto x = zero; foreach (i; 0..n) x += a[i]*b[i]; return x; }

    private T[] a;
  }

  pure T hypot2(Vector a) { return a*a; }
  pure Vector cross(Vector a, Vector b) in { assert(a.n == 3 && b.n == 3); } do
  { return Vector([a[1]*b[2]-a[2]*b[1], a[2]*b[0]-a[0]*b[2], a[0]*b[1]-a[1]*b[0]]); }

  struct Matrix
  {
    size_t r, c;
    @property T[][] array() { return a; }
    alias array this;

    static Matrix unit(size_t n) in { assert(n > 0); } do
    { auto r = Matrix(n, n); foreach (i; 0..n) r[i][i] = one; return r; }

    this(size_t r, size_t c) in { assert(r > 0 && c > 0); } do
    {
      this.r = r; this.c = c;
      a = new T[][](r, c);
      static if (T.init != zero) foreach (i; 0..r) a[i][] = zero;
    }
    this(U)(U[][] b)
    in { assert(b.length > 0 && b[0].length > 0 && b.all!(l => l.length == b[0].length)); } do
    {
      r = b.length; c = b[0].length;
      static if (is(T == U)) a = b;
      else { a = new T[][](r, c); foreach (i; 0..r) foreach (j; 0..c) a[i][j] = b[i][j]; }
    }

    pure Matrix dup() { auto b = Matrix(r, c); foreach (i; 0..r) b[i][] = a[i][]; return b; }

    pure bool opEquals(Matrix b)
    {
      return r == b.r && c == b.c && zip(a, b.a).all!"a[0]==a[1]";
    }

    pure Matrix opBinary(string op)(Matrix b) if (op=="+"||op=="-") in { assert(r == b.r && c == b.c); } do
    {
      auto x = Matrix(r, c);
      foreach (i; 0..r) foreach (j; 0..c) x[i][j] = mixin("a[i][j]"~op~"b[i][j]");
      return x;
    }
    ref Matrix opOpAssign(string op)(Matrix b) if (op=="+"||op=="-") in { assert(r == b.r && c == b.c); } do
    {
      foreach (i; 0..r) foreach (j; 0..c) mixin("a[i][j]"~op~"=b[i][j];");
      return this;
    }

    pure Matrix opBinary(string op: "*")(T b)
    {
      auto x = Matrix(r, c);
      foreach (i; 0..r) foreach (j; 0..c) x[i][j] = a[i][j]*b;
      return x;
    }
    ref Matrix opOpAssign(string op: "*")(T b)
    {
      foreach (i; 0..r) foreach (j; 0..c) a[i][j] *= b;
      return this;
    }

    pure Matrix opBinary(string op: "*")(Matrix b) in { assert(c == b.r); } do
    {
      auto x = Matrix(r, b.c);
      foreach (i; 0..r) foreach (j; 0..b.c) foreach (k; 0..c) x[i][j] += a[i][k]*b[k][j];
      return x;
    }
    ref Matrix opOpAssign(string op: "*")(Matrix b) in { assert(c == b.r); } do
    {
      auto x = this*b;
      r = x.r; c = x.c; a = x.a;
      return this;
    }

    pure Vector opBinary(string op: "*")(Vector b) in { assert(c == b.n); } do
    {
      auto x = Vector(r);
      foreach (i; 0..r) foreach (j; 0..c) x[i] += a[i][j]*b[j];
      return x;
    }

    pure Matrix opBinary(string op: "^^", U)(U n) in { assert(r == c); } do
    {
      return powr(this, n, Matrix.unit(r));
    }

    private T[][] a;
  }

  pure T det(Matrix a) in { assert(a.r == a.c); } do
  {
    auto n = a.r, b = a.dup, d = one;

    foreach (i; 0..n) {
      auto p = i;
      foreach (j; i+1..n)
        if (b[p][i].abs < b[j][i].abs) p = j;
      swap(b[p], b[i]);
      foreach (j; i+1..n)
        foreach (k; i+1..n)
          b[j][k] -= b[i][k]*b[j][i]/b[i][i];
      d *= b[i][i];
      if (p != i) d = -d;
    }

    return d;
  }
}

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

  auto getV(T...)(ref T v) { foreach (ref w; v) get(w); }
  auto getA(T)(size_t n, ref T v) if (hasAssignableElements!T)
  { v = new T(n); foreach (ref w; v) get(w); }
  auto 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]);
  }
  auto 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...)
  {
    auto 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 = " ";
  }

  auto put(alias conf = "{}", T...)(T v)
  { mixin("const PutConf c = "~conf~"; putMain!c(v);"); }
  auto putB(alias conf = "{}", S, T)(bool c, S t, T f)
  { if (c) put!conf(t); else put!conf(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 putMain(PutConf c, T...)(T v)
    {
      foreach (i, w; v) {
        putOne!c(w);
        if (i < v.length-1) OUT.write(c.delimiter);
      }
      static if (c.newline) OUT.writeln;
      static if (c.flush) OUT.flush();
      static if (c.exit) exit(0);
    }
    auto 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);
    }
    auto 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