結果

問題 No.1204 お菓子配り-FINAL
ユーザー 👑 hos.lyrichos.lyric
提出日時 2020-08-29 00:00:13
言語 D
(dmd 2.106.1)
結果
WA  
実行時間 -
コード長 6,014 bytes
コンパイル時間 1,437 ms
コンパイル使用メモリ 156,724 KB
実行使用メモリ 10,048 KB
最終ジャッジ日時 2023-09-04 09:30:36
合計ジャッジ時間 164,550 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 988 ms
7,504 KB
testcase_01 AC 6,695 ms
5,632 KB
testcase_02 AC 528 ms
7,308 KB
testcase_03 AC 938 ms
5,736 KB
testcase_04 AC 227 ms
5,724 KB
testcase_05 AC 2,322 ms
5,628 KB
testcase_06 AC 1,499 ms
6,888 KB
testcase_07 AC 7,077 ms
5,756 KB
testcase_08 AC 137 ms
5,648 KB
testcase_09 AC 1,771 ms
5,660 KB
testcase_10 AC 1,281 ms
5,688 KB
testcase_11 AC 293 ms
5,740 KB
testcase_12 AC 3,273 ms
5,628 KB
testcase_13 AC 1,167 ms
5,608 KB
testcase_14 AC 2,047 ms
5,664 KB
testcase_15 AC 869 ms
6,428 KB
testcase_16 AC 1,838 ms
6,244 KB
testcase_17 AC 301 ms
7,092 KB
testcase_18 AC 495 ms
7,204 KB
testcase_19 AC 370 ms
5,684 KB
testcase_20 AC 580 ms
5,748 KB
testcase_21 AC 4,659 ms
5,728 KB
testcase_22 AC 2,028 ms
6,660 KB
testcase_23 AC 6,599 ms
6,492 KB
testcase_24 AC 3,248 ms
6,808 KB
testcase_25 AC 63 ms
5,812 KB
testcase_26 AC 1,238 ms
5,708 KB
testcase_27 AC 3,122 ms
6,392 KB
testcase_28 AC 25 ms
6,932 KB
testcase_29 AC 4,666 ms
6,760 KB
testcase_30 AC 1,880 ms
6,572 KB
testcase_31 AC 3,715 ms
6,568 KB
testcase_32 AC 731 ms
6,276 KB
testcase_33 AC 1,236 ms
5,732 KB
testcase_34 AC 209 ms
6,492 KB
testcase_35 AC 1,785 ms
5,612 KB
testcase_36 AC 1,353 ms
5,728 KB
testcase_37 AC 1,298 ms
5,860 KB
testcase_38 AC 158 ms
6,504 KB
testcase_39 AC 624 ms
6,324 KB
testcase_40 AC 3,267 ms
5,756 KB
testcase_41 AC 516 ms
5,616 KB
testcase_42 AC 202 ms
6,804 KB
testcase_43 AC 47 ms
7,048 KB
testcase_44 AC 77 ms
5,792 KB
testcase_45 AC 122 ms
6,292 KB
testcase_46 AC 249 ms
5,684 KB
testcase_47 AC 237 ms
6,492 KB
testcase_48 AC 3,438 ms
6,656 KB
testcase_49 AC 5,981 ms
5,740 KB
testcase_50 AC 2,633 ms
5,728 KB
testcase_51 AC 207 ms
6,936 KB
testcase_52 AC 72 ms
5,720 KB
testcase_53 AC 3,565 ms
6,572 KB
testcase_54 AC 834 ms
6,336 KB
testcase_55 AC 288 ms
5,728 KB
testcase_56 AC 3,976 ms
7,276 KB
testcase_57 AC 75 ms
6,728 KB
testcase_58 AC 537 ms
6,296 KB
testcase_59 AC 644 ms
5,748 KB
testcase_60 AC 8 ms
5,748 KB
testcase_61 AC 9 ms
6,960 KB
testcase_62 AC 8 ms
5,728 KB
testcase_63 AC 9 ms
5,864 KB
testcase_64 AC 9 ms
7,440 KB
testcase_65 AC 8 ms
5,728 KB
testcase_66 AC 9 ms
6,772 KB
testcase_67 AC 9 ms
7,068 KB
testcase_68 AC 8 ms
6,344 KB
testcase_69 AC 8 ms
6,796 KB
testcase_70 AC 8 ms
6,440 KB
testcase_71 WA -
testcase_72 WA -
testcase_73 AC 8 ms
6,464 KB
testcase_74 AC 8 ms
5,800 KB
testcase_75 AC 8 ms
6,536 KB
testcase_76 AC 9 ms
5,768 KB
testcase_77 AC 8 ms
6,584 KB
testcase_78 WA -
testcase_79 AC 9 ms
6,284 KB
testcase_80 AC 8 ms
5,732 KB
testcase_81 AC 8 ms
5,676 KB
testcase_82 AC 8 ms
6,476 KB
testcase_83 AC 8 ms
5,732 KB
testcase_84 AC 8 ms
5,676 KB
testcase_85 AC 8 ms
6,936 KB
testcase_86 AC 8 ms
5,652 KB
testcase_87 AC 8 ms
6,760 KB
testcase_88 WA -
testcase_89 WA -
testcase_90 WA -
testcase_91 WA -
testcase_92 WA -
testcase_93 WA -
testcase_94 WA -
testcase_95 WA -
testcase_96 WA -
testcase_97 WA -
testcase_98 WA -
testcase_99 WA -
testcase_100 WA -
testcase_101 WA -
testcase_102 WA -
testcase_103 WA -
testcase_104 WA -
testcase_105 WA -
testcase_106 WA -
testcase_107 WA -
testcase_108 WA -
testcase_109 WA -
testcase_110 TLE -
testcase_111 -- -
testcase_112 -- -
testcase_113 -- -
testcase_114 -- -
testcase_115 -- -
testcase_116 -- -
testcase_117 -- -
testcase_118 -- -
testcase_119 -- -
testcase_120 -- -
testcase_121 -- -
testcase_122 -- -
testcase_123 -- -
testcase_124 -- -
testcase_125 -- -
testcase_126 -- -
testcase_127 -- -
testcase_128 -- -
testcase_129 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


