結果
問題 | No.1293 2種類の道路 |
ユーザー | semisagi |
提出日時 | 2020-11-20 22:00:08 |
言語 | Swift (5.10.0) |
結果 |
AC
|
実行時間 | 319 ms / 2,000 ms |
コード長 | 1,939 bytes |
コンパイル時間 | 2,254 ms |
コンパイル使用メモリ | 131,108 KB |
実行使用メモリ | 21,308 KB |
最終ジャッジ日時 | 2023-09-30 19:15:14 |
合計ジャッジ時間 | 7,706 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
7,988 KB |
testcase_01 | AC | 3 ms
7,984 KB |
testcase_02 | AC | 3 ms
7,924 KB |
testcase_03 | AC | 3 ms
7,988 KB |
testcase_04 | AC | 3 ms
7,984 KB |
testcase_05 | AC | 3 ms
7,948 KB |
testcase_06 | AC | 3 ms
7,892 KB |
testcase_07 | AC | 3 ms
7,928 KB |
testcase_08 | AC | 3 ms
7,960 KB |
testcase_09 | AC | 318 ms
13,780 KB |
testcase_10 | AC | 319 ms
13,860 KB |
testcase_11 | AC | 318 ms
13,804 KB |
testcase_12 | AC | 317 ms
13,880 KB |
testcase_13 | AC | 319 ms
13,820 KB |
testcase_14 | AC | 176 ms
14,568 KB |
testcase_15 | AC | 179 ms
14,476 KB |
testcase_16 | AC | 291 ms
15,648 KB |
testcase_17 | AC | 304 ms
15,908 KB |
testcase_18 | AC | 178 ms
17,888 KB |
testcase_19 | AC | 188 ms
21,308 KB |
testcase_20 | AC | 187 ms
21,192 KB |
testcase_21 | AC | 243 ms
8,008 KB |
testcase_22 | AC | 241 ms
7,964 KB |
testcase_23 | AC | 239 ms
7,960 KB |
ソースコード
struct Scanner { private var elements = [String]() private var index = 0 mutating func peek() -> String { while elements.count == index { elements = readLine()!.split(separator: " ").map(String.init) index = 0 } return elements[index] } mutating func next() -> String { defer { index += 1 } return peek() } mutating func nextInt() -> Int { return Int(next())! } mutating func nextInts(_ n: Int) -> [Int] { return (0 ..< n).map { _ in nextInt() } } mutating func nextDouble() -> Double { return Double(next())! } } struct UnionFind { var parent: [Int] var count: [Int] init(_ n: Int) { parent = Array(0 ..< n) count = [Int](repeating: 1, count: n) } mutating func find(_ v: Int) -> Int { if v == parent[v] { return v } parent[v] = find(parent[v]) return parent[v] } mutating func union(_ u: Int, _ v: Int) { var u = find(u) var v = find(v) guard u != v else { return } if count[u] < count[v] { swap(&u, &v) } count[u] += count[v] parent[v] = u } mutating func count(_ u: Int) -> Int { count[find(u)] } } var scanner = Scanner() let N = scanner.nextInt() let D = scanner.nextInt() let W = scanner.nextInt() var d = UnionFind(N) var w = UnionFind(N) for _ in 0 ..< D { let a = scanner.nextInt() - 1 let b = scanner.nextInt() - 1 d.union(a, b) } for _ in 0 ..< W { let c = scanner.nextInt() - 1 let d = scanner.nextInt() - 1 w.union(c, d) } var set = [Set<Int>](repeating: [], count: N) for i in 0 ..< N { set[d.find(i)].insert(w.find(i)) } var answer = 0 for i in 0 ..< N where d.find(i) == i { answer += (set[i].map { w.count($0) }.reduce(0, +)) * d.count(i) } print(answer - N)