結果
| 問題 | No.1025 Modular Equation |
| ユーザー |
👑  hos.lyric
|
| 提出日時 | 2020-04-10 23:15:59 |
| 言語 | D (dmd 2.109.1) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 6,409 bytes |
| コンパイル時間 | 1,455 ms |
| コンパイル使用メモリ | 157,784 KB |
| 実行使用メモリ | 13,696 KB |
| 最終ジャッジ日時 | 2024-06-22 06:35:36 |
| 合計ジャッジ時間 | 11,722 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 6 TLE * 1 -- * 25 |
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`
ソースコード
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 = 10^^9 + 7;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);}}void main() {prepare();debug {foreach (a; 0 .. 13) {foreach (r; 0 .. 3) {auto crt = new int[13];crt[2^^(0 + r) % 13] += 1;crt[2^^(3 + r) % 13] += 1;crt[2^^(6 + r) % 13] += 1;crt[2^^(9 + r) % 13] += 1;auto nxt = new int[13];foreach (x; 0 .. 13) foreach (y; 1 .. 13) {nxt[(x + a * y^^3) % 13] += crt[x];}writeln(a, " ", r, ": ", crt, " -> ", nxt);}}foreach (a; 0 .. 13) {foreach (r; 0 .. 6) {auto crt = new int[13];crt[2^^(0 + r) % 13] += 1;crt[2^^(6 + r) % 13] += 1;auto nxt = new int[13];foreach (x; 0 .. 13) foreach (y; 1 .. 13) {nxt[(x + a * y^^6) % 13] += crt[x];}writeln(a, " ", r, ": ", crt, " -> ", nxt);}}stdout.flush;}try {for (; ; ) {const P = readLong();const N = readInt();const K = readLong();const B = readLong();auto A = new long[N];foreach (i; 0 .. N) {A[i] = readLong();}long g;auto gs = new long[P - 1];for (g = 2; ; ++g) {gs[0] = 1;foreach (j; 1 .. P - 1) {gs[j] = (gs[j - 1] * g) % P;}if (gs[1 .. P - 1].all!"a != 1") {break;}}auto ord = new long[P];ord[0] = -1;foreach (j; 0 .. P - 1) {ord[gs[j]] = j;}debug {writeln("g = ", g);if (P < 100) {writeln("ord = ", ord);}}const m = gcd(P - 1, K);auto dp0 = new Mint[N + 1];auto dp = new Mint[][](N + 1, m);dp0[0] = 1;foreach (i; 0 .. N) {// from zero{// add zerodp0[i + 1] += dp0[i];// add nonzerofor (long j = 0; j < P - 1; j += m) {const t = (0 + A[i] * gs[j]) % P;if (t == 0) {dp0[i + 1] += dp0[i] * m;} else {dp[i + 1][ord[t] % m] += dp0[i] * m;}}}// from nonzeroforeach (r; 0 .. m) {// add zerodp[i + 1][r] += dp[i][r] * ((P - 1) / m);// add nonzero// !!!HELP!!!for (long k = r; k < P - 1; k += m) {for (long j = 0; j < P - 1; j += m) {const t = (gs[k] + A[i] * gs[j]) % P;if (t == 0) {dp0[i + 1] += dp[i][r] * m;} else {dp[i + 1][ord[t] % m] += dp[i][r] * m;}}}}dp[i + 1][] *= inv[(P - 1) / m];debug {writeln(dp0[i + 1], " ", dp[i + 1]);}}Mint ans;if (B == 0) {ans = dp0[N];} else {ans = dp[N][ord[B] % m];}writeln(ans);}} catch (EOFException e) {}}