結果

問題 No.1813 Magical Stones
ユーザー tamato
提出日時 2022-01-14 23:07:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 564 ms / 2,000 ms
コード長 3,227 bytes
コンパイル時間 164 ms
コンパイル使用メモリ 82,296 KB
実行使用メモリ 111,784 KB
最終ジャッジ日時 2024-11-20 13:54:40
合計ジャッジ時間 11,986 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline
    from collections import deque

    # compressed[v]: 縮約後のグラフで縮約前のvが属する頂点
    # num: 縮約後のグラフの頂点数
    # 縮約後のグラフの頂点番号はトポロジカル順
    def SCC(adj, adj_rev):
        N = len(adj) - 1
        seen = [0] * (N + 1)
        compressed = [0] * (N + 1)
        order = []

        for v0 in range(1, N + 1):
            if seen[v0]:
                continue
            st = deque()
            st.append(v0)
            while st:
                v = st.pop()
                if v < 0:
                    order.append(-v)
                else:
                    if seen[v]:
                        continue
                    seen[v] = 1
                    st.append(-v)
                    for u in adj[v]:
                        st.append(u)

        seen = [0] * (N + 1)
        num = 0
        for v0 in reversed(order):
            if seen[v0]:
                continue
            num += 1
            st = deque()
            st.append(v0)
            seen[v0] = 1
            compressed[v0] = num
            while st:
                v = st.pop()
                for u in adj_rev[v]:
                    if seen[u]:
                        continue
                    seen[u] = 1
                    compressed[u] = num
                    st.append(u)

        return num, compressed

    # 縮約後のグラフを構築
    # 先にSCC()を実行してnum, compressedを作っておく
    def construct(adj, num, compressed):
        N = len(adj) - 1
        adj_compressed = [set() for _ in range(num + 1)]
        for v in range(1, N + 1):
            v_cmp = compressed[v]
            for u in adj[v]:
                u_cmp = compressed[u]
                if v_cmp != u_cmp:
                    adj_compressed[v_cmp].add(u_cmp)
        return adj_compressed

    N, M = map(int, input().split())
    adj = [[] for _ in range(N+1)]
    adj_rev = [[] for _ in range(N + 1)]
    for _ in range(M):
        a, b = map(int, input().split())
        adj[a].append(b)
        adj_rev[b].append(a)

    NN, compressed = SCC(adj, adj_rev)
    adj_new = construct(adj, NN, compressed)

    in_num = [0] * (NN + 1)
    out_num = [0] * (NN + 1)
    for v in range(1, NN + 1):
        for u in adj_new[v]:
            in_num[u] += 1
            out_num[v] += 1

    if NN == 1:
        print(0)
        exit()

    seen = [0] * (NN+1)
    v0_list = []
    plus_sum = minus_sum = 0
    for v0 in range(1, NN+1):
        if seen[v0]:
            continue
        v0_list.append(v0)
        seen[v0] = 1
        que = deque()
        que.append(v0)
        seq = []
        while que:
            v = que.popleft()
            seq.append(v)
            for u in adj_new[v]:
                if seen[u] == 0:
                    seen[u] = 1
                    que.append(u)
        p = s = 0
        for v in seq:
            if in_num[v] == 0:
                p += 1
            if out_num[v] == 0:
                s += 1
        plus_sum += p
        minus_sum += s
    print(max(plus_sum, minus_sum))


if __name__ == '__main__':
    main()
0