AdventOfCode/csharp/2021/Solvers/Day09.cs at main · CameronAavik/AdventOfCode · GitHub

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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
using AdventOfCode.CSharp.Common;
using System;
using System.Numerics;

namespace AdventOfCode.CSharp.Y2021.Solvers;

public class Day09 : ISolver
{
    public static void Solve(ReadOnlySpan<byte> input, Solution solution)
    {
        var width = input.IndexOf((byte)'\n');
        var height = input.Length / (width + 1);

        Span<int> rowBasins = stackalloc int[width];
        Span<int> basins = stackalloc int[4096]; // assume a max of 4096 basins
        var basinCount = 0;

        var cursor = 0;

        // first row
        var prevBasin = -1;
        for (var x = 0; x < width; x++)
        {
            var locationHeight = input[cursor++] - '0';
            if (locationHeight == 9)
            {
                rowBasins[x] = -1;
                prevBasin = -1;
                continue;
            }

            if (prevBasin == -1)
            {
                prevBasin = basinCount++;
                basins[prevBasin] = (1 << (locationHeight + 16)) | 1;
            }
            else
            {
                basins[prevBasin] = (1 << (locationHeight + 16)) | (basins[prevBasin] + 1);
            }

            rowBasins[x] = prevBasin;
        }

        cursor++; // skip newline

        for (var y = 1; y < height; y++)
        {
            prevBasin = -1;
            for (var x = 0; x < width; x++)
            {
                var locationHeight = input[cursor++] - '0';
                if (locationHeight == 9)
                {
                    rowBasins[x] = -1;
                    prevBasin = -1;
                    continue;
                }

                var prevRowBasin = rowBasins[x];

                if (prevBasin == -1)
                {
                    if (prevRowBasin == -1)
                    {
                        prevBasin = basinCount++;
                        basins[prevBasin] = (1 << (locationHeight + 16)) | 1;
                    }
                    else
                    {
                        int prevRowBasinCount;
                        while ((prevRowBasinCount = basins[prevRowBasin]) < 0)
                            prevRowBasin = -prevRowBasinCount;

                        basins[prevRowBasin] = (1 << (locationHeight + 16)) | (prevRowBasinCount + 1);
                        prevBasin = prevRowBasin;
                    }
                }
                else
                {
                    if (prevRowBasin == -1)
                    {
                        basins[prevBasin] = (1 << (locationHeight + 16)) | (basins[prevBasin] + 1);
                    }
                    else
                    {
                        // merge scenario
                        int prevRowBasinCount;
                        while ((prevRowBasinCount = basins[prevRowBasin]) < 0)
                            prevRowBasin = -prevRowBasinCount;

                        // if they are different, then merge the basins
                        if (prevRowBasin != prevBasin)
                        {
                            var prevBasinCount = basins[prevBasin];
                            var basinCombinedHeights = (prevBasinCount | prevRowBasinCount | (1 << (locationHeight + 16))) & 0x7FFF0000;
                            var basinCombinedCounts = (prevBasinCount + prevRowBasinCount + 1) & 0xFFFF;
                            basins[prevBasin] = basinCombinedHeights | basinCombinedCounts;
                            basins[prevRowBasin] = -prevBasin;
                        }
                        else
                        {
                            basins[prevBasin] = (1 << (locationHeight + 16)) | (prevRowBasinCount + 1);
                        }
                    }
                }

                rowBasins[x] = prevBasin;
            }

            cursor++;
        }

        var riskLevelSum = 0;
        var max1 = 0;
        var max2 = 0;
        var max3 = 0;
        for (var i = 0; i < basinCount; i++)
        {
            var basin = basins[i];
            if (basin > 0)
            {
                var basinLowestHeight = BitOperations.TrailingZeroCount(basin >> 16);
                riskLevelSum += basinLowestHeight + 1;

                var basinSize = basin & 0xFFFF;

                if (basinSize < max3)
                    continue;

                if (basinSize < max2)
                {
                    max3 = basinSize;
                    continue;
                }

                max3 = max2;

                if (basinSize < max1)
                {
                    max2 = basinSize;
                }
                else
                {
                    max2 = max1;
                    max1 = basinSize;
                }
            }
        }

        solution.SubmitPart1(riskLevelSum);
        solution.SubmitPart2(max1 * max2 * max3);
    }
}