結果
問題 | No.2403 "Eight" Bridges of Königsberg |
ユーザー | mono_0812 |
提出日時 | 2023-08-04 22:20:03 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,284 bytes |
コンパイル時間 | 188 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 137,344 KB |
最終ジャッジ日時 | 2024-10-14 20:19:21 |
合計ジャッジ時間 | 8,994 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 149 ms
93,096 KB |
testcase_01 | AC | 147 ms
93,056 KB |
testcase_02 | AC | 157 ms
93,056 KB |
testcase_03 | AC | 152 ms
92,928 KB |
testcase_04 | AC | 265 ms
94,336 KB |
testcase_05 | AC | 321 ms
94,208 KB |
testcase_06 | AC | 338 ms
94,336 KB |
testcase_07 | AC | 267 ms
94,208 KB |
testcase_08 | AC | 299 ms
94,336 KB |
testcase_09 | AC | 361 ms
94,208 KB |
testcase_10 | AC | 341 ms
94,208 KB |
testcase_11 | AC | 305 ms
94,144 KB |
testcase_12 | AC | 338 ms
94,272 KB |
testcase_13 | AC | 315 ms
94,336 KB |
testcase_14 | AC | 148 ms
93,144 KB |
testcase_15 | AC | 147 ms
93,056 KB |
testcase_16 | AC | 149 ms
93,184 KB |
testcase_17 | WA | - |
testcase_18 | AC | 147 ms
93,184 KB |
testcase_19 | AC | 217 ms
137,344 KB |
testcase_20 | AC | 160 ms
95,488 KB |
testcase_21 | AC | 179 ms
105,600 KB |
testcase_22 | AC | 187 ms
116,960 KB |
testcase_23 | AC | 187 ms
114,288 KB |
testcase_24 | AC | 214 ms
123,896 KB |
testcase_25 | AC | 179 ms
109,224 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 220 ms
113,784 KB |
testcase_29 | WA | - |
testcase_30 | AC | 183 ms
102,480 KB |
testcase_31 | AC | 226 ms
118,984 KB |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 201 ms
94,848 KB |
ソースコード
############################################################################################ import bisect,collections,copy,heapq,itertools,math,string,sys,queue,time,random from decimal import Decimal def I(): return input() def IS(): return input().split() def II(): return int(input()) def IIS(): return list(map(int,input().split())) def LIIS(): return list(map(int,input().split())) def make_divisors(n): lower_divisors , upper_divisors = [], [] i = 1 while i*i <= n: if n % i == 0: lower_divisors.append(i) if i != n // i: upper_divisors.append(n//i) i += 1 return lower_divisors + upper_divisors[::-1] import math def prime_numbers(n): prime = [True for i in range(n+1)] prime[0] = False prime[1] = False sqrt_n = math.ceil(math.sqrt(n)) for i in range(2, sqrt_n): if prime[i]: for j in range(2*i, n+1, i): prime[j] = False numbers=[] for i in range(2,n+1): if prime[i]: numbers.append(i) return numbers def factorization(n): arr = [] temp = n for i in range(2, int(-(-n**0.5//1))+1): if temp%i==0: cnt=0 while temp%i==0: cnt+=1 temp //= i arr.append([i, cnt]) if temp!=1: arr.append([temp, 1]) if arr==[]: arr.append([n, 1]) return arr INF=float("inf") MOD=998244353 MOD2=10**9+7 #sys.setrecursionlimit(500005) def bit_count(x): return bin(x).count("1") def yesno(f): if f:print("Yes") else: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=IIS() li=[0 for i in range(n)] uf=UnionFind(n) for _ in range(m): u,v=IIS() li[u-1]+=1 li[v-1]-=1 uf.union(u-1,v-1) ans=0 cnt2=0 s=uf.all_group_members() for i in s: cnt=0 if len(s[i])>1: cnt2+=1 for j in s[i]: cnt+=abs(li[j]) ans+=max(cnt//2-1,0) print(ans+max(cnt2-1,0))