-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay06.swift
69 lines (47 loc) · 1.29 KB
/
Day06.swift
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
import Foundation
import Tools
final class Day06Solver: DaySolver {
let dayNumber: Int = 6
struct Input {
let banks: [Int]
}
func solvePart1(withInput input: Input) -> Int {
var banks = input.banks
var previousBanks: Set<[Int]> = [banks]
while true {
let maxIndex = banks.firstIndex(of: banks.max()!)!
let blocks = banks[maxIndex]
banks[maxIndex] = 0
for bankIndex in maxIndex + 1 ... maxIndex + blocks {
banks[bankIndex % banks.count] += 1
}
if previousBanks.contains(banks) {
break
}
previousBanks.insert(banks)
}
return previousBanks.count
}
func solvePart2(withInput input: Input) -> Int {
var banks = input.banks
var previousBanks: [[Int]: Int] = [:]
var stepCounter = 0
while true {
let maxIndex = banks.firstIndex(of: banks.max()!)!
let blocks = banks[maxIndex]
banks[maxIndex] = 0
for bankIndex in maxIndex + 1 ... maxIndex + blocks {
banks[bankIndex % banks.count] += 1
}
stepCounter += 1
if previousBanks.keys.contains(banks) {
return stepCounter - previousBanks[banks]!
}
previousBanks[banks] = stepCounter
}
return previousBanks.count
}
func parseInput(rawString: String) -> Input {
return .init(banks: rawString.allLines().first!.components(separatedBy: "\t").map { Int($0)! })
}
}