41 lines
1.4 KiB
Rust
41 lines
1.4 KiB
Rust
// Copyright 2022 Christian Ulrich
|
|
//
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
//
|
|
// usage: ./part1 < input
|
|
|
|
pub mod common;
|
|
|
|
use common::Forest;
|
|
|
|
fn main() -> Result<(), &'static str> {
|
|
let forest = Forest::from_stdin()?;
|
|
let (x_len, y_len) = forest.dimensions();
|
|
let mut result = 0;
|
|
for y in 0..y_len {
|
|
for x in 0..x_len {
|
|
let tree = forest.tree(x, y).unwrap();
|
|
let is_visible = forest.line(y).unwrap().take(x).all(|t| t < &tree)
|
|
|| forest.line(y).unwrap().skip(x + 1).all(|t| t < &tree)
|
|
|| forest.column(x).unwrap().take(y).all(|t| t < &tree)
|
|
|| forest.column(x).unwrap().skip(y + 1).all(|t| t < &tree);
|
|
if is_visible {
|
|
result += 1;
|
|
}
|
|
}
|
|
}
|
|
println!("{result}");
|
|
Ok(())
|
|
}
|