-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution_2018_09.swift
72 lines (55 loc) · 2.04 KB
/
Solution_2018_09.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
70
71
72
import Foundation
private class Node {
let value: Int
var prev: Node!
var next: Node!
init(value: Int, prev: Node? = nil, next: Node? = nil) {
self.value = value
self.prev = prev ?? self
self.next = next ?? self
}
func right(_ amount: Int) -> Node {
return (0..<amount).reduce(self, { acc, _ in acc.next })
}
func left(_ amount: Int) -> Node {
return (0..<amount).reduce(self, { acc, _ in acc.prev })
}
}
struct Solution_2018_09: Solution {
var input: Input
func run() {
let players = 418
let marbles = 70769
func solve(players: Int, marbles: Int) -> Int {
let root = Node(value: 0)
var currentPlayer = 0
var points = [Int](repeating: 0, count: players)
var currentMarble = root
for marble in 1...marbles {
if marble.isMultiple(of: 23) {
let marbleToRemove = currentMarble.left(7)
marbleToRemove.prev.next = marbleToRemove.next
marbleToRemove.next.prev = marbleToRemove.prev
points[currentPlayer] += (marble + marbleToRemove.value)
currentMarble = marbleToRemove.right(1)
} else {
let insertAfter = currentMarble.right(1)
let insertBefore = currentMarble.right(2)
let newMarble = Node(value: marble, prev: insertAfter, next: insertBefore)
insertAfter.next = newMarble
insertBefore.prev = newMarble
currentMarble = newMarble
}
currentPlayer = (currentPlayer + 1) % players
}
return points.max()!
}
let part1 = solve(players: players, marbles: marbles)
print(part1)
let part2 = solve(players: players, marbles: marbles * 100)
print(part2)
// ------- Test -------
assert(part1 == 402398, "WA")
assert(part2 == 3426843186, "WA")
}
}