結果

問題 No.2507 Yet Another Subgraph Counting
ユーザー suisensuisen
提出日時 2023-08-21 04:57:32
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,483 ms / 2,000 ms
コード長 4,612 bytes
コンパイル時間 618 ms
コンパイル使用メモリ 86,844 KB
実行使用メモリ 118,656 KB
最終ジャッジ日時 2023-10-13 18:25:04
合計ジャッジ時間 20,546 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 158 ms
81,700 KB
testcase_01 AC 179 ms
81,892 KB
testcase_02 AC 160 ms
81,840 KB
testcase_03 AC 150 ms
80,780 KB
testcase_04 AC 145 ms
80,832 KB
testcase_05 AC 202 ms
83,156 KB
testcase_06 AC 153 ms
80,796 KB
testcase_07 AC 161 ms
82,248 KB
testcase_08 AC 170 ms
82,116 KB
testcase_09 AC 148 ms
81,036 KB
testcase_10 AC 166 ms
82,084 KB
testcase_11 AC 216 ms
84,132 KB
testcase_12 AC 168 ms
82,488 KB
testcase_13 AC 162 ms
82,456 KB
testcase_14 AC 231 ms
84,564 KB
testcase_15 AC 147 ms
80,696 KB
testcase_16 AC 152 ms
81,080 KB
testcase_17 AC 248 ms
84,124 KB
testcase_18 AC 157 ms
80,780 KB
testcase_19 AC 192 ms
82,752 KB
testcase_20 AC 149 ms
80,856 KB
testcase_21 AC 161 ms
81,836 KB
testcase_22 AC 184 ms
82,220 KB
testcase_23 AC 317 ms
84,708 KB
testcase_24 AC 241 ms
83,756 KB
testcase_25 AC 320 ms
85,308 KB
testcase_26 AC 493 ms
89,820 KB
testcase_27 AC 288 ms
85,124 KB
testcase_28 AC 337 ms
85,520 KB
testcase_29 AC 183 ms
82,204 KB
testcase_30 AC 526 ms
91,112 KB
testcase_31 AC 274 ms
91,968 KB
testcase_32 AC 287 ms
92,928 KB
testcase_33 AC 227 ms
84,204 KB
testcase_34 AC 191 ms
83,184 KB
testcase_35 AC 207 ms
83,264 KB
testcase_36 AC 176 ms
82,324 KB
testcase_37 AC 799 ms
97,044 KB
testcase_38 AC 1,482 ms
118,656 KB
testcase_39 AC 400 ms
94,416 KB
testcase_40 AC 1,007 ms
101,376 KB
testcase_41 AC 1,479 ms
111,212 KB
testcase_42 AC 1,483 ms
117,384 KB
testcase_43 AC 253 ms
86,724 KB
testcase_44 AC 288 ms
92,236 KB
testcase_45 AC 224 ms
83,044 KB
testcase_46 AC 230 ms
83,200 KB
testcase_47 AC 284 ms
91,124 KB
testcase_48 AC 196 ms
82,692 KB
testcase_49 AC 346 ms
94,252 KB
testcase_50 AC 195 ms
83,312 KB
testcase_51 AC 245 ms
86,508 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from typing import List

N_MAX = 13
popcount = [0] * (1 << N_MAX)
for S in range(1, 1 << N_MAX):
    popcount[S] = popcount[S & (S - 1)] + 1

def addeq_poly(f: List[int], g: List[int]):
    """
    f += g
    """
    for i, gi in enumerate(g):
        f[i] += gi

def subeq_poly(f: List[int], g: List[int]):
    """
    f -= g
    """
    for i, gi in enumerate(g):
        f[i] -= gi

def subset_zeta(f: List[int], n: int):
    """
    Inplace conversion from f to ζf. ζf is defined as follows:
        (ζf)(S) = Σ[T⊆S] f(T)
    """
    block = 1
    while block < 1 << n:
        offset = 0
        while offset < 1 << n:
            for p in range(offset, offset + block):
                f[p + block] += f[p]
            offset += 2 * block
        block <<= 1

def subset_zeta_poly(f: List[List[int]], n: int):
    """
    Inplace conversion from f to ζf. ζf is defined as follows:
        (ζf)(S) = Σ[T⊆S] f(T)
    """
    block = 1
    while block < 1 << n:
        offset = 0
        while offset < 1 << n:
            for p in range(offset, offset + block):
                addeq_poly(f[p + block], f[p])
            offset += 2 * block
        block <<= 1

