endernon/aoc-solutions
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Compare commits

base: endernon:6380a9a92808ec32e0a22e4720b755bd5302d9d0
Branches Tags
endernon:main
...
compare: endernon:65c3087c244ba13633c2b12bb1eabb1f8efcae9b
Branches Tags
endernon:main

2 commits
6380a9a928 ... 65c3087c24

Author SHA1 Message Date
endernon
65c3087c24 part 2 solution ez 2024-12-04 23:55:02 +00:00
endernon
33edb499c8 set the boundaries for width 2024-12-04 23:55:02 +00:00
4 changed files with 179 additions and 68 deletions
Show stats Expand all files Collapse all files

94
2024/day4/part1/src/main.rs
View file

@ -33,104 +33,62 @@ fn main() {
let leny = frfrvec.clone().len(); let leny = frfrvec.clone().len();
for y in 1..leny { for y in 1..leny {
let widthup = y >= 4; let widthup = y >= 2;
let widthdown = (leny - y) >= 4; let widthdown = (leny - y) >= 2;
for x in 1..lenx+1 { for x in 1..lenx+1 {
// check if enough space left and right // check if enough space left and right
let widthleft = x >= 4; let widthleft = x >= 2;
let widthright = (lenx - x) >= 3; let widthright = (lenx - x) >= 1;
// search algorithm starts here // search algorithm starts here
// check if the char is X // check if the char is X
if frfrvec[y][x] == 'X' { if frfrvec[y][x] == 'A' {
println!("x is {x}"); println!("x is {x}");
println!("y is {y}"); println!("y is {y}");
println!("width up: {}", widthup); println!("width up: {}", widthup);
println!("width down: {}", widthdown); println!("width down: {}", widthdown);
println!("width left: {}", widthleft); println!("width left: {}", widthleft);
// check if going upwards if widthup && widthleft && widthdown && widthright {
if widthup { // check if start from top
if frfrvec[y - 1][x] == 'M' if frfrvec[y - 1][x - 1] == 'M' // up left
&& frfrvec[y - 2][x] == 'A' && frfrvec[y - 1][x + 1] == 'M' // up right
&& frfrvec[y - 3][x] == 'S' && frfrvec[y + 1][x - 1] == 'S' // down left
&& frfrvec[y + 1][x + 1] == 'S' // down right
{ {
pointcounter += 1; pointcounter += 1;
println!("successful up"); println!("successful up");
} }
} // check if start from left
// check if going diag up left if frfrvec[y - 1][x - 1] == 'M' // up left
if widthup && widthleft { && frfrvec[y - 1][x + 1] == 'S' // up right
if frfrvec[y - 1][x - 1] == 'M' && frfrvec[y + 1][x - 1] == 'M' // down left
&& frfrvec[y - 2][x - 2] == 'A' && frfrvec[y + 1][x + 1] == 'S' // down right
&& frfrvec[y - 3][x - 3] == 'S'
{
pointcounter += 1;
println!("successful up left");
}
}
// check if going left
if widthleft {
if frfrvec[y][x - 1] == 'M'
&& frfrvec[y][x - 2] == 'A'
&& frfrvec[y][x - 3] == 'S'
{ {
pointcounter += 1; pointcounter += 1;
println!("successful left"); println!("successful left");
} }
} // check if start from bottom
// check if going diag down left if frfrvec[y - 1][x - 1] == 'S' // up left
if widthdown && widthleft { && frfrvec[y - 1][x + 1] == 'S' // up right
if frfrvec[y + 1][x - 1] == 'M' && frfrvec[y + 1][x - 1] == 'M' // down left
&& frfrvec[y + 2][x - 2] == 'A' && frfrvec[y + 1][x + 1] == 'M' // down right
&& frfrvec[y + 3][x - 3] == 'S'
{
pointcounter += 1;
println!("successful down left");
}
}
// check if going down
if widthdown {
if frfrvec[y + 1][x] == 'M'
&& frfrvec[y + 2][x] == 'A'
&& frfrvec[y + 3][x] == 'S'
{ {
pointcounter += 1; pointcounter += 1;
println!("successful down"); println!("successful down");
} }
} // check if start from right
// check if going diag down right if frfrvec[y - 1][x - 1] == 'S' // up left
if widthdown && widthright { && frfrvec[y - 1][x + 1] == 'M' // up right
if frfrvec[y + 1][x + 1] == 'M' && frfrvec[y + 1][x - 1] == 'S' // down left
&& frfrvec[y + 2][x + 2] == 'A' && frfrvec[y + 1][x + 1] == 'M' // down right
&& frfrvec[y + 3][x + 3] == 'S'
{
pointcounter += 1;
println!("successful down right");
}
}
// check if going right
if widthright {
if frfrvec[y][x + 1] == 'M'
&& frfrvec[y][x + 2] == 'A'
&& frfrvec[y][x + 3] == 'S'
{ {
pointcounter += 1; pointcounter += 1;
println!("successful right"); println!("successful right");
} }
} }
// check if going diag right up
if widthright && widthup {
if frfrvec[y - 1][x + 1] == 'M'
&& frfrvec[y - 2][x + 2] == 'A'
&& frfrvec[y - 3][x + 3] == 'S'
{
pointcounter += 1;
println!("successful up right");
}
}
} }
println!("\n") println!("\n")
} }

7
2024/day4/part2/Cargo.lock generated Normal file
View file

@ -0,0 +1,7 @@
# This file is automatically @generated by Cargo.
# It is not intended for manual editing.
version = 3
[[package]]
name = "part1"
version = "0.1.0"

6
2024/day4/part2/Cargo.toml Normal file
View file

@ -0,0 +1,6 @@
[package]
name = "part1"
version = "0.1.0"
edition = "2021"
[dependencies]

140
2024/day4/part2/src/main.rs Normal file
View file

@ -0,0 +1,140 @@
use std::fs::read_to_string;
fn main() {
let mut pointcounter = 0;
let lines: Vec<String> = read_to_string("input.txt")
.unwrap()
.lines()
.map(String::from)
.collect();
let mut frfrvec: Vec<Vec<char>> = Vec::new();
println!("ye the lines are {:?}", lines);
// make y coord offset by 1
let lenxold = lines[1].chars().count();
let mut lenvec: Vec<char> = Vec::new();
for i in 0..lenxold {
lenvec.push('0');
}
frfrvec.push(lenvec);
// main section where you push stuff
for ministr in lines.clone() {
let mut pushvec = Vec::new();
pushvec.push('0'); // make x coord offset by 1
for minichar in ministr.chars() {
pushvec.push(minichar);
}
frfrvec.push(pushvec);
}
println!("{:?}", frfrvec);
let lenx = lines[1].chars().count();
let leny = frfrvec.clone().len();
for y in 1..leny {
let widthup = y >= 4;
let widthdown = (leny - y) >= 4;
for x in 1..lenx+1 {
// check if enough space left and right
let widthleft = x >= 4;
let widthright = (lenx - x) >= 3;
// search algorithm starts here
// check if the char is X
if frfrvec[y][x] == 'X' {
println!("x is {x}");
println!("y is {y}");
println!("width up: {}", widthup);
println!("width down: {}", widthdown);
println!("width left: {}", widthleft);
// check if going upwards
if widthup {
if frfrvec[y - 1][x] == 'M'
&& frfrvec[y - 2][x] == 'A'
&& frfrvec[y - 3][x] == 'S'
{
pointcounter += 1;
println!("successful up");
}
}
// check if going diag up left
if widthup && widthleft {
if frfrvec[y - 1][x - 1] == 'M'
&& frfrvec[y - 2][x - 2] == 'A'
&& frfrvec[y - 3][x - 3] == 'S'
{
pointcounter += 1;
println!("successful up left");
}
}
// check if going left
if widthleft {
if frfrvec[y][x - 1] == 'M'
&& frfrvec[y][x - 2] == 'A'
&& frfrvec[y][x - 3] == 'S'
{
pointcounter += 1;
println!("successful left");
}
}
// check if going diag down left
if widthdown && widthleft {
if frfrvec[y + 1][x - 1] == 'M'
&& frfrvec[y + 2][x - 2] == 'A'
&& frfrvec[y + 3][x - 3] == 'S'
{
pointcounter += 1;
println!("successful down left");
}
}
// check if going down
if widthdown {
if frfrvec[y + 1][x] == 'M'
&& frfrvec[y + 2][x] == 'A'
&& frfrvec[y + 3][x] == 'S'
{
pointcounter += 1;
println!("successful down");
}
}
// check if going diag down right
if widthdown && widthright {
if frfrvec[y + 1][x + 1] == 'M'
&& frfrvec[y + 2][x + 2] == 'A'
&& frfrvec[y + 3][x + 3] == 'S'
{
pointcounter += 1;
println!("successful down right");
}
}
// check if going right
if widthright {
if frfrvec[y][x + 1] == 'M'
&& frfrvec[y][x + 2] == 'A'
&& frfrvec[y][x + 3] == 'S'
{
pointcounter += 1;
println!("successful right");
}
}
// check if going diag right up
if widthright && widthup {
if frfrvec[y - 1][x + 1] == 'M'
&& frfrvec[y - 2][x + 2] == 'A'
&& frfrvec[y - 3][x + 3] == 'S'
{
pointcounter += 1;
println!("successful up right");
}
}
}
println!("\n")
}
}
println!("{pointcounter}");
}