結果

問題 No.315 世界のなんとか3.5
ユーザー te-shte-sh
提出日時 2020-02-26 03:16:40
言語 D
(dmd 2.106.1)
結果
AC  
実行時間 1,588 ms / 2,000 ms
コード長 9,693 bytes
コンパイル時間 1,652 ms
コンパイル使用メモリ 150,844 KB
実行使用メモリ 163,056 KB
最終ジャッジ日時 2024-06-22 05:31:19
合計ジャッジ時間 21,094 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 28 ms
6,944 KB
testcase_03 AC 3 ms
6,944 KB
testcase_04 AC 3 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 47 ms
6,944 KB
testcase_09 AC 43 ms
6,940 KB
testcase_10 AC 36 ms
6,940 KB
testcase_11 AC 51 ms
6,944 KB
testcase_12 AC 371 ms
44,080 KB
testcase_13 AC 346 ms
43,992 KB
testcase_14 AC 675 ms
82,264 KB
testcase_15 AC 673 ms
83,112 KB
testcase_16 AC 679 ms
83,900 KB
testcase_17 AC 666 ms
83,788 KB
testcase_18 AC 359 ms
44,636 KB
testcase_19 AC 382 ms
44,452 KB
testcase_20 AC 358 ms
44,292 KB
testcase_21 AC 363 ms
43,744 KB
testcase_22 AC 680 ms
83,828 KB
testcase_23 AC 687 ms
82,864 KB
testcase_24 AC 690 ms
82,764 KB
testcase_25 AC 667 ms
83,932 KB
testcase_26 AC 682 ms
85,324 KB
testcase_27 AC 675 ms
83,972 KB
testcase_28 AC 673 ms
84,276 KB
testcase_29 AC 1,270 ms
162,328 KB
testcase_30 AC 1,232 ms
163,056 KB
testcase_31 AC 1,217 ms
162,812 KB
testcase_32 AC 1,370 ms
162,084 KB
testcase_33 AC 680 ms
85,912 KB
testcase_34 AC 1,120 ms
162,888 KB
testcase_35 AC 1,588 ms
162,292 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Main.d(437): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", ModInt!1000000007).put.putMain!(c, ModInt!1000000007).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-407(407):        instantiated from here: `putMain!(c, ModInt!1000000007)`
Main.d(48):        instantiated from here: `put!("{}", ModInt!1000000007)`

ソースコード

diff # 

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

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()
{
  string A, B; int P; io.getV(A, B, P);

  auto calc(int[] n)
  {
    auto nl = cast(int)n.length;

    if (nl <= 5) {
      auto r = mint(0);
      foreach (i; 1..d2i(n)+1)
        if ((i%3 == 0 || include3(i)) && i%P != 0)
          ++r;
      return r;
    }

    auto dp = new mint[][][][](nl-4, 2, 3, 2);
    dp[0][1][0][0] = 1;
    foreach (i; 0..nl-5)
      foreach (j; 0..2) {
        auto d = j ? n[i] : 9;
        foreach (k; 0..3)
          foreach (l; 0..2)
            foreach (m; 0..d+1)
              dp[i+1][j && m==d][(k+m)%3][l || m==3] += dp[i][j][k][l];
      }

    auto dp2 = new mint[][][](3, 2, 2);
    foreach (j; 0..2) {
      auto d = j ? d2i(n.tail(5)) : 99999;
      foreach (k; 0..3)
        foreach (l; 0..2)
          foreach (m; 0..d+1)
            dp2[(k+m)%3][l || include3(m)][m%P == 0] += dp[nl-5][j][k][l];
    }

    return dp2[0][0][0] + dp2[0][1][0] + dp2[1][1][0] + dp2[2][1][0];
  }

  auto a = s2d(A), b = s2d(B), r = calc(b)-calc(a);
  if ((a.sum%3 == 0 || a.canFind(3)) && d2i(a.tail(5))%P != 0) ++r;
  io.put(r);
}

auto include3(int n)
{
  for (; n > 0; n /= 10)
    if (n%10 == 3) return true;
  return false;
}

auto s2d(string s)
{
  return s.map!(c => cast(int)(c-'0')).array;
}

auto d2i(int[] a)
{
  auto r = 0;
  foreach (ai; a) r = r*10+ai;
  return r;
}

const mod = 10^^9+7;
alias mint = ModInt!mod;
pure nothrow @safe
{
  T powr(alias pred = "a*b", T, U)(const T a, U n, T one)
    if (isIntegral!U)
  {
    auto b = T(a);
    alias predFun = binaryFun!pred;
    if (n == 0) return one;
    auto r = one;
    for (; n > 0; n >>= 1) {
      if (n&1) r = predFun(r, b);
      b = predFun(b, b);
    }
    return r;
  }
  T powr(alias pred = "a*b", T, U)(const T a, U n)
    if (isIntegral!U)
  {
    return powr!(pred, T, U)(a, n, T(1));
  }
}

pure nothrow @nogc @safe
{
  auto lowerBoundBy(alias conv = "a", alias comp = "a<b", R, T)(const R a, const 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)(const R a, const 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)(const R a)
  {
    alias convFun = unaryFun!conv, compFun = binaryFun!comp;
    return a.map!(e => tuple(e, convFun(e))).assumeSorted!((a, b) => compFun(a[1], b[1]));
  }
}