struct ModInt(int M_) {
  import std.conv : to;
  alias M = M_;
  int x;
  this(ModInt a) { x = a.x; }
  this(long a) { x = cast(int)(a % M); if (x < 0) x += M; }
  ref ModInt opAssign(long a) { return (this = ModInt(a)); }
  ref ModInt opOpAssign(string op)(ModInt a) {
    static if (op == "+") { x += a.x; if (x >= M) x -= M; }
    else static if (op == "-") { x -= a.x; if (x < 0) x += M; }
    else static if (op == "*") { x = cast(int)((cast(long)(x) * a.x) % M); }
    else static if (op == "/") { this *= a.inv(); }
    else static assert(false);
    return this;
  }
  ref ModInt opOpAssign(string op)(long a) {
    static if (op == "^^") {
      if (a < 0) return (this = inv()^^(-a));
      ModInt t2 = this, te = ModInt(1);
      for (long e = a; e > 0; e >>= 1) {
        if (e & 1) te *= t2;
        t2 *= t2;
      }
      x = cast(int)(te.x);
      return this;
    } else return mixin("this " ~ op ~ "= ModInt(a)");
  }
  ModInt inv() const {
    int a = x, b = M, y = 1, z = 0, t;
    for (; ; ) {
      t = a / b; a -= t * b;
      if (a == 0) {
        assert(b == 1 || b == -1);
        return ModInt(b * z);
      }
      y -= t * z;
      t = b / a; b -= t * a;
      if (b == 0) {
        assert(a == 1 || a == -1);
        return ModInt(a * y);
      }
      z -= t * y;
    }
  }
  ModInt opUnary(string op: "-")() const { return ModInt(-x); }
  ModInt opBinary(string op, T)(T a) const {
    return mixin("ModInt(this) " ~ op ~ "= a");
  }
  ModInt opBinaryRight(string op)(long a) const {
    return mixin("ModInt(a) " ~ op ~ "= this");
  }
  bool opCast(T: bool)() const { return (x != 0); }
  string toString() const { return x.to!string; }
}

