結果
問題 | No.2403 "Eight" Bridges of Königsberg |
ユーザー | cleantted |
提出日時 | 2023-08-04 22:42:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,237 ms / 2,000 ms |
コード長 | 3,613 bytes |
コンパイル時間 | 321 ms |
コンパイル使用メモリ | 87,240 KB |
実行使用メモリ | 171,132 KB |
最終ジャッジ日時 | 2023-08-17 18:40:23 |
合計ジャッジ時間 | 21,959 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 353 ms
98,740 KB |
testcase_01 | AC | 349 ms
99,168 KB |
testcase_02 | AC | 345 ms
99,224 KB |
testcase_03 | AC | 351 ms
98,768 KB |
testcase_04 | AC | 706 ms
125,212 KB |
testcase_05 | AC | 1,159 ms
158,696 KB |
testcase_06 | AC | 1,192 ms
164,552 KB |
testcase_07 | AC | 834 ms
137,596 KB |
testcase_08 | AC | 949 ms
145,028 KB |
testcase_09 | AC | 1,237 ms
171,132 KB |
testcase_10 | AC | 1,095 ms
164,872 KB |
testcase_11 | AC | 998 ms
148,436 KB |
testcase_12 | AC | 1,173 ms
167,128 KB |
testcase_13 | AC | 929 ms
145,724 KB |
testcase_14 | AC | 349 ms
98,876 KB |
testcase_15 | AC | 350 ms
98,876 KB |
testcase_16 | AC | 374 ms
99,180 KB |
testcase_17 | AC | 355 ms
99,212 KB |
testcase_18 | AC | 355 ms
98,836 KB |
testcase_19 | AC | 382 ms
113,160 KB |
testcase_20 | AC | 360 ms
101,044 KB |
testcase_21 | AC | 353 ms
103,592 KB |
testcase_22 | AC | 380 ms
113,348 KB |
testcase_23 | AC | 378 ms
113,348 KB |
testcase_24 | AC | 377 ms
112,376 KB |
testcase_25 | AC | 364 ms
104,472 KB |
testcase_26 | AC | 362 ms
99,196 KB |
testcase_27 | AC | 423 ms
120,992 KB |
testcase_28 | AC | 416 ms
116,728 KB |
testcase_29 | AC | 389 ms
104,404 KB |
testcase_30 | AC | 364 ms
103,104 KB |
testcase_31 | AC | 419 ms
120,352 KB |
testcase_32 | AC | 395 ms
101,076 KB |
testcase_33 | AC | 392 ms
101,160 KB |
testcase_34 | AC | 407 ms
104,260 KB |
ソースコード
# 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()