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
|
use std::{collections::HashMap, io};
enum Cell {
Empty,
Obstacle,
}
#[derive(Clone)]
enum Direction {
L = 0b1,
R = 0b10,
U = 0b100,
D = 0b1000,
}
impl Direction {
fn shift(&self, point: (isize, isize)) -> (isize, isize) {
let (x, y) = point;
match self {
Direction::L => (x - 1, y),
Direction::R => (x + 1, y),
Direction::U => (x, y - 1),
Direction::D => (x, y + 1),
}
}
fn rotate(&self) -> Self {
use Direction::*;
match self {
L => U,
R => D,
U => R,
D => L,
}
}
}
fn main() -> io::Result<()> {
let mut map = HashMap::new();
let mut pos = None;
io::stdin()
.lines()
.flatten()
.enumerate()
.flat_map(|(y, line)| {
line.chars()
.enumerate()
.map(|(x, ch)| ([x as isize, y as isize], ch))
.collect::<Vec<_>>()
})
.for_each(|([x, y], ch)| match ch {
'.' => {
map.insert((x, y), Cell::Empty);
}
'^' => {
map.insert((x, y), Cell::Empty);
pos = Some((x, y))
}
'#' => {
map.insert((x, y), Cell::Obstacle);
}
_ => panic!(),
});
let mut visited = HashMap::new();
let mut pos = pos.unwrap();
let mut dir = Direction::U;
loop {
*visited.entry(pos).or_insert(0 as u8) |= dir.clone() as u8;
let ahead = dir.shift(pos);
match map.get(&ahead) {
Some(Cell::Empty) => pos = ahead,
Some(Cell::Obstacle) => dir = dir.rotate(),
None => break,
};
}
let silver: usize = visited.len();
let gold: usize = 0;
println!("silver: {silver}");
println!("gold: {gold}");
return Ok(());
}
|
