AdventOfCode VS advent-of-code

Code: main (445b314)

Edit: Made some of those improvements. Have a look at main. Want the original code? Check out commit c6ae21b

Code: main (de0beb6)

Code: main (5f0a9a8)

For part 1 my sneaky elves took a step north and then walked around the outside of the blizzard field. I trapped them in with additional walls \evil grin**

Python [762/731]

Python+Paper [1740/765]

Python+sympy [204/1353]

Python [213/499]

Version at time of posting: 492376c (since I've committed since then)

I just did simple BFS on the lava cubes for part 1. For part 2, I just did a BFS on the bounding cube. Total runtime - 500 micro seconds for both parts on my 8 years old laptop: https://github.com/SvetlinZarev/advent-of-code/blob/main/2022/aoc-day-18/src/lib.rs

My solution is pretty simple - top down DP. On each step we can do only one of two things: * open a valve and stay in current position * do not open a vale, but move to a different positions

🦀🦀🦀 RUST 🦀🦀🦀

You can see it in action here: https://github.com/SvetlinZarev/advent-of-code/blob/main/2022/aoc-day-04/src/lib.rs

Rust

Here are the results of my benchmarks, which you can also run

You can calculate the distances between the points found by each scanner. If two scanners report points with the same distance between them, then most probably they are adjacent. Runs in 4ms on my machine: https://github.com/SvetlinZarev/advent-of-code/tree/main/2021/aoc-day-19

You can copy the release profile from here https://github.com/SvetlinZarev/advent-of-code/blob/main/2021/aoc-day-25/Cargo.toml#L8 and copy that directory to enable compilation for the machine's cpu https://github.com/SvetlinZarev/advent-of-code/tree/main/2021/aoc-day-25/.cargo

I want to share my repo for whoever is interested. It contains Rust solutions for:

Mine (rust)runs for 50ms for both parts. I've used just a regular bruteforce approach, so nothing fancy. There are several things I did that reduced the execution time: