結果
問題 | No.2522 Fall in love, Girls! |
ユーザー | Shirotsume |
提出日時 | 2023-09-22 04:31:14 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 851 ms / 2,000 ms |
コード長 | 2,610 bytes |
コンパイル時間 | 171 ms |
コンパイル使用メモリ | 81,740 KB |
実行使用メモリ | 176,036 KB |
最終ジャッジ日時 | 2023-10-27 20:50:45 |
合計ジャッジ時間 | 15,947 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 161 ms
85,620 KB |
testcase_01 | AC | 164 ms
85,620 KB |
testcase_02 | AC | 169 ms
85,620 KB |
testcase_03 | AC | 473 ms
108,772 KB |
testcase_04 | AC | 161 ms
85,620 KB |
testcase_05 | AC | 158 ms
85,620 KB |
testcase_06 | AC | 226 ms
121,064 KB |
testcase_07 | AC | 222 ms
117,824 KB |
testcase_08 | AC | 239 ms
118,584 KB |
testcase_09 | AC | 258 ms
154,028 KB |
testcase_10 | AC | 812 ms
175,664 KB |
testcase_11 | AC | 706 ms
175,680 KB |
testcase_12 | AC | 255 ms
154,020 KB |
testcase_13 | AC | 851 ms
175,936 KB |
testcase_14 | AC | 724 ms
175,984 KB |
testcase_15 | AC | 712 ms
175,612 KB |
testcase_16 | AC | 749 ms
176,036 KB |
testcase_17 | AC | 376 ms
170,036 KB |
testcase_18 | AC | 335 ms
168,452 KB |
testcase_19 | AC | 324 ms
168,392 KB |
testcase_20 | AC | 285 ms
154,260 KB |
testcase_21 | AC | 333 ms
162,240 KB |
testcase_22 | AC | 323 ms
164,352 KB |
testcase_23 | AC | 343 ms
166,200 KB |
testcase_24 | AC | 306 ms
153,576 KB |
testcase_25 | AC | 824 ms
163,928 KB |
testcase_26 | AC | 736 ms
147,160 KB |
testcase_27 | AC | 209 ms
121,880 KB |
testcase_28 | AC | 787 ms
124,028 KB |
testcase_29 | AC | 290 ms
148,368 KB |
testcase_30 | AC | 347 ms
166,448 KB |
testcase_31 | AC | 304 ms
149,316 KB |
testcase_32 | AC | 777 ms
143,524 KB |
testcase_33 | AC | 281 ms
153,240 KB |
ソースコード
import sys, time, random from collections import deque, Counter, defaultdict input = lambda: sys.stdin.readline().rstrip() ii = lambda: int(input()) mi = lambda: map(int, input().split()) li = lambda: list(mi()) inf = 2 ** 63 - 1 mod = 998244353 class Combinatorics(): def __init__(self, mod, maxi): self.mod = mod self.maxi = maxi self.facs = [1] * (maxi + 1) self.factinvs = [1] * (maxi + 1) self.invs = [1] * (maxi + 1) for i in range(2, self.maxi + 1): self.facs[i] = ((self.facs[i-1] * i) % self.mod) self.invs[i] = (-self.invs[self.mod % i] * (self.mod // i)) % self.mod self.factinvs[i] = (self.factinvs[i-1] * self.invs[i]) % self.mod def choose(self, n, k) -> int: if k < 0 or k > n: return 0 if k == 0 or k == n: return 1 k = min(k, n - k) return (((self.facs[n] * self.factinvs[k]) % self.mod) * self.factinvs[n-k]) % self.mod def perm(self, n, k) -> int: return (self.choose(n, k) * self.facs[k]) % self.mod def homop(self, n, k) -> int: if n == k == 0: return 1 return self.choose(n + k - 1, k) C = Combinatorics(mod, 10 ** 6 + 2) n, m, k = mi() graph = [[] for _ in range(n)] invgraph = [[] for _ in range(n)] S = set() for _ in range(k): x, y = mi() x -= 1; y -= 1 S.add(x) S.add(y) graph[x].append(y) invgraph[y].append(x) if k == 0: ans = (n - m) * C.facs[n - 1] ans %= mod else: S = list(sorted(S)) N = len(S) dp = [0 for _ in range(1 << N)] subs = len([i for i in S if i < m]) mains = len([i for i in S if i >= m]) mgraph = [[] for _ in range(N)] minvgraph = [[] for _ in range(N)] for i in range(N): for to in graph[S[i]]: mgraph[i].append(S.index(to)) minvgraph[S.index(to)].append(i) dp[0] = 1 for bit in range(1 << N): for i in range(N): if 1 & (bit >> i): f = True for to in minvgraph[i]: if 1 & (bit >> to): f = False break if f: dp[bit] += dp[bit ^ (1 << i)] dp[bit] %= mod ans = 0 for i in range(m, n): if i in S and len(invgraph[i]) == 0: j = S.index(i) ans += C.perm(n - 1, n - N) * dp[((1 << N) - 1) ^ (1 << j)] ans %= mod if i not in S: ans += C.perm(n - 1, n - N - 1) * dp[(1 << N) - 1] ans %= mod print(ans)