結果
問題 | No.1267 Stop and Coin Game |
ユーザー | semisagi |
提出日時 | 2020-10-23 22:34:53 |
言語 | Swift (5.10.0) |
結果 |
AC
|
実行時間 | 742 ms / 2,000 ms |
コード長 | 2,239 bytes |
コンパイル時間 | 17,384 ms |
コンパイル使用メモリ | 137,504 KB |
実行使用メモリ | 8,764 KB |
最終ジャッジ日時 | 2023-09-28 16:42:22 |
合計ジャッジ時間 | 25,901 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
7,708 KB |
testcase_01 | AC | 3 ms
7,724 KB |
testcase_02 | AC | 3 ms
7,720 KB |
testcase_03 | AC | 3 ms
7,792 KB |
testcase_04 | AC | 3 ms
7,672 KB |
testcase_05 | AC | 8 ms
7,684 KB |
testcase_06 | AC | 4 ms
7,692 KB |
testcase_07 | AC | 3 ms
7,732 KB |
testcase_08 | AC | 85 ms
7,752 KB |
testcase_09 | AC | 4 ms
7,732 KB |
testcase_10 | AC | 717 ms
8,680 KB |
testcase_11 | AC | 178 ms
8,000 KB |
testcase_12 | AC | 25 ms
7,820 KB |
testcase_13 | AC | 4 ms
7,744 KB |
testcase_14 | AC | 3 ms
7,700 KB |
testcase_15 | AC | 4 ms
7,732 KB |
testcase_16 | AC | 735 ms
8,712 KB |
testcase_17 | AC | 3 ms
7,680 KB |
testcase_18 | AC | 6 ms
7,672 KB |
testcase_19 | AC | 3 ms
7,680 KB |
testcase_20 | AC | 3 ms
7,612 KB |
testcase_21 | AC | 4 ms
7,760 KB |
testcase_22 | AC | 5 ms
7,836 KB |
testcase_23 | AC | 3 ms
7,744 KB |
testcase_24 | AC | 345 ms
8,172 KB |
testcase_25 | AC | 372 ms
8,128 KB |
testcase_26 | AC | 5 ms
7,620 KB |
testcase_27 | AC | 23 ms
7,664 KB |
testcase_28 | AC | 13 ms
7,620 KB |
testcase_29 | AC | 4 ms
7,748 KB |
testcase_30 | AC | 697 ms
8,640 KB |
testcase_31 | AC | 8 ms
7,716 KB |
testcase_32 | AC | 84 ms
7,860 KB |
testcase_33 | AC | 341 ms
8,240 KB |
testcase_34 | AC | 364 ms
8,240 KB |
testcase_35 | AC | 700 ms
8,628 KB |
testcase_36 | AC | 8 ms
7,632 KB |
testcase_37 | AC | 91 ms
7,756 KB |
testcase_38 | AC | 742 ms
8,764 KB |
testcase_39 | AC | 46 ms
7,632 KB |
testcase_40 | AC | 13 ms
7,692 KB |
testcase_41 | AC | 46 ms
7,708 KB |
testcase_42 | AC | 6 ms
7,648 KB |
testcase_43 | AC | 88 ms
7,772 KB |
testcase_44 | AC | 723 ms
8,740 KB |
testcase_45 | AC | 3 ms
7,684 KB |
testcase_46 | AC | 3 ms
7,784 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 V = scanner.nextInt() let A = (0 ..< N).map { _ in scanner.nextInt() } var win = [Bool](repeating: false, count: 1 << N) for i in (0 ..< 1 << N).reversed() { let total = (0 ..< N).filter { (i >> $0) & 1 == 1 }.map { A[$0] }.reduce(0, +) for j in 0 ..< N where (i >> j) & 1 == 0 && total + A[j] <= V { if !win[i | 1 << j] { win[i] = true } } } if A.reduce(0, +) <= V { print("Draw") } else if win[0] { print("First") } else { print("Second") }