Day11

AdventOfCode2018.Tests/AdventOfCode2018.Tests.csproj

@@ -69,6 +69,7 @@
     <Compile Include="Day08_Tests.cs" />
     <Compile Include="Day09_Tests.cs" />
     <Compile Include="Day10_Tests.cs" />
+    <Compile Include="Day11_Tests.cs" />
     <Compile Include="GuardEvent_Tests.cs" />
     <Compile Include="MarbleGame_Tests.cs" />
     <Compile Include="Properties\AssemblyInfo.cs" />

AdventOfCode2018.Tests/Day11_Tests.cs

@@ -0,0 +1,77 @@
+using Microsoft.VisualStudio.TestTools.UnitTesting;
+
+namespace AdventOfCode2018.Tests
+{
+    [TestClass()]
+    public class Day11_Tests
+    {
+        [TestMethod()]
+        public void CalculatePowerLevelOfCell__Test1()
+        {
+            int powerLevel = Day11.CalculatePowerLevelOfCell(3, 5, 8);
+            Assert.AreEqual(4, powerLevel);
+        }
+
+        [TestMethod()]
+        public void CalculatePowerLevelOfRegion__Test1()
+        {
+            int powerLevel = Day11.CalculatePowerLevelOfRegion(33, 45, 3, 18);
+            Assert.AreEqual(29, powerLevel);
+        }
+
+        [TestMethod()]
+        public void CalculatePowerLevelOfRegion__Test2()
+        {
+            int powerLevel = Day11.CalculatePowerLevelOfRegion(21, 61, 3, 42);
+            Assert.AreEqual(30, powerLevel);
+        }
+
+        [TestMethod()]
+        public void CalculatePowerLevelOfRegion__Test1_WithSumationField()
+        {
+            int[,] summationFiled = Day11.GenerateSumationField(300, 300, 18);
+            int powerLevel = Day11.CalculatePowerLevelOfRegion(33, 45, 3, summationFiled);
+            Assert.AreEqual(29, powerLevel);
+        }
+
+        [TestMethod()]
+        public void CalculatePowerLevelOfRegion__Test2_WithSumationField()
+        {
+            int[,] summationFiled = Day11.GenerateSumationField(300, 300, 42);
+            int powerLevel = Day11.CalculatePowerLevelOfRegion(21, 61, 3, summationFiled);
+            Assert.AreEqual(30, powerLevel);
+        }
+
+        [TestMethod()]
+        public void SearchBestRegionOfOneSize__Test1()
+        {
+            Day11.SearchBestRegionOfOneSize(300, 300, 3, 18, out int x, out int y);
+            Assert.AreEqual(33, x);
+            Assert.AreEqual(45, y);
+        }
+
+        [TestMethod()]
+        public void SearchBestRegionOfOneSize__Test2()
+        {
+            Day11.SearchBestRegionOfOneSize(300, 300, 3, 42, out int x, out int y);
+            Assert.AreEqual(21, x);
+            Assert.AreEqual(61, y);
+        }
+
+        [TestMethod()]
+        public void ResolvePart2__Test1()
+        {
+            Day11 day = new Day11();
+            string result = day.ResolvePart2(new string[] { "18" });
+            Assert.AreEqual("90,269,16", result);
+        }
+
+        [TestMethod()]
+        public void ResolvePart2__Test2()
+        {
+            Day11 day = new Day11();
+            string result = day.ResolvePart2(new string[] { "42" });
+            Assert.AreEqual("232,251,12", result);
+        }
+    }
+}

AdventOfCode2018/AdventOfCode2018.csproj

@@ -53,6 +53,7 @@
     <Compile Include="Day08.cs" />
     <Compile Include="Day09.cs" />
     <Compile Include="Day10.cs" />
+    <Compile Include="Day11.cs" />
     <Compile Include="IDay.cs" />
     <Compile Include="Program.cs" />
     <Compile Include="Properties\AssemblyInfo.cs" />
@@ -85,6 +86,9 @@
     <Content Include="inputs\Day09.txt">
       <CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
     </Content>
+    <Content Include="inputs\Day11.txt">
+      <CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
+    </Content>
     <Content Include="inputs\Day10.txt">
       <CopyToOutputDirectory>PreserveNewest</CopyToOutputDirectory>
     </Content>

AdventOfCode2018/Day11.cs

