結果
問題 | No.1170 Never Want to Walk |
ユーザー | semisagi |
提出日時 | 2020-08-14 21:38:34 |
言語 | Swift (5.10.0) |
結果 |
AC
|
実行時間 | 323 ms / 2,000 ms |
コード長 | 2,436 bytes |
コンパイル時間 | 14,285 ms |
コンパイル使用メモリ | 130,716 KB |
実行使用メモリ | 22,020 KB |
最終ジャッジ日時 | 2024-04-18 21:14:20 |
合計ジャッジ時間 | 18,873 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 7 ms
9,216 KB |
testcase_01 | AC | 7 ms
9,344 KB |
testcase_02 | AC | 7 ms
9,216 KB |
testcase_03 | AC | 7 ms
9,216 KB |
testcase_04 | AC | 8 ms
9,344 KB |
testcase_05 | AC | 7 ms
9,344 KB |
testcase_06 | AC | 6 ms
9,088 KB |
testcase_07 | AC | 8 ms
9,344 KB |
testcase_08 | AC | 7 ms
9,216 KB |
testcase_09 | AC | 7 ms
9,216 KB |
testcase_10 | AC | 8 ms
9,088 KB |
testcase_11 | AC | 8 ms
9,216 KB |
testcase_12 | AC | 9 ms
9,344 KB |
testcase_13 | AC | 8 ms
9,344 KB |
testcase_14 | AC | 8 ms
9,344 KB |
testcase_15 | AC | 8 ms
9,088 KB |
testcase_16 | AC | 8 ms
9,216 KB |
testcase_17 | AC | 9 ms
9,216 KB |
testcase_18 | AC | 8 ms
9,216 KB |
testcase_19 | AC | 8 ms
9,216 KB |
testcase_20 | AC | 8 ms
9,344 KB |
testcase_21 | AC | 9 ms
9,216 KB |
testcase_22 | AC | 9 ms
9,216 KB |
testcase_23 | AC | 9 ms
9,344 KB |
testcase_24 | AC | 9 ms
9,216 KB |
testcase_25 | AC | 8 ms
9,344 KB |
testcase_26 | AC | 8 ms
9,344 KB |
testcase_27 | AC | 306 ms
21,064 KB |
testcase_28 | AC | 304 ms
21,320 KB |
testcase_29 | AC | 315 ms
21,796 KB |
testcase_30 | AC | 313 ms
20,864 KB |
testcase_31 | AC | 307 ms
20,768 KB |
testcase_32 | AC | 299 ms
20,924 KB |
testcase_33 | AC | 311 ms
21,224 KB |
testcase_34 | AC | 323 ms
21,412 KB |
testcase_35 | AC | 312 ms
21,044 KB |
testcase_36 | AC | 311 ms
22,020 KB |
testcase_37 | AC | 306 ms
21,824 KB |
testcase_38 | AC | 313 ms
21,548 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 { let value = peek() index += 1 return value } mutating func nextInt() -> Int { return Int(next())! } 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)] } } extension Array where Element == Int { func lowerBound(_ value: Int) -> Int { var l = -1 var r = count while l + 2 <= r { let m = (l + r) / 2 if self[m] >= value { r = m } else { l = m } } return r } func upperBound(_ value: Int) -> Int { return lowerBound(value + 1) } } var scanner = Scanner() let N = scanner.nextInt() let A = scanner.nextInt() let B = scanner.nextInt() let X = (0 ..< N).map { _ in scanner.nextInt() } var unionfind = UnionFind(N) var count = [Int](repeating: 0, count: N) func connect(index i: Int, l: Int, r: Int) { if r - l == 1 { unionfind.union(i, l) } else if r - l >= 2 { unionfind.union(i, l) count[l] += 1 count[r - 1] -= 1 } } for i in X.indices { connect(index: i, l: X.lowerBound(X[i] - B), r: X.upperBound(X[i] - A)) connect(index: i, l: X.lowerBound(X[i] + A), r: X.upperBound(X[i] + B)) } for i in 0 ..< N - 1 { count[i + 1] += count[i] if count[i] > 0 { unionfind.union(i, i + 1) } } for i in 0 ..< N { print(unionfind.count(i)) }