aoc 1+2

2019-12-02 14:27:20 +01:00
parent 4a43239aa1
commit d23c3f45be
61 changed files with 344 additions and 4 deletions
--- a/www/statics/aoc/2018/18_solution-1.linq
+++ b/www/statics/aoc/2018/18_solution-1.linq
@@ -0,0 +1,99 @@
+<Query Kind="Program" />
+
+enum Field { Empty, Tree, Lumber }
+
+Dictionary<char, Field> mapping = new Dictionary<char, Field>
+{
+	{'.', Field.Empty},
+	{'|', Field.Tree},
+	{'#', Field.Lumber},
+};
+
+int Width;
+int Height;
+Field[,] Map;
+
+void Main()
+{
+	Load(File.ReadAllLines(Path.Combine(Path.GetDirectoryName(Util.CurrentQueryPath), @"18_input.txt")));
+	//$"Initial state:".Dump();Dump();
+	
+	int i;
+	for (i = 0; i < 10; i++)
+	{
+		Tick();
+		//$"After {i+1} minutes:".Dump();Dump();
+	}
+
+	$"After {i} ticks there are {FullCount(Field.Tree)} trees and {FullCount(Field.Lumber)} lumbers, the score is {FullCount(Field.Tree) * FullCount(Field.Lumber)}".Dump();
+}
+
+void Dump()
+{
+	StringBuilder b = new StringBuilder();
+	for (int y = 0; y < Height; y++)
+	{
+		for (int x = 0; x < Width; x++)
+		{
+			if (Map[x, y] == Field.Empty) b.Append('.');
+			else if (Map[x, y] == Field.Tree) b.Append('|');
+			else if (Map[x, y] == Field.Lumber) b.Append('#');
+			else throw new Exception(".");
+		}
+		b.AppendLine();
+	}
+	b.ToString().Dump();
+	"".Dump();
+}
+
+void Load(string[] input)
+{
+	Width = input[0].Length;
+	Height = input.Length;
+	Map = new Field[Width, Height];
+	for (var x = 0; x < Width; x++) for (var y = 0; y < Height; y++) Map[x, y] = mapping[input[y][x]];
+}
+
+void Tick()
+{
+	var d = new Field[Width,Height];
+	for (var y = 0; y < Height; y++) for (var x = 0; x < Width; x++) Tick(ref Map, ref d, x, y);
+	Map=d;
+}
+
+void Tick(ref Field[,] src, ref Field[,] dst, int x, int y)
+{
+	if (src[x,y] == Field.Empty)
+	{
+		dst[x,y] = (Count(ref src, x, y, Field.Tree) >= 3) ? Field.Tree : Field.Empty;
+	}
+	else if (src[x, y] == Field.Tree)
+	{
+		dst[x, y] = (Count(ref src, x, y, Field.Lumber) >= 3) ? Field.Lumber : Field.Tree;
+	}
+	else if (src[x, y] == Field.Lumber)
+	{
+		dst[x, y] = (Count(ref src, x, y, Field.Lumber) >= 1 && Count(ref src, x, y, Field.Tree) >= 1) ? Field.Lumber : Field.Empty;
+	}
+}
+
+int Count(ref Field[,] fld, int x, int y, Field s)
+{
+	int c = 0;
+	if (x > 0       && y > 0        && fld[x - 1, y - 1] == s) c++; 
+	if (x > 0                       && fld[x - 1, y    ] == s) c++;
+	if (x > 0       && y < Height-1 && fld[x - 1, y + 1] == s) c++;
+	if (               y < Height-1 && fld[x    , y + 1] == s) c++;
+	if (x < Width-1 && y < Height-1 && fld[x + 1, y + 1] == s) c++;
+	if (x < Width-1                 && fld[x + 1, y    ] == s) c++;
+	if (x < Width-1 && y > 0        && fld[x + 1, y - 1] == s) c++;
+	if (               y > 0        && fld[x    , y - 1] == s) c++;
+	return c;
+}
+
+int FullCount(Field f)
+{
+	int c = 0;
+	for (var x = 0; x < Width; x++) for (var y = 0; y < Height; y++) if (Map[x,y]==f)c++;
+	return c;
+}