-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathd03.rb
More file actions
87 lines (65 loc) · 1.8 KB
/
d03.rb
File metadata and controls
87 lines (65 loc) · 1.8 KB
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
# frozen_string_literal: true
require_relative '../day'
class Day03 < Day
def part_one
diagnostics = parse_input(read_input)
zeros_ones = most_common_bits(diagnostics)
epsilon_rate, gama_rate = min_max_bin(zeros_ones)
(bit_arr_to_int(gama_rate) * bit_arr_to_int(epsilon_rate)).to_s
end
def part_two
diagnostics = parse_input(read_input)
funcs = %i[max min]
results = [-1, -1]
funcs.each_with_index do |func, i|
curr_bit = 0
res = diagnostics
while res.size != 1
res = f(res, func, curr_bit)
curr_bit += 1
end
results[i] = bit_arr_to_int(res[0])
end
results.reduce(&:*).to_s
end
private
def f(items, min_max, curr_bit)
zeros_ones = most_common_bits(items)
min_bin, max_bin = min_max_bin(zeros_ones)
arr = min_max == :min ? min_bin : max_bin
result = []
items.each do |item|
item[curr_bit] == arr[curr_bit] ? result << item : next
end
result
end
def min_max_bin(common_bits)
size = common_bits.size
max_bin = Array.new(size, -1)
min_bin = Array.new(size, -1)
common_bits.each_with_index do |zo, i|
max_bin[i] = 0 if zo[0] > zo[1]
max_bin[i] = 1 if zo[1] > zo[0]
max_bin[i] = 1 if zo[1] == zo[0]
min_bin[i] = max_bin[i].zero? ? 1 : 0
end
[min_bin, max_bin]
end
def most_common_bits(arr)
size = arr[0].size
zeros_ones = Array.new(size) { Array.new(2, 0) }
arr.each do |item|
item.each_with_index do |bit, i|
zeros_ones[i][0] += 1 if bit.zero?
zeros_ones[i][1] += 1 if bit == 1
end
end
zeros_ones
end
def parse_input(input)
input.lines(chomp: true).map(&:chars).map { |char| char.map(&:to_i) }
end
def bit_arr_to_int(arr)
arr.map(&:to_s).reduce(&:concat).to_i(2)
end
end