2020-12-12 11:15:24 +00:00
|
|
|
import dayutil;
|
|
|
|
|
|
|
|
enum Direction {
|
|
|
|
NORTH,
|
|
|
|
EAST,
|
|
|
|
SOUTH,
|
|
|
|
WEST,
|
|
|
|
LEFT,
|
|
|
|
RIGHT,
|
|
|
|
FORWARD
|
|
|
|
}
|
|
|
|
|
|
|
|
struct Move {
|
|
|
|
Direction direction;
|
|
|
|
int amount;
|
|
|
|
}
|
|
|
|
|
|
|
|
Variant run(int part, File input, bool bigboy, string[] args) {
|
|
|
|
auto parsedInput = parseInput(input.byLine);
|
|
|
|
return Variant(parts!int(part,
|
2020-12-13 10:39:50 +00:00
|
|
|
() => part1(parsedInput),
|
|
|
|
() => part2(parsedInput)));
|
2020-12-12 11:15:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
auto parseInput(Range)(Range range) if (isInputRange!Range && isSomeString!(ElementType!Range)) {
|
|
|
|
return range.map!((line) {
|
|
|
|
Move move;
|
|
|
|
|
|
|
|
switch(line[0]) {
|
|
|
|
case 'N':
|
|
|
|
move.direction = Direction.NORTH;
|
|
|
|
break;
|
|
|
|
case 'S':
|
|
|
|
move.direction = Direction.SOUTH;
|
|
|
|
break;
|
|
|
|
case 'E':
|
|
|
|
move.direction = Direction.EAST;
|
|
|
|
break;
|
|
|
|
case 'W':
|
|
|
|
move.direction = Direction.WEST;
|
|
|
|
break;
|
|
|
|
case 'L':
|
|
|
|
move.direction = Direction.LEFT;
|
|
|
|
break;
|
|
|
|
case 'R':
|
|
|
|
move.direction = Direction.RIGHT;
|
|
|
|
break;
|
|
|
|
case 'F':
|
|
|
|
move.direction = Direction.FORWARD;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
assert(false, "Parse error");
|
|
|
|
}
|
|
|
|
|
|
|
|
import std.conv;
|
|
|
|
move.amount = to!int(line[1..$]);
|
|
|
|
return move;
|
|
|
|
});
|
|
|
|
}
|
|
|
|
|
2020-12-13 10:39:50 +00:00
|
|
|
int betterModulus(int number, int divisor) pure {
|
|
|
|
int tmp = number % divisor;
|
|
|
|
if (tmp < 0) tmp += divisor;
|
|
|
|
return tmp;
|
|
|
|
}
|
|
|
|
|
2020-12-12 11:15:24 +00:00
|
|
|
int part1(Range)(Range range) if (isInputRange!Range && is(ElementType!Range == Move)) {
|
|
|
|
int x, y;
|
|
|
|
Direction direction = Direction.EAST;
|
|
|
|
|
|
|
|
void applyWithDirection(Direction direction, int amount) {
|
|
|
|
switch(direction) {
|
|
|
|
case Direction.NORTH:
|
|
|
|
y += amount;
|
|
|
|
break;
|
|
|
|
case Direction.SOUTH:
|
|
|
|
y -= amount;
|
|
|
|
break;
|
|
|
|
case Direction.WEST:
|
|
|
|
x += amount;
|
|
|
|
break;
|
|
|
|
case Direction.EAST:
|
|
|
|
x -= amount;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
import std.format;
|
|
|
|
assert(false, "Move called with wrong arguments (%s)".format(direction));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
foreach(move; range) {
|
2020-12-13 10:39:50 +00:00
|
|
|
//writefln("Facing %s (%d,%d)", direction, x, y);
|
2020-12-12 11:15:24 +00:00
|
|
|
final switch(move.direction) {
|
|
|
|
case Direction.NORTH:
|
|
|
|
case Direction.SOUTH:
|
|
|
|
case Direction.WEST:
|
|
|
|
case Direction.EAST:
|
|
|
|
applyWithDirection(move.direction, move.amount);
|
|
|
|
break;
|
|
|
|
case Direction.LEFT:
|
|
|
|
direction = cast(Direction) betterModulus((cast(int) direction - move.amount / 90), 4);
|
|
|
|
break;
|
|
|
|
case Direction.RIGHT:
|
|
|
|
direction = cast(Direction) betterModulus((cast(int) direction + move.amount / 90), 4);
|
|
|
|
break;
|
|
|
|
case Direction.FORWARD:
|
|
|
|
applyWithDirection(direction, move.amount);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
import std.math;
|
|
|
|
return abs(x) + abs(y);
|
|
|
|
}
|
2020-12-13 10:39:50 +00:00
|
|
|
int part2(Range)(Range range) if (isInputRange!Range && is(ElementType!Range == Move)) {
|
|
|
|
int waypointX = 10;
|
|
|
|
int waypointY = 1;
|
|
|
|
int x, y;
|
|
|
|
|
|
|
|
foreach(move; range) {
|
|
|
|
//writefln("Ship (%d,%d), waypoint (%d,%d)", x, y, waypointX, waypointY);
|
|
|
|
final switch(move.direction) {
|
|
|
|
case Direction.NORTH:
|
|
|
|
waypointY += move.amount;
|
|
|
|
break;
|
|
|
|
case Direction.SOUTH:
|
|
|
|
waypointY -= move.amount;
|
|
|
|
break;
|
|
|
|
case Direction.WEST:
|
|
|
|
waypointX -= move.amount;
|
|
|
|
break;
|
|
|
|
case Direction.EAST:
|
|
|
|
waypointX += move.amount;
|
|
|
|
break;
|
|
|
|
case Direction.LEFT:
|
|
|
|
int direction = betterModulus(move.amount / 90, 4);
|
|
|
|
switch(direction) {
|
|
|
|
case 0:
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
int tmp = waypointY;
|
|
|
|
waypointY = waypointX;
|
|
|
|
waypointX = -tmp;
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
waypointY = -waypointY;
|
|
|
|
waypointX = -waypointX;
|
|
|
|
break;
|
|
|
|
case 3:
|
|
|
|
int tmp = waypointY;
|
|
|
|
waypointY = -waypointX;
|
|
|
|
waypointX = tmp;
|
|
|
|
break;
|
|
|
|
default: assert("Modulus went out of bounds");
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Direction.RIGHT:
|
|
|
|
int direction = betterModulus(move.amount / 90, 4);
|
|
|
|
switch(direction) {
|
|
|
|
case 0:
|
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
int tmp = waypointY;
|
|
|
|
waypointY = -waypointX;
|
|
|
|
waypointX = tmp;
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
waypointY = -waypointY;
|
|
|
|
waypointX = -waypointX;
|
|
|
|
break;
|
|
|
|
case 3:
|
|
|
|
int tmp = waypointY;
|
|
|
|
waypointY = waypointX;
|
|
|
|
waypointX = -tmp;
|
|
|
|
break;
|
|
|
|
default: assert("Modulus went out of bounds");
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case Direction.FORWARD:
|
|
|
|
x += waypointX * move.amount;
|
|
|
|
y += waypointY * move.amount;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
import std.math;
|
|
|
|
return abs(x) + abs(y);
|
|
|
|
}
|
2020-12-12 11:15:24 +00:00
|
|
|
|
|
|
|
unittest {
|
|
|
|
string input = q"EOS
|
|
|
|
F10
|
|
|
|
N3
|
|
|
|
F7
|
|
|
|
R90
|
|
|
|
F11
|
|
|
|
EOS";
|
|
|
|
|
|
|
|
assert(parseInput(input.lineSplitter).part1() == 25);
|
2020-12-13 10:39:50 +00:00
|
|
|
assert(parseInput(input.lineSplitter).part2() == 286);
|
2020-12-12 11:15:24 +00:00
|
|
|
}
|