@@ -0,0 +1,226 @@
+using System;
+
+namespace AdventOfCode2018
+{
+    /*
+ 
+    --- Day 11: Chronal Charge ---
+
+    You watch the Elves and their sleigh fade into the distance as they head toward the North Pole.
+
+    Actually, you're the one fading. The falling sensation returns.
+
+    The low fuel warning light is illuminated on your wrist-mounted device. Tapping it once causes it to project a hologram of the situation: a 300x300 grid of fuel cells and their current power levels, some negative. You're not sure what negative power means in the context of time travel, but it can't be good.
+
+    Each fuel cell has a coordinate ranging from 1 to 300 in both the X (horizontal) and Y (vertical) direction. In X,Y notation, the top-left cell is 1,1, and the top-right cell is 300,1.
+
+    The interface lets you select any 3x3 square of fuel cells. To increase your chances of getting to your destination, you decide to choose the 3x3 square with the largest total power.
+
+    The power level in a given fuel cell can be found through the following process:
+
+        Find the fuel cell's rack ID, which is its X coordinate plus 10.
+        Begin with a power level of the rack ID times the Y coordinate.
+        Increase the power level by the value of the grid serial number (your puzzle input).
+        Set the power level to itself multiplied by the rack ID.
+        Keep only the hundreds digit of the power level (so 12345 becomes 3; numbers with no hundreds digit become 0).
+        Subtract 5 from the power level.
+
+    For example, to find the power level of the fuel cell at 3,5 in a grid with serial number 8:
+
+        The rack ID is 3 + 10 = 13.
+        The power level starts at 13 * 5 = 65.
+        Adding the serial number produces 65 + 8 = 73.
+        Multiplying by the rack ID produces 73 * 13 = 949.
+        The hundreds digit of 949 is 9.
+        Subtracting 5 produces 9 - 5 = 4.
+
+    So, the power level of this fuel cell is 4.
+
+    Here are some more example power levels:
+
+        Fuel cell at  122,79, grid serial number 57: power level -5.
+        Fuel cell at 217,196, grid serial number 39: power level  0.
+        Fuel cell at 101,153, grid serial number 71: power level  4.
+
+    Your goal is to find the 3x3 square which has the largest total power. The square must be entirely within the 300x300 grid. Identify this square using the X,Y coordinate of its top-left fuel cell. For example:
+
+    For grid serial number 18, the largest total 3x3 square has a top-left corner of 33,45 (with a total power of 29); these fuel cells appear in the middle of this 5x5 region:
+
+    -2  -4   4   4   4
+    -4   4   4   4  -5
+     4   3   3   4  -4
+     1   1   2   4  -3
+    -1   0   2  -5  -2
+
+    For grid serial number 42, the largest 3x3 square's top-left is 21,61 (with a total power of 30); they are in the middle of this region:
+
+    -3   4   2   2   2
+    -4   4   3   3   4
+    -5   3   3   4  -4
+     4   3   3   4  -3
+     3   3   3  -5  -1
+
+    What is the X,Y coordinate of the top-left fuel cell of the 3x3 square with the largest total power?
+
+    --- Part Two ---
+
+    You discover a dial on the side of the device; it seems to let you select a square of any size, not just 3x3. Sizes from 1x1 to 300x300 are supported.
+
+    Realizing this, you now must find the square of any size with the largest total power. Identify this square by including its size as a third parameter after the top-left coordinate: a 9x9 square with a top-left corner of 3,5 is identified as 3,5,9.
+
+    For example:
+
+        For grid serial number 18, the largest total square (with a total power of 113) is 16x16 and has a top-left corner of 90,269, so its identifier is 90,269,16.
+        For grid serial number 42, the largest total square (with a total power of 119) is 12x12 and has a top-left corner of 232,251, so its identifier is 232,251,12.
+
+    What is the X,Y,size identifier of the square with the largest total power?
+    
+    */
+
+    public class Day11 : IDay
+    {
+        public string ResolvePart1(string[] inputs)
+        {
+            int serial = Convert.ToInt32(inputs[0]);
+            SearchBestRegionOfOneSize(300, 300, 3, serial, out int x, out int y);
+            return string.Format("{0},{1}", x, y);
+        }
+
+        public string ResolvePart2(string[] inputs)
+        {
+            int serial = Convert.ToInt32(inputs[0]);
+            SearchBestRegion(300, 300, serial, out int x, out int y, out int size);
+            return string.Format("{0},{1},{2}", x, y, size);
+        }
+
+        public static int CalculatePowerLevelOfCell(int x, int y, int serial)
+        {
+            int powerLevel = 0;
+            int rackID = x + 10;
+            powerLevel += rackID * y;
+            powerLevel += serial;
+            powerLevel = powerLevel * rackID;
+            powerLevel = (powerLevel / 100) % 10;
+            powerLevel -= 5;
+            return powerLevel;
+        }
+
+        public static int CalculatePowerLevelOfRegion(int x, int y, int size, int serial)
+        {
+            int powerLevel = 0;
+            for (int i = 0; i < size; i++)
+            {
+                for (int j = 0; j < size; j++)
+                {
+                    powerLevel += CalculatePowerLevelOfCell(x + i, y + j, serial);
+                }
+            }
+            return powerLevel;
+        }
+
+        public static void SearchBestRegionOfOneSize(int width, int height, int size, int serial, out int x, out int y)
+        {
+            int bestPowerLevel = int.MinValue;
+            int bestX = 0;
+            int bestY = 0;
+            for (int i = 0; i <= width - size; i++)
+            {
+                for (int j = 0; j <= height - size; j++)
+                {
+                    int powerLevel = CalculatePowerLevelOfRegion(i, j, size, serial);
+                    if (powerLevel > bestPowerLevel)
+                    {
+                        bestPowerLevel = powerLevel;
+                        bestX = i;
+                        bestY = j;
+                    }
+                }
+            }
+            x = bestX;
+            y = bestY;
+        }
+
+        public static int[,] GenerateSumationField(int width, int height, int serial)
+        {
+            int[,] field = new int[width, height];
+            for (int j = 0; j < height; j++)
+            {
+                for (int i = 0; i < width; i++)
+                {
+                    int powerLevel = CalculatePowerLevelOfCell(i, j, serial);
+                    field[i, j] = powerLevel;
+                }
+            }
+            int[,] summationFiled = new int[width, height];
+            for (int j = 0; j < height; j++)
+            {
+                for (int i = 0; i < width; i++)
+                {
+                    int sum = field[i, j];
+                    if (j > 0)
+                    {
+                        sum += summationFiled[i, j - 1];
+                    }
+                    if (i > 0)
+                    {
+                        sum += summationFiled[i - 1, j];
+                    }
+                    if (i > 0 && j > 0)
+                    {
+                        sum -= summationFiled[i - 1, j - 1];
+                    }
+                    summationFiled[i, j] = sum;
+                }
+            }
+            return summationFiled;
+        }
+
+        public static int CalculatePowerLevelOfRegion(int x, int y, int size, int[,] summationFiled)
+        {
+            int powerLevel = summationFiled[x + (size - 1), y + (size - 1)];
+            if (x > 0 && y > 0)
+            {
+                powerLevel += summationFiled[x - 1, y - 1];
+            }
+            if (x > 0)
+            {
+                powerLevel -= summationFiled[x - 1, y + (size - 1)];
+            }
+            if (y > 0)
+            {
+                powerLevel -= summationFiled[x + (size - 1), y - 1];
+            }
+            return powerLevel;
+        }
+
+        public static void SearchBestRegion(int width, int height, int serial, out int x, out int y, out int size)
+        {
+            int[,] summationFiled = GenerateSumationField(width, height, serial);
+            int bestPowerLevel = int.MinValue;
+            int bestX = 0;
+            int bestY = 0;
+            int bestSize = 0;
+            int maxSize = Math.Min(width, height);
+            for (int k = 1; k <= maxSize; k++)
+            {
+                for (int i = 0; i <= width - k; i++)
+                {
+                    for (int j = 0; j <= height - k; j++)
+                    {
+                        int powerLevel = CalculatePowerLevelOfRegion(i, j, k, summationFiled);
+                        if (powerLevel > bestPowerLevel)
+                        {
+                            bestPowerLevel = powerLevel;
+                            bestX = i;
+                            bestY = j;
+                            bestSize = k;
+                        }
+                    }
+                }
+            }
+            x = bestX;
+            y = bestY;
+            size = bestSize;
+        }
+    }
+}

AdventOfCode2018/Program.cs

@@ -7,7 +7,7 @@ namespace AdventOfCode2018
     {
         private static void Main(string[] args)
         {
-            int currentDayNumber = 10;
+            int currentDayNumber = 11;
             IDay currentDay = null;
 
             switch (currentDayNumber)
@@ -22,6 +22,7 @@ namespace AdventOfCode2018
                 case 8: currentDay = new Day08(); break;
                 case 9: currentDay = new Day09(); break;
                 case 10: currentDay = new Day10(); break;
+                case 11: currentDay = new Day11(); break;
             }
 
             string[] linesDay = File.ReadAllLines(string.Format("inputs/Day{0:00}.txt", currentDayNumber));

AdventOfCode2018/inputs/Day11.txt

@@ -0,0 +1 @@
+9221