結果

問題 No.718 行列のできるフィボナッチ数列道場 (1)
ユーザー te-shte-sh
提出日時 2020-01-28 12:29:36
言語 D
(dmd 2.106.1)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 9,533 bytes
コンパイル時間 459 ms
コンパイル使用メモリ 143,552 KB
最終ジャッジ日時 2024-11-14 22:04:22
合計ジャッジ時間 842 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/internal/write.d(143): Error: cannot implicitly convert expression `obj` of type `const(ModInt!(1000000007, false))` to `int`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(1239): Error: template instance `std.format.internal.write.formatValueImpl!(Appender!string, ModInt!(1000000007, false), char)` error instantiating
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(632):        instantiated from here: `formatValue!(Appender!string, ModInt!(1000000007, false), char)`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/package.d(779):        instantiated from here: `formattedWrite!(Appender!string, char, ModInt!(1000000007, false))`
Main.d(325):        instantiated from here: `format!(char, ModInt!(1000000007, false))`
Main.d(303):        instantiated from here: `putA!(ModInt!(1000000007, false))`
Main.d(11):        instantiated from here: `put!(false, ModInt!(1000000007, false))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/internal/write.d(143): Error: cannot implicitly convert expression `obj` of type `const(ModInt!(1000000007, false))` to `int`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(1239): Error: template instance `std.format.internal.write.formatValueImpl!(LockingTextWriter, ModInt!(1000000007, false), char)` error instantiating
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(632):        instantiated from here: `formatValue!(LockingTextWriter, ModInt!(1000000007, false), char)`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/stdio.d(1759):        instantiated from here: `formattedWrite!(LockingTextWriter, char, ModInt!(1000000007, false))`
Main.d(326):        instantiated from here: `write!(ModInt!(1000000007, false))`
Main.d(303):        instantiated from here: `putA!(ModInt!(1000000007, false))`
Main.d(11):        instantiated from here: `put!(false, Mo

ソースコード

diff # 

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

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

version(unittest) {} else
void main()
{
  long N; io.getV(N);

  auto m = matrix!mint([[1,1,0,0],[0,1,1,2],[0,1,0,0],[0,1,0,1]]);
  io.put((m^^N)[0][1]);
}

pure T isqrt(T)(T n)
{
  static if (is(T == int)) auto max = 46341;
  else static if (is(T == long)) auto max = 3037000500L;
  auto bs = iota(T(0), max).map!(x => tuple(x, x^^2)).assumeSorted!"a[1]<=b[1]";
  return bs.lowerBound(tuple(0, n)).back[0];
}

pure T icbrt(T)(T n)
{
  static if (is(T == int)) auto max = 1291;
  else static if (is(T == long)) auto max = 2097152L;
  auto bs = iota(T(0), max).map!(x => tuple(x, x^^3)).assumeSorted!"a[1]<=b[1]";
  return bs.lowerBound(tuple(0, n)).back[0];
}

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

struct Vector(T, T zero = 0)
{
  alias V = Vector!(T, zero), Op = string;
  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 V dup() { auto b = V(n); b[] = a[]; return b; }

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

  pure V opBinary(Op op: "*")(T b)
  {
    auto x = V(n);
    foreach (i; 0..n) x[i] = a[i]*b;
    return x;
  }
  ref V opOpAssign(Op op: "*")(T b)
  {
    foreach (i; 0..n) a[i] *= b;
    return this;
  }

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

  private T[] a;
}
Vector!(T, zero) vector(T, T zero = 0)(T[] a)
{ return Vector!(T, zero)(a); }
Vector!(T, zero) vector(T, U, T zero = 0)(U[] a) if (!is(T == U))
{ return Vector!(T, zero)(a); }

pure T hypot2(T, alias zero)(Vector!(T, zero) a) { return a*a; }

pure Vector!(T, zero) cross(T, alias zero)(Vector!(T, zero) a, Vector!(T, zero) b)
in { assert(a.n == 3 && b.n == 3); } do
{ return Vector!(T, zero)([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(T, T zero = 0, T one = 1)
{
  alias M = Matrix!(T, zero, one), V = Vector!(T, zero), Op = string;
  size_t r, c;
  @property T[][] array() { return a; }
  alias array this;

  static auto unit(size_t n) in { assert(n > 0); } do
  {
    auto r = M(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 M dup() { auto b = M(r, c); foreach (i; 0..r) b[i][] = a[i][]; return b; }

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

  pure M opBinary(Op op)(M b) if (op=="+"||op=="-") in { assert(r == b.r && c == b.c); } do
  {
    auto x = M(r, c);
    foreach (i; 0..r) foreach (j; 0..c) x[i][j] = mixin("a[i][j]"~op~"b[i][j]");
    return x;
  }
  ref M opOpAssign(Op op)(M 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 M opBinary(Op op: "*")(T b)
  {
    auto x = M(r, c);
    foreach (i; 0..r) foreach (j; 0..c) x[i][j] = a[i][j]*b;
    return x;
  }
  ref M opOpAssign(Op op: "*")(T b)
  {
    foreach (i; 0..r) foreach (j; 0..c) a[i][j] *= b;
    return this;
  }

  pure M opBinary(Op op: "*")(M b) in { assert(c == b.r); } do
  {
    auto x = M(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 M opOpAssign(Op op: "*")(M b) in { assert(c == b.r); } do
  {
    auto x = this*b;
    r = x.r; c = x.c; a = x.a;
    return this;
  }

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

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

  private T[][] a;
}
Matrix!(T, zero, one) matrix(T, T zero = 0, T one = 1)(T[][] a)
{ return Matrix!(T, zero, one)(a); }
Matrix!(T, zero, one) matrix(T, U, T zero = 0, T one = 1)(U[][] a) if (!is(T == U))
{ return Matrix!(T, zero, one)(a); }

pure T det(T, alias zero, alias one)(Matrix!(T, zero, one) 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;
}

const mod = 10^^9+7;
alias mint = ModInt!mod;

struct ModInt(int m, bool pos = false)
{
  version(BigEndian) union { long l; struct { int i2; int i; } } else union { long l; int i; }
  alias M = ModInt!(m, pos), Op = string;
  @property static init() { return M(0); }
  @property int value() { return i; }
  @property void value(int v) { i = nm(v); }
  alias value this;

  this(T)(T v = 0) { i = nm(v); }
  ref M opAssign(T)(T v) { i = nm(v); return this; }

  static if (!pos) pure M opUnary(Op op: "-")() { return M(-i); }

  static if (m < int.max / 2) {
    pure M opBinary(Op op)(int r) if(op=="+"||!pos&&op=="-") { return M(mixin("i"~op~"r")); }
    ref M opOpAssign(Op op)(int r) if(op=="+"||!pos&&op=="-") { i=nm(mixin("i"~op~"r")); return this; }
  } else {
    pure M opBinary(Op op)(int r) if(op=="+"||!pos&&op=="-") { return M(mixin("l"~op~"r")); }
    ref M opOpAssign(Op op)(int r) if(op=="+"||!pos&&op=="-") { i=nm(mixin("l"~op~"r")); return this; }
  }
  pure M opBinary(Op op: "*")(int r) { return M(l*r); }
  ref M opOpAssign(Op op: "*")(int r) { i=nm(l*r); return this; }

  pure M opBinary(Op op)(M r) if(op=="+"||!pos&&op=="-"||op=="*") { return opBinary!op(r.i); }
  ref M opOpAssign(Op op)(M r) if(op=="+"||!pos&&op=="-"||op=="*") { return opOpAssign!op(r.i); }

  pure M opBinary(Op op: "^^", T)(T n) { return this.powr(n); }

  static if (!pos) {
    pure M opBinary(Op op: "/")(M r) { return M(l*r.inv.i); }
    ref M opOpAssign(Op op: "/")(M r) { i=nm(l*r.inv.i); return this; }

    pure M opBinary(Op op: "/")(int r) { return opBinary!op(M(r)); }
    ref M opOpAssign(Op op: "/")(int r) { return opOpAssign!op(M(r)); }

    pure M inv() { int x = i, a, b; extGcd(x, m, a, b); return M(a); }
  }

  private
  {
    pure int nm(int v) { static if (pos) return v%m; else return (v%m+m)%m; }
    pure int nm(long v) { static if (pos) return cast(int)(v%m); else return cast(int)((v%m+m)%m); }
  }
}

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;

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

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