結果
問題 | No.2403 "Eight" Bridges of Königsberg |
ユーザー | Akijin_007 |
提出日時 | 2023-08-04 22:04:47 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,848 bytes |
コンパイル時間 | 277 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 102,528 KB |
最終ジャッジ日時 | 2024-04-22 20:21:09 |
合計ジャッジ時間 | 5,304 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
52,352 KB |
testcase_01 | AC | 38 ms
52,480 KB |
testcase_02 | AC | 38 ms
52,352 KB |
testcase_03 | AC | 37 ms
52,480 KB |
testcase_04 | AC | 166 ms
76,928 KB |
testcase_05 | AC | 224 ms
77,312 KB |
testcase_06 | AC | 238 ms
77,440 KB |
testcase_07 | AC | 183 ms
77,056 KB |
testcase_08 | AC | 199 ms
77,312 KB |
testcase_09 | AC | 237 ms
77,952 KB |
testcase_10 | AC | 219 ms
77,440 KB |
testcase_11 | AC | 204 ms
77,568 KB |
testcase_12 | AC | 229 ms
77,824 KB |
testcase_13 | AC | 211 ms
77,440 KB |
testcase_14 | AC | 38 ms
52,352 KB |
testcase_15 | WA | - |
testcase_16 | AC | 38 ms
52,352 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 84 ms
96,128 KB |
testcase_20 | AC | 58 ms
68,088 KB |
testcase_21 | AC | 68 ms
79,360 KB |
testcase_22 | AC | 84 ms
92,160 KB |
testcase_23 | AC | 80 ms
88,704 KB |
testcase_24 | AC | 88 ms
88,960 KB |
testcase_25 | AC | 69 ms
82,432 KB |
testcase_26 | AC | 42 ms
54,400 KB |
testcase_27 | AC | 129 ms
102,528 KB |
testcase_28 | AC | 114 ms
96,128 KB |
testcase_29 | AC | 97 ms
79,616 KB |
testcase_30 | AC | 79 ms
80,896 KB |
testcase_31 | AC | 118 ms
100,096 KB |
testcase_32 | AC | 92 ms
76,724 KB |
testcase_33 | AC | 76 ms
78,336 KB |
testcase_34 | AC | 97 ms
78,464 KB |
ソースコード
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) exit() e = 0 for i in range(N): e += max(0, din[i]-dout[i]) print(max(0, e+cnt-1))