enum MO = 1000000007;
alias Mint = ModInt!MO;


enum LIM = 2 * 10^^5 + 10;
Mint[] inv, fac, invFac;
void prepare() {
  inv = new Mint[LIM];
  fac = new Mint[LIM];
  invFac = new Mint[LIM];
  inv[1] = 1;
  foreach (i; 2 .. LIM) {
    inv[i] = -(Mint.M / i) * inv[cast(size_t)(Mint.M % i)];
  }
  fac[0] = invFac[0] = 1;
  foreach (i; 1 .. LIM) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(long n, long k) {
  if (0 <= k && k <= n) {
    assert(n < LIM);
    return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];
  } else {
    return Mint(0);
  }
}


Mint calc(int n, int k) {
  return Mint(n - k + 1) * Mint(n + 1)^^(k - 1);
}

void main() {
  prepare;
  
  /*
  debug {
    foreach (n; 1 .. 7 + 1) foreach (k; 1 .. n + 1) {
      int cnt;
      foreach (p; 0 .. n^^k) {
        auto freq = new int[n];
        foreach (i; 0 .. k) {
          ++freq[p / n^^i % n];
        }
        foreach_reverse (j; 0 .. n - 1) {
          freq[j] += freq[j + 1];
        }
        bool ok = true;
        foreach (j; 0 .. n) {
          ok = ok && (freq[j] <= n - j);
        }
        if (ok) {
          ++cnt;
          if (n <= 4) {
            writeln(iota(n).map!(i => (p / n^^i % n)));
          }
        }
      }
      writeln(n, " ", k, ": ", cnt);
      assert(cnt == (n - k + 1) * (n + 1)^^(k - 1));
    }
  }
  //*/
  
  try {
    for (; ; ) {
      const N = readInt();
      const M = readInt();
      const S = readToken();
      
      alias Query = Tuple!(string, "s", int, "sig");
      auto qss = new Query[][](M + 1);
      void pie(string s, int sig) {
        if (s.length >= 1 && s[0] == '-') {
          pie(s[1 .. $], sig);
          pie('o' ~ s[1 .. $], -sig);
        } else if (s.length >= 1 && s[$ - 1] == '-') {
          pie(s[0 .. $ - 1], sig);
          pie(s[0 .. $ - 1] ~ 'o', -sig);
        } else {
          qss[s.length] ~= Query(s, sig);
        }
      }
      pie(S, +1);
      
      Mint ans;
      
      foreach (m; 0 .. M + 1) {
        /*
          0 <= k <= m
          calc(N - m, k) / k! * (k + insideSum)! * N^(N - (k + insideSum))
        */
        auto sums = new Mint[m + 1];
        foreach (k; 0 .. N - m + 1) {
          const base = calc(N - m, k) * invFac[k] * Mint(N)^^(N - k);
          foreach (l; 0 .. m + 1) {
            sums[l] += base * fac[k + l];
          }
        }
        foreach (l; 0 .. m + 1) {
          sums[l] *= inv[N]^^l;
        }
        debug {
          writefln("m = %s: sums = %s", m, sums);
        }
        foreach (ref q; qss[m]) {
          int insideSum;
          Mint insideNum = 1;
          for (int i = 0, j; i < m; i = j) {
            for (j = i; j < m && q.s[i] == q.s[j]; ++j) {}
            if (q.s[i] == '-') {
              insideSum += (j - i);
              insideNum *= calc(j - i, j - i) * invFac[j - i];
            }
          }
          const here = insideNum * sums[insideSum];
          debug {
            writeln(q, ": ", here);
          }
          ans += q.sig * here;
        }
      }
      
      ans *= (N - M + 1);
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
0