結果
問題 | No.1268 Fruit Rush 2 |
ユーザー | semisagi |
提出日時 | 2020-10-23 22:59:35 |
言語 | Swift (5.10.0) |
結果 |
AC
|
実行時間 | 276 ms / 2,000 ms |
コード長 | 2,158 bytes |
コンパイル時間 | 4,988 ms |
コンパイル使用メモリ | 139,304 KB |
実行使用メモリ | 44,732 KB |
最終ジャッジ日時 | 2023-09-28 17:29:32 |
合計ジャッジ時間 | 9,640 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
7,972 KB |
testcase_01 | AC | 3 ms
7,852 KB |
testcase_02 | AC | 4 ms
7,860 KB |
testcase_03 | AC | 4 ms
7,980 KB |
testcase_04 | AC | 4 ms
7,972 KB |
testcase_05 | AC | 3 ms
8,000 KB |
testcase_06 | AC | 3 ms
7,912 KB |
testcase_07 | AC | 3 ms
7,912 KB |
testcase_08 | AC | 4 ms
7,808 KB |
testcase_09 | AC | 3 ms
7,916 KB |
testcase_10 | AC | 3 ms
7,908 KB |
testcase_11 | AC | 4 ms
7,804 KB |
testcase_12 | AC | 3 ms
8,076 KB |
testcase_13 | AC | 3 ms
7,992 KB |
testcase_14 | AC | 4 ms
7,988 KB |
testcase_15 | AC | 3 ms
7,932 KB |
testcase_16 | AC | 120 ms
19,784 KB |
testcase_17 | AC | 105 ms
19,192 KB |
testcase_18 | AC | 109 ms
19,484 KB |
testcase_19 | AC | 110 ms
19,376 KB |
testcase_20 | AC | 108 ms
19,320 KB |
testcase_21 | AC | 108 ms
19,308 KB |
testcase_22 | AC | 120 ms
19,700 KB |
testcase_23 | AC | 119 ms
19,888 KB |
testcase_24 | AC | 109 ms
19,416 KB |
testcase_25 | AC | 108 ms
19,196 KB |
testcase_26 | AC | 208 ms
29,180 KB |
testcase_27 | AC | 205 ms
29,132 KB |
testcase_28 | AC | 205 ms
29,060 KB |
testcase_29 | AC | 211 ms
29,116 KB |
testcase_30 | AC | 208 ms
29,108 KB |
testcase_31 | AC | 160 ms
29,104 KB |
testcase_32 | AC | 163 ms
29,100 KB |
testcase_33 | AC | 276 ms
44,732 KB |
testcase_34 | AC | 148 ms
29,156 KB |
testcase_35 | AC | 275 ms
44,632 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)] } } struct Array2D<Element> { let n1: Int let n2: Int private var elements: [Element] init(repeating: Element, _ n1: Int, _ n2: Int) { self.n1 = n1 self.n2 = n2 self.elements = [Element](repeating: repeating, count: n1 * n2) } subscript(i: Int, j: Int) -> Element { get { elements[i * n2 + j] } set { elements[i * n2 + j] = newValue } } } var scanner = Scanner() let N = scanner.nextInt() let A = (0 ..< N).map { _ in scanner.nextInt() }.sorted() var even = [Int: Int]() var answer = N for i in (0 ..< N).reversed() { answer += even[A[i] + 1] ?? 0 even[A[i]] = (even[A[i] + 2] ?? 0) + 1 } //if even.keys.contains(1) && even.keys.contains(2) { // var i = 4 // while even.keys.contains(i) { // print(even[i], i) // answer += even[i] ?? 0 // i += 2 // } //} print(answer)