結果

問題 No.2522 Fall in love, Girls!
ユーザー MasKoaTS
提出日時 2023-10-27 13:30:59
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 350 ms / 2,000 ms
コード長 1,926 bytes
コンパイル時間 243 ms
コンパイル使用メモリ 82,340 KB
実行使用メモリ 98,176 KB
最終ジャッジ日時 2024-09-25 13:16:52
合計ジャッジ時間 7,720 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff # 

import itertools as iter
import collections as coll
import heapq as hq
import bisect as bis
from decimal import Decimal as dec
from functools import cmp_to_key
import math
import sys
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10 ** 6)
inp = sys.stdin.readline
input = lambda : inp()[:-1]
getN = lambda : int(inp())
getNs = lambda : map(int, inp().split())
getList = lambda :list(map(int, inp().split()))
getStrs = lambda n : [input() for _ in [0] * n]
getEdges = lambda n : [[x - 1 for x in getNs()] for _ in [0] * n]
def yexit(): print("Yes"); exit(0)
def nexit(): print("No"); exit(0)
pi = 3.141592653589793
mod = 1000000007
MOD = 998244353
INF = 4611686018427387903
dx = [1, 0, -1, 0];  dy = [0, 1, 0, -1]
#di = coll.defaultdict(int)

def nPk(n, k):
    ret = 1
    for i in range(n, n - k, -1):
        ret *= i
        ret %= MOD
    return ret
 
"""
Main Code
"""

N, M, K = getNs()
edges = getEdges(K)

A = set([])
for x, y in edges:
    A |= set([x, y])
t = len(A)
id_A = { x : i for i, x in enumerate(sorted(A)) }
graph = [[0] * t for _ in [0] * t]
for x, y in edges:
    graph[id_A[x]][id_A[y]] = 1

def can_set_left(s, i):
    for j in range(t):
        if not((s >> j) & 1 and graph[j][i]):
            continue
        return False
    return True

dp = [-1] * (1 << t)
dp[0] = 1
def count_toposo(s):
    if(dp[s] == -1):
        dp[s] = 0
        for i in range(t):
            if not((s >> i) & 1 and can_set_left(s, i)):
                continue
            dp[s] += count_toposo(s - (1 << i))
        dp[s] %= MOD
    return dp[s]

ans = 0
p1 = nPk(N - 1, N - t)
p2 = nPk(N - 1, N - t - 1)
for i in range(M, N):
    if(i in A):
        id = id_A[i]
        if not(can_set_left((1 << t) - 1, id)):
            continue
        ans += p1 * count_toposo((1 << t) - 1 - (1 << id)) % MOD
    else:
        ans += p2 * count_toposo((1 << t) - 1) % MOD
ans %= MOD
print(ans)
0