結果

問題 No.2403 "Eight" Bridges of Königsberg
ユーザー tassei903tassei903
提出日時 2023-08-04 21:58:15
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 208 ms / 2,000 ms
コード長 2,342 bytes
コンパイル時間 154 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 119,040 KB
最終ジャッジ日時 2024-05-05 01:23:03
合計ジャッジ時間 5,262 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
54,912 KB
testcase_01 AC 44 ms
54,656 KB
testcase_02 AC 48 ms
54,656 KB
testcase_03 AC 41 ms
54,784 KB
testcase_04 AC 139 ms
77,440 KB
testcase_05 AC 194 ms
77,440 KB
testcase_06 AC 208 ms
78,080 KB
testcase_07 AC 149 ms
77,184 KB
testcase_08 AC 175 ms
77,696 KB
testcase_09 AC 206 ms
77,824 KB
testcase_10 AC 187 ms
77,440 KB
testcase_11 AC 185 ms
77,824 KB
testcase_12 AC 192 ms
77,056 KB
testcase_13 AC 183 ms
77,696 KB
testcase_14 AC 45 ms
54,400 KB
testcase_15 AC 43 ms
54,272 KB
testcase_16 AC 41 ms
54,912 KB
testcase_17 AC 44 ms
54,400 KB
testcase_18 AC 47 ms
54,656 KB
testcase_19 AC 117 ms
110,592 KB
testcase_20 AC 64 ms
72,576 KB
testcase_21 AC 77 ms
88,192 KB
testcase_22 AC 113 ms
110,464 KB
testcase_23 AC 108 ms
110,208 KB
testcase_24 AC 117 ms
103,296 KB
testcase_25 AC 104 ms
106,496 KB
testcase_26 AC 52 ms
55,808 KB
testcase_27 AC 165 ms
119,040 KB
testcase_28 AC 152 ms
109,184 KB
testcase_29 AC 116 ms
81,792 KB
testcase_30 AC 106 ms
94,720 KB
testcase_31 AC 158 ms
118,144 KB
testcase_32 AC 102 ms
77,184 KB
testcase_33 AC 104 ms
89,600 KB
testcase_34 AC 120 ms
79,872 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################

from collections import defaultdict
 
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
 
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
 
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
 
        if x == y:
            return
 
        if self.parents[x] > self.parents[y]:
            x, y = y, x
 
        self.parents[x] += self.parents[y]
        self.parents[y] = x
 
    def size(self, x):
        return -self.parents[self.find(x)]
 
    def same(self, x, y):
        return self.find(x) == self.find(y)
 
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
 
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
 
    def group_count(self):
        return len(self.roots())
 
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
 
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
n, m = na()
uf = UnionFind(n)
d = [0 for i in range(n)]
e = [0 for i in range(n)]
for _ in range(m):
    u,v = na()
    u-=1
    v-=1
    d[u] += 1
    d[v] -= 1
    e[u] += 1
    e[v] += 1
    uf.union(u, v)
    
g = uf.all_group_members()
from heapq import *
hq = []
for i in g:
    x = 0
    y = 0
    for j in g[i]:
        x += max(0, d[j])
        y += e[j]
    if y == 0:
        continue
    heappush(hq, -x)
ans = 0
#print(hq)
while len(hq) > 1:
    #print(hq)
    x = -heappop(hq)
    y = -heappop(hq)
    ans += 1
    if x and y:
        heappush(hq, -(x + y-1))
    elif x or y:
        heappush(hq, -x-y)
    else:
        heappush(hq, -1)

print(ans + max(-hq[0]-1, 0))
0