結果
問題 | No.2435 Order All Company |
ユーザー |
👑 |
提出日時 | 2023-09-16 22:49:31 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 113 ms / 2,000 ms |
コード長 | 4,734 bytes |
コンパイル時間 | 3,923 ms |
コンパイル使用メモリ | 154,440 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-03 21:37:59 |
合計ジャッジ時間 | 7,445 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 36 |
ソースコード
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;Mint det(const(Mint[][]) a) {const n = cast(int)(a.length);auto b = new Mint[][](n, n);foreach (i; 0 .. n) b[i][] = a[i][];Mint ret = 1;foreach (h; 0 .. n) {foreach (i; h .. n) if (b[i][h]) {if (h != i) {swap(b[h], b[i]);ret = -ret;}break;}ret *= b[h][h];if (!ret) break;const s = b[h][h].inv;int[] js;foreach (j; h + 1 .. n) if (b[h][j]) {b[h][j] *= s;js ~= j;}foreach (i; h + 1 .. n) if (b[i][h]) {const t = b[i][h];foreach (j; js) b[i][j] -= t * b[h][j];}}return ret;}void main() {try {for (; ; ) {const N = readInt;const K = readInt;auto T = new int[K];auto A = new int[][K];auto B = new int[][K];foreach (k; 0 .. K) {T[k] = readInt;A[k] = new int[T[k]];B[k] = new int[T[k]];foreach (t; 0 .. T[k]) {A[k][t] = readInt - 1;B[k][t] = readInt - 1;}}Mint ans;foreach (p; 0 .. 1 << K) {auto a = new Mint[][](N - 1, N - 1);void ae(int u, int v) {if (u < N - 1) a[u][u] += 1;if (v < N - 1) a[v][v] += 1;if (u < N - 1 && v < N - 1) {a[u][v] -= 1;a[v][u] -= 1;}}foreach (k; 0 .. K) if (!(p >> k & 1)) {foreach (t; 0 .. T[k]) {ae(A[k][t], B[k][t]);}}const res = det(a);ans += (-1)^^(popcnt(p)&1) * res;}writeln(ans);}} catch (EOFException e) {}}