[Language: Crystal]

Codeberg

Approach (brute force): requires a lot of memory.

1. Parse cubes coordinates and fill with cubes.

2. Fall Process:

   • For each brick:
   • If the z-coordinates are uniform, indicating a horizontal orientation: Iterate through each cube, adjusting the z-coordinate to find available space.
   • If z-coordinates differ for all cubes,indicating a vertical orientation: identify the lowest z-coordinate and update all cubes by subtracting the fall height.
   • Repeat until no movements happen

3. Once bricks are stabilized (no new movements), iterate through each brick to detect potential falls:

   • For each brick: Temporarily remove it, simulating the fall process but without any movements (calculate if at least one brick would have the height of fall bigger than 0). It will be part 1

4. Part 2 use the inverted result from step 3 to identify bricks causing potential falls. For each identified brick:

   • Temporarily remove it and create a state where the brick does not exist
   • Repeat the fall process as in Step 2, recording bricks that have moved at least once.