projects/AdventOfCode
2
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

re-worked day 8, not working

Browse Source
This commit is contained in:
Rob Stoffelen 2022-12-08 15:45:21 +01:00
parent 38eeecd15a
commit 04949eb733
2 changed files with 70 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Advend Of Code Runner/Program.cs
View File

@ -11,7 +11,7 @@ string _demoData = @"30373
Answerable answerable = new Day08Part1();
byte[] dataArray = File.ReadAllBytes(answerable.DefaultInputFile);
dataArray = Encoding.UTF8.GetBytes(_demoData);
//dataArray = Encoding.UTF8.GetBytes(_demoData);
Console.WriteLine($"Max value: {answerable.GetAnswer(dataArray)}");
Console.ReadKey(true);

93
Advent Of Code Library/2022/Day 08/TreeChecker.cs
View File

@ -1,68 +1,113 @@
namespace AdventOfCodeLibrary._2022.Day_08
{
internal struct Tree
{
internal int X;
internal int Y;
internal char Height;
internal bool IsVisible;
internal Tree(int x, int y, char height)
{
X = x;
Y = y;
Height = height;
IsVisible = false;
}
}
internal class TreeChecker
{
private Tree[][] treeGrid;
private Tree[][] rotatedGrid;
internal int VisibleTrees(string[] treeArray)
{
treeGrid = new Tree[treeArray.Length][];
rotatedGrid = new Tree[treeArray[0].Length][];
for (int verticalIndex = 0; verticalIndex < treeArray.Length; verticalIndex++)
{
bool firstVertial = true;
for (int horizontalIndex = 0; horizontalIndex < treeArray[0].Length; horizontalIndex++)
{
if (firstVertial)
{
treeGrid[verticalIndex] = new Tree[treeArray[0].Length];
firstVertial = false;
}
if (verticalIndex == 0)
{
rotatedGrid[horizontalIndex] = new Tree[treeArray.Length];
}
Tree tree = new Tree(verticalIndex, horizontalIndex, treeArray[verticalIndex][horizontalIndex]);
//Console.WriteLine($"Adding Tree to [{verticalIndex}][{horizontalIndex}] and [{horizontalIndex}][{verticalIndex}]");
treeGrid[verticalIndex][horizontalIndex] = tree;
rotatedGrid[horizontalIndex][verticalIndex] = tree;
}
}
int visible = 0;
// start from the top
char[] currentHighest = treeArray[0].ToCharArray();
Tree[] currentHighest = treeGrid[0];
// from top to bottom
for (int treeIndex = 1; treeIndex < treeArray.Length - 2; treeIndex++)
{
visible += CheckVisibleTrees(ref currentHighest, treeArray[treeIndex].ToCharArray());
int tmp = CheckVisibleTrees(ref currentHighest, treeGrid[treeIndex]);
visible += tmp;
}
currentHighest = treeArray[^1].ToCharArray();
currentHighest = treeGrid[^1];
// from bottom to top
for (int treeIndex = treeArray.Length - 1; treeIndex > 1 ; treeIndex--)
{
visible += CheckVisibleTrees(ref currentHighest, treeArray[treeIndex].ToCharArray());
int tmp = CheckVisibleTrees(ref currentHighest, treeGrid[treeIndex]);
visible += tmp;
}
string[] rotatedTreeArray = new string[treeArray[0].Length];
// parse the array so we get array 90 rotated
for (int horizontalIndex = 0; horizontalIndex < treeArray[0].Length; horizontalIndex++)
{
for (int verticalIndex = 0; verticalIndex < treeArray.Length; verticalIndex++)
{
rotatedTreeArray[horizontalIndex] += treeArray[verticalIndex][horizontalIndex];
}
}
currentHighest = rotatedTreeArray[0].ToCharArray();
currentHighest = rotatedGrid[0];
// from top to bottom with the rotated array
for (int treeIndex = 1; treeIndex < rotatedTreeArray.Length - 1; treeIndex++)
for (int treeIndex = rotatedGrid.Length - 1; treeIndex > 1; treeIndex--)
{
visible += CheckVisibleTrees(ref currentHighest, rotatedTreeArray[treeIndex].ToCharArray());
int tmp = CheckVisibleTrees(ref currentHighest, rotatedGrid[treeIndex]);
visible += tmp;
}
currentHighest = rotatedTreeArray[^1].ToCharArray();
currentHighest = rotatedGrid[^1];
// from bottom to top with the rotated array
for (int treeIndex = rotatedTreeArray.Length - 1; treeIndex > 1; treeIndex--)
for (int treeIndex = rotatedGrid.Length - 1; treeIndex > 1; treeIndex--)
{
visible += CheckVisibleTrees(ref currentHighest, rotatedTreeArray[treeIndex].ToCharArray());
int tmp = CheckVisibleTrees(ref currentHighest, rotatedGrid[treeIndex]);
visible += tmp;
}
// add the outside trees
int edgeTrees = (2 * treeArray.Length) + (2 * (treeArray[0].Length - 2));
int edgeTrees = (2 * treeGrid.Length) + (2 * (treeGrid[0].Length - 2));
// return the result
return visible + edgeTrees;
}
private int CheckVisibleTrees(ref char[] currentHighest, char[] treeLineToCheck)
private int CheckVisibleTrees(ref Tree[] currentHighest, Tree[] treeLineToCheck)
{
int visible = 0;
for (int treeIndex = 1; treeIndex < treeLineToCheck.Length - 1; treeIndex++)
{
int diff = treeLineToCheck[treeIndex] - currentHighest[treeIndex];
if (diff > 0)
Tree toCheck = treeLineToCheck[treeIndex];
int diff = toCheck.Height - currentHighest[treeIndex].Height;
if (diff > 0 && !treeGrid[toCheck.X][toCheck.Y].IsVisible)
{
visible++;
treeGrid[toCheck.X][toCheck.Y].IsVisible = true;
currentHighest[treeIndex] = treeLineToCheck[treeIndex];
}
}