結果
問題 | No.2522 Fall in love, Girls! |
ユーザー |
👑 |
提出日時 | 2023-10-27 21:50:50 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 391 ms / 2,000 ms |
コード長 | 5,667 bytes |
コンパイル時間 | 4,602 ms |
コンパイル使用メモリ | 159,832 KB |
実行使用メモリ | 66,304 KB |
最終ジャッジ日時 | 2024-09-25 13:58:06 |
合計ジャッジ時間 | 9,511 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 30 |
ソースコード
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; }string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }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(uint M_) {import std.conv : to;alias M = M_;uint x;this(ModInt a) { x = a.x; }this(uint x_) { x = x_ % M; }this(ulong x_) { x = cast(uint)(x_ % M); }this(int x_) { x = ((x_ %= cast(int)(M)) < 0) ? (x_ + cast(int)(M)) : x_; }this(long x_) { x = cast(uint)(((x_ %= cast(long)(M)) < 0) ? (x_ + cast(long)(M)) : x_); }ref ModInt opAssign(T)(inout(T) a) if (is(T == uint) || is(T == ulong) || is(T == int) || is(T == long)) { return this = ModInt(a); }ref ModInt opOpAssign(string op, T)(T a) {static if (is(T == ModInt)) {static if (op == "+") { x = ((x += a.x) >= M) ? (x - M) : x; }else static if (op == "-") { x = ((x -= a.x) >= M) ? (x + M) : x; }else static if (op == "*") { x = cast(uint)((cast(ulong)(x) * a.x) % M); }else static if (op == "/") { this *= a.inv(); }else static assert(false);return this;} else static if (op == "^^") {if (a < 0) return this = inv()^^(-a);ModInt b = this, c = 1U;for (long e = a; e; e >>= 1) { if (e & 1) c *= b; b *= b; }return this = c;} else {return mixin("this " ~ op ~ "= ModInt(a)");}}ModInt inv() const {uint a = M, b = x; int y = 0, z = 1;for (; b; ) { const q = a / b; const c = a - q * b; a = b; b = c; const w = y - cast(int)(q) * z; y = z; z = w; }assert(a == 1); return ModInt(y);}ModInt opUnary(string op)() const {static if (op == "+") { return this; }else static if (op == "-") { ModInt a; a.x = x ? (M - x) : 0U; return a; }else static assert(false);}ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); }ModInt opBinaryRight(string op, T)(T a) const { return mixin("ModInt(a) " ~ op ~ "= this"); }bool opCast(T: bool)() const { return (x != 0U); }string toString() const { return x.to!string; }}enum MO = 998244353;alias Mint = ModInt!MO;enum LIM_INV = 4 * 10^^6 + 10;Mint[] inv, fac, invFac;void prepare() {inv = new Mint[LIM_INV];fac = new Mint[LIM_INV];invFac = new Mint[LIM_INV];inv[1] = 1;foreach (i; 2 .. LIM_INV) {inv[i] = -((Mint.M / i) * inv[cast(size_t)(Mint.M % i)]);}fac[0] = invFac[0] = 1;foreach (i; 1 .. LIM_INV) {fac[i] = fac[i - 1] * i;invFac[i] = invFac[i - 1] * inv[i];}}Mint binom(long n, long k) {if (n < 0) {if (k >= 0) {return (-1)^^(k & 1) * binom(-n + k - 1, k);} else if (n - k >= 0) {return (-1)^^((n - k) & 1) * binom(-k - 1, n - k);} else {return Mint(0);}} else {if (0 <= k && k <= n) {assert(n < LIM_INV);return fac[cast(size_t)(n)] * invFac[cast(size_t)(k)] * invFac[cast(size_t)(n - k)];} else {return Mint(0);}}}void main() {prepare;try {for (; ; ) {const N = readInt;const M = readInt;const K = readInt;auto X = new int[K];auto Y = new int[K];foreach (k; 0 .. K) {X[k] = readInt - 1;Y[k] = readInt - 1;}int[] xs = X ~ Y;xs = xs.sort.uniq.array;const xsLen = cast(int)(xs.length);auto adj = new int[xsLen];foreach (k; 0 .. K) {const u = xs.lowerBound(X[k]);const v = xs.lowerBound(Y[k]);adj[u] |= 1 << v;}Mint[2] easy;foreach (h; 0 .. 2) {auto dp = new long[1 << xsLen];foreach (u; 0 .. xsLen) if (h ? (xs[u] >= M) : (xs[u] < M)) {dp[1 << u] += 1;}foreach (p; 0 .. 1 << xsLen) if (dp[p]) {foreach (u; 0 .. xsLen) if (!(p & 1 << u)) {if (!(p & adj[u])) {dp[p | 1 << u] += dp[p];}}}easy[h] += dp[$ - 1];}debug {writeln("xs = ", xs);writeln("easy = ", easy);}Mint ans;if (xsLen) {int[2] rem = [M, N - M];foreach (x; xs) {--rem[(x >= M) ? 1 : 0];}if (rem[1]) {const oth = Mint(rem[1]) * fac[rem[0] + rem[1] - 1];ans += easy[0] * oth * binom(N - 1, xsLen);}ans += easy[1] * (fac[N] * invFac[xsLen]);if (rem[0]) {const oth = Mint(rem[0]) * fac[rem[0] + rem[1] - 1];ans -= easy[1] * oth * binom(N - 1, xsLen);}} else {ans += Mint(N - M) * fac[N - 1];}writeln(ans);}} catch (EOFException e) {}}