Code cleanup
This commit is contained in:
@@ -1,208 +1,203 @@
|
||||
using System;
|
||||
using System.Collections.Generic;
|
||||
using System.Linq;
|
||||
using System.Text;
|
||||
using System.Threading.Tasks;
|
||||
|
||||
namespace AdventOfCode2018
|
||||
namespace AdventOfCode2018;
|
||||
/*
|
||||
--- Day 23: Experimental Emergency Teleportation ---
|
||||
|
||||
Using your torch to search the darkness of the rocky cavern, you finally locate the man's friend: a small reindeer.
|
||||
|
||||
You're not sure how it got so far in this cave. It looks sick - too sick to walk - and too heavy for you to carry all the way back. Sleighs won't be invented for another 1500 years, of course.
|
||||
|
||||
The only option is experimental emergency teleportation.
|
||||
|
||||
You hit the "experimental emergency teleportation" button on the device and push I accept the risk on no fewer than 18 different warning messages. Immediately, the device deploys hundreds of tiny nanobots which fly around the cavern, apparently assembling themselves into a very specific formation. The device lists the X,Y,Z position (pos) for each nanobot as well as its signal radius (r) on its tiny screen (your puzzle input).
|
||||
|
||||
Each nanobot can transmit signals to any integer coordinate which is a distance away from it less than or equal to its signal radius (as measured by Manhattan distance). Coordinates a distance away of less than or equal to a nanobot's signal radius are said to be in range of that nanobot.
|
||||
|
||||
Before you start the teleportation process, you should determine which nanobot is the strongest (that is, which has the largest signal radius) and then, for that nanobot, the total number of nanobots that are in range of it, including itself.
|
||||
|
||||
For example, given the following nanobots:
|
||||
|
||||
pos=<0,0,0>, r=4
|
||||
pos=<1,0,0>, r=1
|
||||
pos=<4,0,0>, r=3
|
||||
pos=<0,2,0>, r=1
|
||||
pos=<0,5,0>, r=3
|
||||
pos=<0,0,3>, r=1
|
||||
pos=<1,1,1>, r=1
|
||||
pos=<1,1,2>, r=1
|
||||
pos=<1,3,1>, r=1
|
||||
|
||||
The strongest nanobot is the first one (position 0,0,0) because its signal radius, 4 is the largest. Using that nanobot's location and signal radius, the following nanobots are in or out of range:
|
||||
|
||||
The nanobot at 0,0,0 is distance 0 away, and so it is in range.
|
||||
The nanobot at 1,0,0 is distance 1 away, and so it is in range.
|
||||
The nanobot at 4,0,0 is distance 4 away, and so it is in range.
|
||||
The nanobot at 0,2,0 is distance 2 away, and so it is in range.
|
||||
The nanobot at 0,5,0 is distance 5 away, and so it is not in range.
|
||||
The nanobot at 0,0,3 is distance 3 away, and so it is in range.
|
||||
The nanobot at 1,1,1 is distance 3 away, and so it is in range.
|
||||
The nanobot at 1,1,2 is distance 4 away, and so it is in range.
|
||||
The nanobot at 1,3,1 is distance 5 away, and so it is not in range.
|
||||
|
||||
In this example, in total, 7 nanobots are in range of the nanobot with the largest signal radius.
|
||||
|
||||
Find the nanobot with the largest signal radius. How many nanobots are in range of its signals?
|
||||
|
||||
--- Part Two ---
|
||||
|
||||
Now, you just need to figure out where to position yourself so that you're actually teleported when the nanobots activate.
|
||||
|
||||
To increase the probability of success, you need to find the coordinate which puts you in range of the largest number of nanobots. If there are multiple, choose one closest to your position (0,0,0, measured by manhattan distance).
|
||||
|
||||
For example, given the following nanobot formation:
|
||||
|
||||
pos=<10,12,12>, r=2
|
||||
pos=<12,14,12>, r=2
|
||||
pos=<16,12,12>, r=4
|
||||
pos=<14,14,14>, r=6
|
||||
pos=<50,50,50>, r=200
|
||||
pos=<10,10,10>, r=5
|
||||
|
||||
Many coordinates are in range of some of the nanobots in this formation. However, only the coordinate 12,12,12 is in range of the most nanobots: it is in range of the first five, but is not in range of the nanobot at 10,10,10. (All other coordinates are in range of fewer than five nanobots.) This coordinate's distance from 0,0,0 is 36.
|
||||
|
||||
Find the coordinates that are in range of the largest number of nanobots. What is the shortest manhattan distance between any of those points and 0,0,0?
|
||||
|
||||
*/
|
||||
|
||||
public class Day23 : IDay
|
||||
{
|
||||
/*
|
||||
--- Day 23: Experimental Emergency Teleportation ---
|
||||
|
||||
Using your torch to search the darkness of the rocky cavern, you finally locate the man's friend: a small reindeer.
|
||||
|
||||
You're not sure how it got so far in this cave. It looks sick - too sick to walk - and too heavy for you to carry all the way back. Sleighs won't be invented for another 1500 years, of course.
|
||||
|
||||
The only option is experimental emergency teleportation.
|
||||
|
||||
You hit the "experimental emergency teleportation" button on the device and push I accept the risk on no fewer than 18 different warning messages. Immediately, the device deploys hundreds of tiny nanobots which fly around the cavern, apparently assembling themselves into a very specific formation. The device lists the X,Y,Z position (pos) for each nanobot as well as its signal radius (r) on its tiny screen (your puzzle input).
|
||||
|
||||
Each nanobot can transmit signals to any integer coordinate which is a distance away from it less than or equal to its signal radius (as measured by Manhattan distance). Coordinates a distance away of less than or equal to a nanobot's signal radius are said to be in range of that nanobot.
|
||||
|
||||
Before you start the teleportation process, you should determine which nanobot is the strongest (that is, which has the largest signal radius) and then, for that nanobot, the total number of nanobots that are in range of it, including itself.
|
||||
|
||||
For example, given the following nanobots:
|
||||
|
||||
pos=<0,0,0>, r=4
|
||||
pos=<1,0,0>, r=1
|
||||
pos=<4,0,0>, r=3
|
||||
pos=<0,2,0>, r=1
|
||||
pos=<0,5,0>, r=3
|
||||
pos=<0,0,3>, r=1
|
||||
pos=<1,1,1>, r=1
|
||||
pos=<1,1,2>, r=1
|
||||
pos=<1,3,1>, r=1
|
||||
|
||||
The strongest nanobot is the first one (position 0,0,0) because its signal radius, 4 is the largest. Using that nanobot's location and signal radius, the following nanobots are in or out of range:
|
||||
|
||||
The nanobot at 0,0,0 is distance 0 away, and so it is in range.
|
||||
The nanobot at 1,0,0 is distance 1 away, and so it is in range.
|
||||
The nanobot at 4,0,0 is distance 4 away, and so it is in range.
|
||||
The nanobot at 0,2,0 is distance 2 away, and so it is in range.
|
||||
The nanobot at 0,5,0 is distance 5 away, and so it is not in range.
|
||||
The nanobot at 0,0,3 is distance 3 away, and so it is in range.
|
||||
The nanobot at 1,1,1 is distance 3 away, and so it is in range.
|
||||
The nanobot at 1,1,2 is distance 4 away, and so it is in range.
|
||||
The nanobot at 1,3,1 is distance 5 away, and so it is not in range.
|
||||
|
||||
In this example, in total, 7 nanobots are in range of the nanobot with the largest signal radius.
|
||||
|
||||
Find the nanobot with the largest signal radius. How many nanobots are in range of its signals?
|
||||
|
||||
--- Part Two ---
|
||||
|
||||
Now, you just need to figure out where to position yourself so that you're actually teleported when the nanobots activate.
|
||||
|
||||
To increase the probability of success, you need to find the coordinate which puts you in range of the largest number of nanobots. If there are multiple, choose one closest to your position (0,0,0, measured by manhattan distance).
|
||||
|
||||
For example, given the following nanobot formation:
|
||||
|
||||
pos=<10,12,12>, r=2
|
||||
pos=<12,14,12>, r=2
|
||||
pos=<16,12,12>, r=4
|
||||
pos=<14,14,14>, r=6
|
||||
pos=<50,50,50>, r=200
|
||||
pos=<10,10,10>, r=5
|
||||
|
||||
Many coordinates are in range of some of the nanobots in this formation. However, only the coordinate 12,12,12 is in range of the most nanobots: it is in range of the first five, but is not in range of the nanobot at 10,10,10. (All other coordinates are in range of fewer than five nanobots.) This coordinate's distance from 0,0,0 is 36.
|
||||
|
||||
Find the coordinates that are in range of the largest number of nanobots. What is the shortest manhattan distance between any of those points and 0,0,0?
|
||||
|
||||
*/
|
||||
|
||||
public class Day23 : IDay
|
||||
public string ResolvePart1(string[] inputs)
|
||||
{
|
||||
public string ResolvePart1(string[] inputs)
|
||||
List<NanoBot> nanoBots = NanoBot.ListFromStrings(inputs);
|
||||
NanoBot bestNanoBot = nanoBots.OrderBy(nanoBot => nanoBot.Range).LastOrDefault();
|
||||
int countInRange = nanoBots.Where(nanoBot => bestNanoBot.InRange(nanoBot)).Count();
|
||||
return countInRange.ToString();
|
||||
}
|
||||
|
||||
public string ResolvePart2(string[] inputs)
|
||||
{
|
||||
List<NanoBot> nanoBots = NanoBot.ListFromStrings(inputs);
|
||||
long maxX = long.MinValue;
|
||||
long maxY = long.MinValue;
|
||||
long maxZ = long.MinValue;
|
||||
long minX = long.MaxValue;
|
||||
long minY = long.MaxValue;
|
||||
long minZ = long.MaxValue;
|
||||
foreach(NanoBot nanoBot in nanoBots)
|
||||
{
|
||||
List<NanoBot> nanoBots = NanoBot.ListFromStrings(inputs);
|
||||
NanoBot bestNanoBot = nanoBots.OrderBy(nanoBot => nanoBot.Range).LastOrDefault();
|
||||
int countInRange = nanoBots.Where(nanoBot => bestNanoBot.InRange(nanoBot)).Count();
|
||||
return countInRange.ToString();
|
||||
if (nanoBot.X < minX) { minX = nanoBot.X; }
|
||||
if (nanoBot.X > maxX) { maxX = nanoBot.X; }
|
||||
if (nanoBot.Y < minY) { minY = nanoBot.Y; }
|
||||
if (nanoBot.Y > maxY) { maxY = nanoBot.Y; }
|
||||
if (nanoBot.Z < minZ) { minZ = nanoBot.Z; }
|
||||
if (nanoBot.Z > maxZ) { maxZ = nanoBot.Z; }
|
||||
}
|
||||
|
||||
public string ResolvePart2(string[] inputs)
|
||||
{
|
||||
List<NanoBot> nanoBots = NanoBot.ListFromStrings(inputs);
|
||||
long maxX = long.MinValue;
|
||||
long maxY = long.MinValue;
|
||||
long maxZ = long.MinValue;
|
||||
long minX = long.MaxValue;
|
||||
long minY = long.MaxValue;
|
||||
long minZ = long.MaxValue;
|
||||
foreach(NanoBot nanoBot in nanoBots)
|
||||
{
|
||||
if (nanoBot.X < minX) { minX = nanoBot.X; }
|
||||
if (nanoBot.X > maxX) { maxX = nanoBot.X; }
|
||||
if (nanoBot.Y < minY) { minY = nanoBot.Y; }
|
||||
if (nanoBot.Y > maxY) { maxY = nanoBot.Y; }
|
||||
if (nanoBot.Z < minZ) { minZ = nanoBot.Z; }
|
||||
if (nanoBot.Z > maxZ) { maxZ = nanoBot.Z; }
|
||||
}
|
||||
long sizeX = maxX - minX;
|
||||
long sizeY = maxY - minY;
|
||||
long sizeZ = maxZ - minZ;
|
||||
long scale = Math.Min(sizeX, Math.Min(sizeY, sizeZ));
|
||||
long sizeX = maxX - minX;
|
||||
long sizeY = maxY - minY;
|
||||
long sizeZ = maxZ - minZ;
|
||||
long scale = Math.Min(sizeX, Math.Min(sizeY, sizeZ));
|
||||
|
||||
do
|
||||
{
|
||||
scale /= 2;
|
||||
if (scale <= 0) { scale = 1; }
|
||||
do
|
||||
{
|
||||
scale /= 2;
|
||||
if (scale <= 0) { scale = 1; }
|
||||
|
||||
long bestX = 0;
|
||||
long bestY = 0;
|
||||
long bestZ = 0;
|
||||
long bestCount = 0;
|
||||
for (long k = minZ; k <= maxZ; k += scale)
|
||||
long bestX = 0;
|
||||
long bestY = 0;
|
||||
long bestZ = 0;
|
||||
long bestCount = 0;
|
||||
for (long k = minZ; k <= maxZ; k += scale)
|
||||
{
|
||||
for (long j = minY; j <= maxY; j += scale)
|
||||
{
|
||||
for (long j = minY; j <= maxY; j += scale)
|
||||
for (long i = minX; i <= maxX; i += scale)
|
||||
{
|
||||
for (long i = minX; i <= maxX; i += scale)
|
||||
int count = 0;
|
||||
foreach(NanoBot nanoBot in nanoBots)
|
||||
{
|
||||
int count = 0;
|
||||
foreach(NanoBot nanoBot in nanoBots)
|
||||
{
|
||||
if (nanoBot.InRange(i, j, k, scale)) { count++; }
|
||||
}
|
||||
if(count> bestCount)
|
||||
{
|
||||
bestX = i;
|
||||
bestY = j;
|
||||
bestZ = k;
|
||||
bestCount = count;
|
||||
}
|
||||
if (nanoBot.InRange(i, j, k, scale)) { count++; }
|
||||
}
|
||||
if(count> bestCount)
|
||||
{
|
||||
bestX = i;
|
||||
bestY = j;
|
||||
bestZ = k;
|
||||
bestCount = count;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
minX = bestX - scale;
|
||||
maxX = bestX + scale;
|
||||
minY = bestY - scale;
|
||||
maxY = bestY + scale;
|
||||
minZ = bestZ - scale;
|
||||
maxZ = bestZ + scale;
|
||||
minX = bestX - scale;
|
||||
maxX = bestX + scale;
|
||||
minY = bestY - scale;
|
||||
maxY = bestY + scale;
|
||||
minZ = bestZ - scale;
|
||||
maxZ = bestZ + scale;
|
||||
|
||||
if(scale == 1)
|
||||
{
|
||||
long distance = bestX + bestY + bestZ;
|
||||
return distance.ToString();
|
||||
}
|
||||
if(scale == 1)
|
||||
{
|
||||
long distance = bestX + bestY + bestZ;
|
||||
return distance.ToString();
|
||||
}
|
||||
|
||||
} while (true);
|
||||
} while (true);
|
||||
}
|
||||
|
||||
public class NanoBot
|
||||
{
|
||||
public long X { get; set; }
|
||||
public long Y { get; set; }
|
||||
public long Z { get; set; }
|
||||
public long Range { get; set; }
|
||||
|
||||
public static NanoBot FromString(string strInput)
|
||||
{
|
||||
string[] parts = strInput.Split(new[] { "pos=<", ",", ">, r=", }, StringSplitOptions.RemoveEmptyEntries);
|
||||
if (parts.Length != 4) { return null; }
|
||||
NanoBot nanoBot = new() {
|
||||
X = Convert.ToInt64(parts[0]),
|
||||
Y = Convert.ToInt64(parts[1]),
|
||||
Z = Convert.ToInt64(parts[2]),
|
||||
Range = Convert.ToInt64(parts[3]),
|
||||
};
|
||||
return nanoBot;
|
||||
}
|
||||
|
||||
public class NanoBot
|
||||
public static List<NanoBot> ListFromStrings(string[] inputs)
|
||||
{
|
||||
public long X { get; set; }
|
||||
public long Y { get; set; }
|
||||
public long Z { get; set; }
|
||||
public long Range { get; set; }
|
||||
List<NanoBot> nanoBots = inputs
|
||||
.Select(strInput => FromString(strInput))
|
||||
.Where(nanoBot => nanoBot != null)
|
||||
.ToList();
|
||||
return nanoBots;
|
||||
}
|
||||
|
||||
public static NanoBot FromString(string strInput)
|
||||
{
|
||||
string[] parts = strInput.Split(new string[] { "pos=<", ",", ">, r=", }, StringSplitOptions.RemoveEmptyEntries);
|
||||
if (parts.Length != 4) { return null; }
|
||||
NanoBot nanoBot = new NanoBot
|
||||
{
|
||||
X = Convert.ToInt64(parts[0]),
|
||||
Y = Convert.ToInt64(parts[1]),
|
||||
Z = Convert.ToInt64(parts[2]),
|
||||
Range = Convert.ToInt64(parts[3]),
|
||||
};
|
||||
return nanoBot;
|
||||
}
|
||||
public long ManhattanDistance(NanoBot other)
|
||||
{
|
||||
return ManhattanDistance(other.X, other.Y, other.Z);
|
||||
}
|
||||
|
||||
public static List<NanoBot> ListFromStrings(string[] inputs)
|
||||
{
|
||||
List<NanoBot> nanoBots = inputs
|
||||
.Select(strInput => FromString(strInput))
|
||||
.Where(nanoBot => nanoBot != null)
|
||||
.ToList();
|
||||
return nanoBots;
|
||||
}
|
||||
public long ManhattanDistance(long x, long y, long z)
|
||||
{
|
||||
long distance = Math.Abs(X - x) + Math.Abs(Y - y) + Math.Abs(Z - z);
|
||||
return distance;
|
||||
}
|
||||
|
||||
public long ManhattanDistance(NanoBot other)
|
||||
{
|
||||
return ManhattanDistance(other.X, other.Y, other.Z);
|
||||
}
|
||||
public bool InRange(NanoBot other)
|
||||
{
|
||||
long distance = ManhattanDistance(other);
|
||||
return distance <= Range;
|
||||
}
|
||||
|
||||
public long ManhattanDistance(long x, long y, long z)
|
||||
{
|
||||
long distance = Math.Abs(X - x) + Math.Abs(Y - y) + Math.Abs(Z - z);
|
||||
return distance;
|
||||
}
|
||||
|
||||
public bool InRange(NanoBot other)
|
||||
{
|
||||
long distance = ManhattanDistance(other);
|
||||
return distance <= Range;
|
||||
}
|
||||
|
||||
public bool InRange(long x, long y, long z, long scale)
|
||||
{
|
||||
long distance = (long)Math.Ceiling(ManhattanDistance(x, y, z) / (double)scale);
|
||||
long range = (long)Math.Ceiling(Range / (double)scale);
|
||||
return distance <= range;
|
||||
}
|
||||
public bool InRange(long x, long y, long z, long scale)
|
||||
{
|
||||
long distance = (long)Math.Ceiling(ManhattanDistance(x, y, z) / (double)scale);
|
||||
long range = (long)Math.Ceiling(Range / (double)scale);
|
||||
return distance <= range;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user