pure nothrow @nogc @safe
{
  pragma(inline)
  {
    T cdiv(T)(const T a, const T b)
    {
      return (a+b-1)/b;
    }
    T pmod(T)(const T a, const T b)
    {
      return a >= 0 ? a%b : a%b+b;
    }
  }

  ExtGcdResult!T extGcd(T)(const T a, const T b)
  {
    if (a == 0) {
      return ExtGcdResult!T(T(b), T(0), T(1));
    } else {
      auto r = extGcd(b%a, a);
      return ExtGcdResult!T(r.gcd, r.y-(b/a)*r.x, r.x);
    }
  }

  private struct ExtGcdResult(T)
  {
    T gcd, x, y;
  }
}

struct ModInt(int m)
{
  pure nothrow @nogc @safe
  {
    this(T)(T v)
      if (isIntegral!T)
    {
      i = nm(v);
    }
    this(ref return scope const Mint v)
    {
      i = v.i;
    }
    bool opEquals(T)(T v) const
      if (isIntegral!T)
    {
      return i == v;
    }
    bool opEquals(const Mint v) const
    {
      return i == v.i;
    }

    ref Mint opAssign(T)(T v)
      if (isIntegral!T)
    {
      i = nm(v);
      return this;
    }
    ref Mint opAssign(const Mint v)
    {
      i = v.i;
      return this;
    }

    Mint opUnary(string op: "-")() const
    {
      return Mint(-i);
    }

    static if (m < int.max/2) {
      Mint opBinary(string op: "+")(int r) const
      {
        auto m = Mint.init;
        m.i = nm(i+r);
        return m;
      }
      Mint opBinary(string op: "+")(const Mint r) const
      {
        auto m = Mint.init;
        m.i = nmp(i+r.i);
        return m;
      }
      ref Mint opOpAssign(string op: "+")(int r)
      {
        i = nm(i+r);
        return this;
      }
      ref Mint opOpAssign(string op: "+")(const Mint r)
      {
        i = nmp(i+r.i);
        return this;
      }
    } else {
      Mint opBinary(string op: "+")(int r) const
      {
        auto m = Mint.init;
        m.i = nm(l+r);
        return m;
      }
      Mint opBinary(string op: "+")(const Mint r) const
      {
        auto m = Mint.init;
        m.i = nmp(l+r.i);
        return m;
      }
      ref Mint opOpAssign(string op: "+")(int r)
      {
        i = nm(l+r);
        return this;
      }
      ref Mint opOpAssign(string op: "+")(const Mint r)
      {
        i = nmp(l+r.i);
        return this;
      }
    }
    Mint opBinary(string op: "-")(int r) const
    {
      return Mint(i-r);
    }
    Mint opBinary(string op: "-")(const Mint r) const
    {
      return Mint(i-r.i);
    }
    ref Mint opOpAssign(string op: "-")(int r)
    {
      i = nm(i-r);
      return this;
    }
    ref Mint opOpAssign(string op: "-")(const Mint r)
    {
      i = nm(i-r.i);
      return this;
    }

    Mint opBinary(string op, T)(T r) const
      if ((op == "+" || op == "-") && isIntegral!T && !is(T == int))
    {
      return Mint(mixin("l"~op~"r"));
    }
    ref Mint opOpAssign(string op, T)(T r)
      if ((op == "+" || op == "-") && isIntegral!T && !is(T == int))
    {
      i = nm(mixin("l"~op~"r"));
      return this;
    }

    Mint opBinary(string op: "*", T)(T r) const
      if (isIntegral!T)
    {
      auto m = Mint.init;
      m.i = nm(l*r);
      return m;
    }
    Mint opBinary(string op: "*")(const Mint r) const
    {
      auto m = Mint.init;
      m.i = nmp(l*r.i);
      return m;
    }
    ref Mint opOpAssign(string op: "*", T)(T r)
      if (isIntegral!T)
    {
      i = nm(l*r);
      return this;
    }
    ref Mint opOpAssign(string op: "*")(const Mint r)
    {
      i = nmp(l*r.i);
      return this;
    }

    ref Mint opUnary(string op: "++")()
    {
      i = nmp(i+1);
      return this;
    }
    ref Mint opUnary(string op: "--")()
    {
      i = nm(i-1);
      return this;
    }

    Mint opBinary(string op: "^^", T)(T n)
      if (isIntegral!T)
    {
      return powr(this, n, Mint(1));
    }

    Mint opBinary(string op: "/")(const Mint r) const
    {
      return Mint(l*r.inv.i);
    }
    ref Mint opOpAssign(string op: "/")(const Mint r)
    {
      i = nm(l*r.inv.i);
      return this;
    }

    Mint opBinary(string op: "/", T)(T r) const
      if (isIntegral!T)
    {
      return opBinary!op(Mint(r));
    }
    ref Mint opOpAssign(string op: "/", T)(T r)
      if (isIntegral!T)
    {
      return opOpAssign!op(Mint(r));
    }

    Mint inv() const
    {
      return Mint(extGcd(i, m).x);
    }
  }

  pure nothrow @safe
  {
    string toString() const
    {
      return i.to!string;
    }
  }

  private
  {
    alias Mint = ModInt!m;
    version(BigEndian) union { long l; struct { int i2; int i; } }
    else union { long l; int i; }

    pragma(inline) pure nothrow @nogc @safe
    {
      int nm(T)(T v) const
        if (isIntegral!T)
      {
        return cast(int)pmod(v, m);
      }

      int nmp(T)(T v) const
        if (isIntegral!T)
      {
        return cast(int)(v%m);
      }
    }
  }
}

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