This repository has been archived by the owner on Dec 21, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday14-part2.rs
160 lines (131 loc) · 4.15 KB
/
day14-part2.rs
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
use std::io::stdin;
#[memoize::memoize]
fn tilt_north(map: Vec<Vec<char>>) -> Vec<Vec<char>> {
let mut map = map.clone();
for col in 0..map[0].len() {
let mut last_occupied_row: isize = -1;
for row in 0..map.len() {
match map[row][col] {
'#' => last_occupied_row = row as isize,
'O' => {
last_occupied_row += 1;
if last_occupied_row != row as isize {
map[last_occupied_row as usize][col] = 'O';
map[row][col] = '.';
}
}
_ => (),
}
}
}
map
}
#[memoize::memoize]
fn tilt_south(map: Vec<Vec<char>>) -> Vec<Vec<char>> {
let mut map = map.clone();
for col in (0..map[0].len()).rev() {
let mut last_occupied_row = map.len();
for row in (0..map.len()).rev() {
match map[row][col] {
'#' => last_occupied_row = row,
'O' => {
last_occupied_row -= 1;
if last_occupied_row != row {
map[last_occupied_row][col] = 'O';
map[row][col] = '.';
}
}
_ => (),
}
}
}
map
}
#[memoize::memoize]
fn tilt_west(map: Vec<Vec<char>>) -> Vec<Vec<char>> {
let mut map = map.clone();
for row in 0..map.len() {
let mut last_occupied_col: isize = -1;
for col in 0..map[row].len() {
match map[row][col] {
'#' => last_occupied_col = col as isize,
'O' => {
last_occupied_col += 1;
if last_occupied_col != col as isize {
map[row][last_occupied_col as usize] = 'O';
map[row][col] = '.';
}
}
_ => (),
}
}
}
map
}
#[memoize::memoize]
fn tilt_east(map: Vec<Vec<char>>) -> Vec<Vec<char>> {
let mut map = map.clone();
for row in (0..map.len()).rev() {
let mut last_occupied_col = map.len();
for col in (0..map[row].len()).rev() {
match map[row][col] {
'#' => last_occupied_col = col,
'O' => {
last_occupied_col -= 1;
if last_occupied_col != col {
map[row][last_occupied_col] = 'O';
map[row][col] = '.';
}
}
_ => (),
}
}
}
map
}
fn calc_load(map: &Vec<Vec<char>>) -> u64 {
let mut load: u64 = 0;
for row in 0..map.len() {
for col in 0..map[row].len() {
if map[row][col] == 'O' {
load += (map.len() - row) as u64;
}
}
}
load
}
fn tilt_cycle(map: Vec<Vec<char>>) -> Vec<Vec<char>> {
let map = tilt_north(map);
let map = tilt_west(map);
let map = tilt_south(map);
let map = tilt_east(map);
map
}
fn main() {
let mut map: Vec<Vec<char>> = stdin()
.lines()
.map(|l| l.unwrap().chars().collect())
.collect();
let mut maps_after_each_cycle: Vec<Vec<Vec<char>>> = vec![];
let mut cycles_to_repeat = 0;
let mut first_repeated_map = 0;
loop {
map = tilt_cycle(map);
if let Some(repeat) = maps_after_each_cycle.iter().position(|m| *m == map) {
println!("found repeat after {} eq {}", cycles_to_repeat, repeat);
cycles_to_repeat -= repeat;
first_repeated_map = repeat;
break;
} else {
maps_after_each_cycle.push(map.clone());
cycles_to_repeat += 1;
}
}
let repetitions = (1_000_000_000 - first_repeated_map) / cycles_to_repeat;
let remaining_cycles = 1_000_000_000 - repetitions * cycles_to_repeat - first_repeated_map;
let last_map = &maps_after_each_cycle[first_repeated_map + remaining_cycles - 1];
println!("repetitions = {repetitions}");
println!("remaining_cycles = {remaining_cycles}");
let load = calc_load(last_map);
println!("answer = {load}");
}