提出 #61661072

---

ソースコード 拡げる

import sys

input = sys.stdin.readline


def calc(a, b, x, y):
    """
    0 : Takahashi Win
    1 : Aoki Win
    2 : Sente Win
    3 : Gote Win
    """
    if x % 2 == 0 and y % 2 == 0:
        return 2 if (a + b) % 2 == 1 else 3
    if x % 2 == 1 and y % 2 == 1:
        return 2 if b % 2 == 1 else 3
    if x % 2 == 0 and y % 2 == 1:
        if a == 0:
            return 2 if b % 2 == 1 else 3
        if a == 1:
            return 2 if b % 2 == 1 else 0
        return 0
    if x % 2 == 1 and y % 2 == 0:
        if a == 0:
            return 2 if b % 2 == 1 else 3
        if a == 1:
            return 2 if b % 2 == 1 else 1
        return 1


n, x, y = map(int, input().split())
c = [0] * 4
for i in range(n):
    a, b = map(int, input().split())
    c[calc(a, b, x, y)] += 1
mod = 998244353
fact = [1] * (n + 1)
finv = [1] * (n + 1)
for i in range(1, n + 1):
    fact[i] = i * fact[i - 1] % mod
finv[n] = pow(fact[n], mod - 2, mod)
for i in range(n, 0, -1):
    finv[i - 1] = i * finv[i] % mod


def comb(n, k):
    return finv[k] * finv[n - k] % mod * fact[n] % mod


f = [comb(c[0] + c[1], i) for i in range(c[0] + c[1] + 1)]
for i in range(len(f) - 2, -1, -1):
    f[i] += f[i + 1]
    f[i] %= mod
ans = 0
for i in range(c[2] + 1):
    idx = max(0, c[1] + c[2] + 1 - 2 * i)
    if idx < len(f):
        ans += comb(c[2], i) * f[idx]
        ans %= mod
ans *= pow(2, c[3], mod)
print(ans % mod)

提出情報

ジャッジ結果