-
Notifications
You must be signed in to change notification settings - Fork 0
/
twenty_three.rb
160 lines (121 loc) · 2.94 KB
/
twenty_three.rb
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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
# frozen_string_literal: true
# TwentyThree
class TwentyThree < Day
# Handy class to loop through the options
class RingDecorator < SimpleDelegator
def next_iteration
out = dup
push shift
out
end
end
def initialize
super
@elves = File.readlines('twenty_three.txt', chomp: true).each.with_index.flat_map do |line, y|
line.chars.each.with_index.map do |char, x|
[CoordinateDecorator.new([x, y]), :elf] if char == '#'
end.compact
end.to_h
end
def part_a
@directions = RingDecorator.new(%w[north south west east])
still_moving = true
@turns = 0
while still_moving
still_moving = do_move
@turns += 1
break if @turns >= 10
end
x_min = @elves.keys.map(&:x).min
x_max = @elves.keys.map(&:x).max
y_min = @elves.keys.map(&:y).min
y_max = @elves.keys.map(&:y).max
(x_max - x_min + 1) * (y_max - y_min + 1) - @elves.size
end
def part_b
still_moving = true
while still_moving
still_moving = do_move
@turns += 1
end
@turns
end
private
def do_move
props = propositions
@directions.next_iteration
return false if props.empty?
props.each do |key, value|
@elves.delete key
@elves[value] = :elf
end
true
end
def propositions
propositions = {}
@elves.each_key do |coordinate|
next if none_surrounding? coordinate, @elves
move coordinate, propositions
end
remove_duplicates(propositions)
end
def move(coordinate, propositions)
@directions.each do |direction|
next unless send("none_#{direction}?", coordinate, @elves)
propositions[coordinate] = coordinate.send(direction)
break
end
end
def remove_duplicates(hash)
value_counts = {}
hash.each do |_, value|
if value_counts[value].present?
value_counts[value] += 1
else
value_counts[value] = 1
end
end
value_counts = value_counts.each.reject { _1[1] > 1 }.to_h
hash.select { value_counts.key?(hash[_1]) }
end
def none_north?(coordinate, map)
[
coordinate.north.west,
coordinate.north,
coordinate.north.east
].none? { map.key? _1 }
end
def none_south?(coordinate, map)
[
coordinate.south.west,
coordinate.south,
coordinate.south.east
].none? { map.key? _1 }
end
def none_east?(coordinate, map)
[
coordinate.east.north,
coordinate.east,
coordinate.east.south
].none? { map.key? _1 }
end
def none_west?(coordinate, map)
[
coordinate.west.north,
coordinate.west,
coordinate.west.south
].none? { map.key? _1 }
end
def none_surrounding?(coordinate, map)
[
coordinate.north.west,
coordinate.north,
coordinate.north.east,
coordinate.west,
coordinate.east,
coordinate.south.west,
coordinate.south,
coordinate.south.east
].none? { map.key? _1 }
end
end