結果
問題 | No.2403 "Eight" Bridges of Königsberg |
ユーザー | Akijin_007 |
提出日時 | 2023-08-04 22:05:36 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 268 ms / 2,000 ms |
コード長 | 1,930 bytes |
コンパイル時間 | 165 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 102,656 KB |
最終ジャッジ日時 | 2024-05-05 01:23:43 |
合計ジャッジ時間 | 5,778 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
52,224 KB |
testcase_01 | AC | 42 ms
52,096 KB |
testcase_02 | AC | 41 ms
52,096 KB |
testcase_03 | AC | 41 ms
52,480 KB |
testcase_04 | AC | 183 ms
77,056 KB |
testcase_05 | AC | 257 ms
76,928 KB |
testcase_06 | AC | 268 ms
77,440 KB |
testcase_07 | AC | 202 ms
76,928 KB |
testcase_08 | AC | 224 ms
77,312 KB |
testcase_09 | AC | 267 ms
77,824 KB |
testcase_10 | AC | 252 ms
77,824 KB |
testcase_11 | AC | 234 ms
77,696 KB |
testcase_12 | AC | 258 ms
77,952 KB |
testcase_13 | AC | 232 ms
77,568 KB |
testcase_14 | AC | 41 ms
52,352 KB |
testcase_15 | AC | 41 ms
52,224 KB |
testcase_16 | AC | 41 ms
52,096 KB |
testcase_17 | AC | 41 ms
52,736 KB |
testcase_18 | AC | 42 ms
52,480 KB |
testcase_19 | AC | 92 ms
95,872 KB |
testcase_20 | AC | 63 ms
68,224 KB |
testcase_21 | AC | 75 ms
79,232 KB |
testcase_22 | AC | 88 ms
91,904 KB |
testcase_23 | AC | 82 ms
88,576 KB |
testcase_24 | AC | 90 ms
88,576 KB |
testcase_25 | AC | 75 ms
82,304 KB |
testcase_26 | AC | 47 ms
53,888 KB |
testcase_27 | AC | 139 ms
102,656 KB |
testcase_28 | AC | 125 ms
95,872 KB |
testcase_29 | AC | 109 ms
79,744 KB |
testcase_30 | AC | 85 ms
80,640 KB |
testcase_31 | AC | 129 ms
100,480 KB |
testcase_32 | AC | 102 ms
76,928 KB |
testcase_33 | AC | 85 ms
78,336 KB |
testcase_34 | AC | 109 ms
78,720 KB |
ソースコード
#int(input()) #map(int, input().split()) #list(map(int, input().split())) import sys sys.setrecursionlimit(200000) 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): return {r: self.members(r) for r in self.roots()} def __str__(self): return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) N, M = map(int, input().split()) din = [0] * N dout = [0] * N u = UnionFind(N) for i in range(M): w, v = map(int, input().split()) din[w-1] += 1 dout[v-1] += 1 u.union(v-1, w-1) d = dict() for i in range(N): t = u.find(i) if t not in d: d[t] = min(abs(din[i] - dout[i]), 1) else: d[t] += min(abs(din[i] - dout[i]), 1) # print(din) # print(dout) cnt = 0 f = 0 for k, x in d.items(): if din[k] == 0 and dout[k] == 0: continue if x == 0: cnt += 1 else: f = 1 if f == 0: print(cnt-1) exit() e = 0 for i in range(N): e += max(0, din[i]-dout[i]) print(max(0, e+cnt-1))