def subset_mobius_poly(f: List[List[int]], n: int):
    """
    Inplace conversion from f to μf. μf is defined as follows:
        (μf)(S) = Σ[T⊆S] (-1)^(|S/T|) f(T)
    """
    block = 1
    while block < 1 << n:
        offset = 0
        while offset < 1 << n:
            for p in range(offset, offset + block):
                subeq_poly(f[p + block], f[p])
            offset += 2 * block
        block <<= 1

def mul_poly(f: List[int], g: List[int]):
    """
    Returns h = fg mod x^n, where f, g are polynomials with degree n-1 defined as follows:
        f(x) = Σ_i f[i] x^i,
        g(x) = Σ_i g[i] x^i.
    """
    n = len(f)
    h = [0] * n
    for i in range(n):
        for j in range(n - i):
            h[i + j] += f[i] * g[j]

    return h

def ranked(f: List[int], n: int):
    """
    Add rank
    """
    return [[(i == popcount[S]) * f[S] for i in range(n + 1)] for S in range(1 << n)]

def deranked(rf: List[List[int]], n: int):
    """
    Remove rank
    """
    return [rf[S][popcount[S]] for S in range(1 << n)]

def exp(f: List[int], n: int):
    """
    Subset exp of Σ[S⊆{0,1,...,n-1}] f(S)
    """
    assert f[0] == 0
    rf = ranked([1], 0)
    for i in range(n):
        rg = ranked(f[1 << i: 1 << (i + 1)], i)
        subset_zeta_poly(rg, i)
        for S in range(1 << i):
            rf[S].append(0)
            rg[S].insert(0, 1)
            rh = mul_poly(rf[S], rg[S])
            rf.append(rh)
    subset_mobius_poly(rf, n)
    return deranked(rf, n)

def bit_deposit(src, mask):
    dst = 0
    j = 0
    for i in range(N_MAX):
        if (mask >> i) & 1:
            dst |= ((src >> j) & 1) << i
            j += 1
    return dst

def bit_extract(src, mask):
    dst = 0
    j = 0
    for i in range(N_MAX):
        if (mask >> i) & 1:
            dst |= ((src >> i) & 1) << j
            j += 1
    return dst

n, m = map(int, input().split())

edges = []
for _ in range(m):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    edges.append((u, v))

# E[S] = # of edges connecting vertices in S
E = [0] * (1 << n)
for u, v in edges:
    E[(1 << u) | (1 << v)] += 1
subset_zeta(E, n)

cycle = [0] * (1 << n)
adj = [[] for _ in range(n)]
for u, v in edges:
    adj[u].append(v)
    adj[v].append(u)

cycle_dp = [[0] * n for _ in range(1 << n)]
for v in range(n):
    cycle_dp[1 << v][v] = 1
for s in range(1, 1 << n):
    start = 0
    while not ((s >> start) & 1):
        start += 1
    for cur in range(n):
        if cycle_dp[s][cur] == 0:
            continue
        for nxt in adj[cur]:
            if start == nxt:
                cycle[s] += cycle_dp[s][cur]
            elif start < nxt and not ((s >> nxt) & 1):
                cycle_dp[s | (1 << nxt)][nxt] += cycle_dp[s][cur]

for s in range(1, 1 << n):
    if popcount[s] == 1:
        cycle[s] = 1
    elif popcount[s] == 2:
        cycle[s] = 0
    else:
        cycle[s] //= 2

f = [0]
for v in range(n):
    f += [0] * (1 << v)
    for X in range(1 << v, 1 << (v + 1)):
        if cycle[X] == 0:
            continue
        
        mask = ((1 << (v + 1)) - 1) ^ X
        k = popcount[mask]

        g = [0] * (1 << k)
        for T in range(1 << k):
            S = bit_deposit(T, mask)
            g[T] = f[S] * (E[S | X] - E[S] - E[X])

        exp_g = exp(g, k)
        for T in range(1 << k):
            S = bit_deposit(T, mask)
            f[S | X] += cycle[X] * exp_g[T]

print(exp(f, n)[-1])
0