結果

問題 No.2507 Yet Another Subgraph Counting
ユーザー suisensuisen
提出日時 2023-08-21 22:42:49
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,597 ms / 2,000 ms
コード長 4,561 bytes
コンパイル時間 502 ms
コンパイル使用メモリ 86,788 KB
実行使用メモリ 130,432 KB
最終ジャッジ日時 2023-10-13 18:25:42
合計ジャッジ時間 30,785 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 167 ms
82,208 KB
testcase_01 AC 178 ms
82,324 KB
testcase_02 AC 167 ms
82,168 KB
testcase_03 AC 153 ms
81,680 KB
testcase_04 AC 144 ms
81,036 KB
testcase_05 AC 322 ms
85,424 KB
testcase_06 AC 148 ms
80,832 KB
testcase_07 AC 165 ms
82,252 KB
testcase_08 AC 196 ms
82,792 KB
testcase_09 AC 143 ms
81,068 KB
testcase_10 AC 189 ms
82,696 KB
testcase_11 AC 315 ms
85,024 KB
testcase_12 AC 190 ms
83,112 KB
testcase_13 AC 186 ms
82,892 KB
testcase_14 AC 318 ms
85,276 KB
testcase_15 AC 153 ms
81,072 KB
testcase_16 AC 151 ms
80,892 KB
testcase_17 AC 316 ms
84,640 KB
testcase_18 AC 149 ms
80,692 KB
testcase_19 AC 279 ms
83,964 KB
testcase_20 AC 154 ms
80,884 KB
testcase_21 AC 165 ms
82,156 KB
testcase_22 AC 200 ms
83,060 KB
testcase_23 AC 331 ms
84,312 KB
testcase_24 AC 241 ms
83,740 KB
testcase_25 AC 410 ms
87,236 KB
testcase_26 AC 665 ms
95,660 KB
testcase_27 AC 328 ms
84,412 KB
testcase_28 AC 416 ms
87,152 KB
testcase_29 AC 199 ms
82,980 KB
testcase_30 AC 681 ms
96,016 KB
testcase_31 AC 1,524 ms
127,332 KB
testcase_32 AC 1,493 ms
127,804 KB
testcase_33 AC 308 ms
84,388 KB
testcase_34 AC 271 ms
83,732 KB
testcase_35 AC 312 ms
85,324 KB
testcase_36 AC 232 ms
83,468 KB
testcase_37 AC 1,568 ms
125,720 KB
testcase_38 AC 1,544 ms
124,556 KB
testcase_39 AC 1,524 ms
122,776 KB
testcase_40 AC 1,547 ms
124,740 KB
testcase_41 AC 1,562 ms
124,524 KB
testcase_42 AC 1,511 ms
124,848 KB
testcase_43 AC 681 ms
91,352 KB
testcase_44 AC 1,575 ms
127,236 KB
testcase_45 AC 316 ms
85,384 KB
testcase_46 AC 325 ms
85,112 KB
testcase_47 AC 1,549 ms
127,528 KB
testcase_48 AC 278 ms
83,260 KB
testcase_49 AC 1,597 ms
130,432 KB
testcase_50 AC 271 ms
83,936 KB
testcase_51 AC 701 ms
91,972 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from typing import List, Tuple

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: int, mask: int, bitwidth: int):
    dst = 0
    j = 0
    for i in range(bitwidth):
        if (mask >> i) & 1:
            dst |= ((src >> j) & 1) << i
            j += 1
    return dst

def count_cycles(n: int, edges: List[Tuple[int, int]]):
    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
    return cycle

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 = count_cycles(n, edges)

f = [0] * (1 << n)
for C in range(1, 1 << n):
    v = C.bit_length() - 1
    mask = ((1 << (v + 1)) - 1) ^ C
    k = popcount[mask]

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

    h = exp(g, k)
    for A in range(1 << k):
        X = bit_deposit(A, mask, v) | C
        f[X] += cycle[C] * h[A]

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