結果
問題 | No.1204 お菓子配り-FINAL |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-08-30 01:53:17 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 1,168 ms / 8,000 ms |
コード長 | 6,632 bytes |
コンパイル時間 | 1,403 ms |
コンパイル使用メモリ | 156,808 KB |
実行使用メモリ | 7,676 KB |
最終ジャッジ日時 | 2023-09-04 09:34:00 |
合計ジャッジ時間 | 19,058 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 12 ms
5,744 KB |
testcase_01 | AC | 19 ms
6,372 KB |
testcase_02 | AC | 13 ms
7,328 KB |
testcase_03 | AC | 10 ms
5,708 KB |
testcase_04 | AC | 23 ms
6,372 KB |
testcase_05 | AC | 17 ms
6,580 KB |
testcase_06 | AC | 16 ms
6,868 KB |
testcase_07 | AC | 20 ms
6,812 KB |
testcase_08 | AC | 11 ms
6,236 KB |
testcase_09 | AC | 13 ms
7,324 KB |
testcase_10 | AC | 20 ms
5,644 KB |
testcase_11 | AC | 18 ms
6,924 KB |
testcase_12 | AC | 18 ms
5,632 KB |
testcase_13 | AC | 19 ms
5,680 KB |
testcase_14 | AC | 15 ms
6,544 KB |
testcase_15 | AC | 9 ms
5,688 KB |
testcase_16 | AC | 12 ms
6,780 KB |
testcase_17 | AC | 10 ms
7,136 KB |
testcase_18 | AC | 12 ms
5,648 KB |
testcase_19 | AC | 13 ms
5,700 KB |
testcase_20 | AC | 29 ms
5,732 KB |
testcase_21 | AC | 126 ms
6,996 KB |
testcase_22 | AC | 25 ms
5,744 KB |
testcase_23 | AC | 69 ms
7,388 KB |
testcase_24 | AC | 39 ms
5,696 KB |
testcase_25 | AC | 10 ms
6,996 KB |
testcase_26 | AC | 48 ms
6,796 KB |
testcase_27 | AC | 166 ms
6,240 KB |
testcase_28 | AC | 9 ms
5,736 KB |
testcase_29 | AC | 52 ms
6,648 KB |
testcase_30 | AC | 58 ms
5,752 KB |
testcase_31 | AC | 129 ms
5,632 KB |
testcase_32 | AC | 12 ms
6,424 KB |
testcase_33 | AC | 66 ms
6,468 KB |
testcase_34 | AC | 23 ms
6,548 KB |
testcase_35 | AC | 32 ms
5,748 KB |
testcase_36 | AC | 65 ms
5,772 KB |
testcase_37 | AC | 55 ms
6,548 KB |
testcase_38 | AC | 29 ms
7,132 KB |
testcase_39 | AC | 29 ms
5,680 KB |
testcase_40 | AC | 23 ms
6,488 KB |
testcase_41 | AC | 9 ms
6,776 KB |
testcase_42 | AC | 8 ms
5,696 KB |
testcase_43 | AC | 10 ms
7,676 KB |
testcase_44 | AC | 8 ms
6,508 KB |
testcase_45 | AC | 9 ms
6,936 KB |
testcase_46 | AC | 8 ms
5,648 KB |
testcase_47 | AC | 9 ms
6,808 KB |
testcase_48 | AC | 23 ms
6,572 KB |
testcase_49 | AC | 18 ms
5,632 KB |
testcase_50 | AC | 20 ms
7,004 KB |
testcase_51 | AC | 11 ms
6,912 KB |
testcase_52 | AC | 11 ms
6,848 KB |
testcase_53 | AC | 16 ms
7,396 KB |
testcase_54 | AC | 23 ms
6,232 KB |
testcase_55 | AC | 9 ms
6,412 KB |
testcase_56 | AC | 19 ms
6,744 KB |
testcase_57 | AC | 9 ms
5,756 KB |
testcase_58 | AC | 12 ms
6,220 KB |
testcase_59 | AC | 16 ms
5,760 KB |
testcase_60 | AC | 8 ms
6,840 KB |
testcase_61 | AC | 8 ms
6,740 KB |
testcase_62 | AC | 8 ms
5,844 KB |
testcase_63 | AC | 8 ms
6,760 KB |
testcase_64 | AC | 8 ms
6,204 KB |
testcase_65 | AC | 8 ms
5,672 KB |
testcase_66 | AC | 8 ms
5,844 KB |
testcase_67 | AC | 8 ms
5,704 KB |
testcase_68 | AC | 8 ms
5,704 KB |
testcase_69 | AC | 8 ms
7,096 KB |
testcase_70 | AC | 8 ms
6,232 KB |
testcase_71 | AC | 8 ms
6,316 KB |
testcase_72 | AC | 8 ms
5,744 KB |
testcase_73 | AC | 8 ms
5,760 KB |
testcase_74 | AC | 8 ms
5,756 KB |
testcase_75 | AC | 8 ms
6,936 KB |
testcase_76 | AC | 8 ms
5,744 KB |
testcase_77 | AC | 7 ms
5,760 KB |
testcase_78 | AC | 7 ms
5,752 KB |
testcase_79 | AC | 8 ms
5,700 KB |
testcase_80 | AC | 8 ms
6,888 KB |
testcase_81 | AC | 8 ms
6,548 KB |
testcase_82 | AC | 8 ms
6,248 KB |
testcase_83 | AC | 8 ms
5,848 KB |
testcase_84 | AC | 8 ms
6,576 KB |
testcase_85 | AC | 7 ms
6,312 KB |
testcase_86 | AC | 8 ms
5,760 KB |
testcase_87 | AC | 8 ms
6,996 KB |
testcase_88 | AC | 8 ms
5,696 KB |
testcase_89 | AC | 8 ms
5,632 KB |
testcase_90 | AC | 475 ms
5,852 KB |
testcase_91 | AC | 122 ms
6,088 KB |
testcase_92 | AC | 226 ms
5,756 KB |
testcase_93 | AC | 563 ms
6,404 KB |
testcase_94 | AC | 420 ms
6,300 KB |
testcase_95 | AC | 653 ms
7,376 KB |
testcase_96 | AC | 1,168 ms
6,612 KB |
testcase_97 | AC | 129 ms
6,696 KB |
testcase_98 | AC | 450 ms
6,288 KB |
testcase_99 | AC | 633 ms
5,884 KB |
testcase_100 | AC | 48 ms
6,488 KB |
testcase_101 | AC | 434 ms
7,596 KB |
testcase_102 | AC | 897 ms
5,640 KB |
testcase_103 | AC | 812 ms
5,756 KB |
testcase_104 | AC | 1,014 ms
6,164 KB |
testcase_105 | AC | 101 ms
7,672 KB |
testcase_106 | AC | 12 ms
6,688 KB |
testcase_107 | AC | 57 ms
6,336 KB |
testcase_108 | AC | 467 ms
7,092 KB |
testcase_109 | AC | 623 ms
5,752 KB |
testcase_110 | AC | 119 ms
5,736 KB |
testcase_111 | AC | 40 ms
6,856 KB |
testcase_112 | AC | 39 ms
5,832 KB |
testcase_113 | AC | 55 ms
6,752 KB |
testcase_114 | AC | 87 ms
6,428 KB |
testcase_115 | AC | 87 ms
6,884 KB |
testcase_116 | AC | 119 ms
6,620 KB |
testcase_117 | AC | 70 ms
6,608 KB |
testcase_118 | AC | 24 ms
5,704 KB |
testcase_119 | AC | 134 ms
6,312 KB |
testcase_120 | AC | 198 ms
5,632 KB |
testcase_121 | AC | 39 ms
6,628 KB |
testcase_122 | AC | 103 ms
5,760 KB |
testcase_123 | AC | 24 ms
6,260 KB |
testcase_124 | AC | 197 ms
5,752 KB |
testcase_125 | AC | 150 ms
6,780 KB |
testcase_126 | AC | 71 ms
6,384 KB |
testcase_127 | AC | 87 ms
5,672 KB |
testcase_128 | AC | 87 ms
5,752 KB |
testcase_129 | AC | 451 ms
5,748 KB |
ソースコード
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); debug { foreach (m; 0 .. M + 1) { writefln("qss[%s] = %s", m, qss[m]); } } auto small = new Mint[M + 1]; foreach (n; 0 .. M + 1) { small[n] = calc(n, n) * invFac[n]; } Mint ans; // m = 0 { int sigSum; foreach (ref q; qss[0]) { sigSum += q.sig; } ans += sigSum * Mint(N)^^N * Mint(N + 1); } foreach (m; 1 .. M + 1) { auto nums = new Mint[m + 1]; 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]; insideNum *= small[j - i]; } } nums[insideSum] += q.sig * insideNum; } debug { writefln("m = %s, nums = %s", m, nums); } /* 0 <= k <= m calc(N - m, k) / k! * (k + insideSum)! * N^(N - (k + insideSum)) */ foreach (l; 0 .. m + 1) { if (nums[l]) { Mint sum; // calc(n, k) = return Mint(n - k + 1) * Mint(n + 1)^^(k - 1); Mint pw = inv[(N - m) + 1]; foreach (k; 0 .. N - m + 1) { // sum += calc(N - m, k) * invFac[k] * fac[k + l] * Mint(N)^^(N - (k + l)); sum += Mint((N - m) - k + 1) * pw * invFac[k] * fac[k + l] * Mint(N)^^(N - (k + l)); pw *= ((N - m) + 1); } ans += nums[l] * sum; } } } ans *= (N - M + 1); writeln(ans); } } catch (EOFException e) { } }