結果

問題 No.2403 "Eight" Bridges of Königsberg
ユーザー cleanttedcleantted
提出日時 2023-08-04 22:42:48
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 928 ms / 2,000 ms
コード長 3,613 bytes
コンパイル時間 221 ms
コンパイル使用メモリ 82,560 KB
実行使用メモリ 161,024 KB
最終ジャッジ日時 2024-05-05 01:27:24
合計ジャッジ時間 13,340 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 159 ms
91,008 KB
testcase_01 AC 151 ms
90,880 KB
testcase_02 AC 157 ms
91,008 KB
testcase_03 AC 157 ms
91,136 KB
testcase_04 AC 454 ms
119,040 KB
testcase_05 AC 776 ms
149,376 KB
testcase_06 AC 928 ms
156,928 KB
testcase_07 AC 548 ms
125,696 KB
testcase_08 AC 607 ms
137,088 KB
testcase_09 AC 893 ms
161,024 KB
testcase_10 AC 875 ms
156,928 KB
testcase_11 AC 684 ms
142,720 KB
testcase_12 AC 864 ms
160,640 KB
testcase_13 AC 624 ms
136,192 KB
testcase_14 AC 155 ms
90,880 KB
testcase_15 AC 154 ms
91,136 KB
testcase_16 AC 158 ms
91,008 KB
testcase_17 AC 156 ms
91,008 KB
testcase_18 AC 155 ms
91,264 KB
testcase_19 AC 191 ms
109,824 KB
testcase_20 AC 160 ms
92,160 KB
testcase_21 AC 172 ms
97,792 KB
testcase_22 AC 188 ms
108,800 KB
testcase_23 AC 190 ms
108,672 KB
testcase_24 AC 186 ms
106,112 KB
testcase_25 AC 171 ms
96,384 KB
testcase_26 AC 159 ms
91,008 KB
testcase_27 AC 235 ms
122,240 KB
testcase_28 AC 204 ms
104,320 KB
testcase_29 AC 191 ms
97,536 KB
testcase_30 AC 174 ms
95,616 KB
testcase_31 AC 232 ms
122,880 KB
testcase_32 AC 186 ms
93,696 KB
testcase_33 AC 173 ms
96,512 KB
testcase_34 AC 205 ms
96,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

# import bisect
import copy
import heapq
import itertools
import math
import operator
import random
import sys
from bisect import bisect, bisect_left, bisect_right, insort
from collections import Counter, deque
from fractions import Fraction
from functools import cmp_to_key, lru_cache, partial
from inspect import currentframe
from math import ceil, gcd, log10, pi, sqrt
from typing import Iterable, Iterator, List, Tuple, TypeVar, Union

# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# import string
# import networkx as nx
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
# mod = 10 ** 9 + 7
mod = 998244353
# mod = 1 << 128
# mod = 10 ** 30 + 1
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]

def read_values(): return tuple(map(int, input().split()))
def read_index(): return tuple(map(lambda x: int(x) - 1, input().split()))
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
def dprint(*values): print(*values, file=sys.stderr)
def dprint2(*values):
    names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
    dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values))


def f1(N, M, L):

    G = [set() for _ in range(N)]
    GR = [set() for _ in range(N)]
    for i, (u, v) in enumerate(L):
        G[u].add((v, i))
        GR[v].add((u, i))

    T = [0] * N
    F = [False] * M
    for i in range(M):
        if F[i]:
            continue
        F[i] = True
        u0, v0 = L[i]
        G[u0].discard((v0, i))
        GR[v0].discard((u0, i))

        u = v0
        while True:
            for v, k in G[u]:
                if F[k]:
                    continue
                F[k] = True
                break
            else:
                break
            G[u].discard((v, k))
            GR[v].discard((u, k))
            u = v
        u1 = u
        
        v = u0
        while True:
            for u, k in GR[v]:
                if F[k]:
                    continue
                F[k] = True
                break
            else:
                break
            GR[v].discard((u, k))
            G[u].discard((v, k))
            v = u
        v1 = v

        T[u1] += 1
        T[v1] += 1
    return sum(T) // 2 - 1


def f2(N, M, L):
    G = [set() for _ in range(N)]
    GR = [set() for _ in range(N)]
    for i, (u, v) in enumerate(L):
        G[u].add((v, i))
        GR[v].add((u, i))

    T = [0] * N
    F = [False] * M
    for i in reversed(range(M)):
        if F[i]:
            continue
        F[i] = True
        u0, v0 = L[i]
        G[u0].discard((v0, i))
        GR[v0].discard((u0, i))

        u = v0
        while True:
            for v, k in G[u]:
                if F[k]:
                    continue
                F[k] = True
                break
            else:
                break
            G[u].discard((v, k))
            GR[v].discard((u, k))
            u = v
        u1 = u
        
        v = u0
        while True:
            for u, k in GR[v]:
                if F[k]:
                    continue
                F[k] = True
                break
            else:
                break
            GR[v].discard((u, k))
            G[u].discard((v, k))
            v = u
        v1 = v

        T[u1] += 1
        T[v1] += 1
    return sum(T) // 2 - 1


def main():
    N, M = read_values()
    L = []

    for _ in range(M):
        u, v = read_index()
        L.append((u, v))

    print(min(f1(N, M, L), f2(N, M, L)))


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