expeditaet/solutions/typescript/2018/11/src/p1.ts

Advent of Code Solutions

import { task } from '@alexaegis/advent-of-code-lib';
import { Vec2 } from '@alexaegis/advent-of-code-lib/model';
import packageJson from '../package.json';
import { range } from './functions/range.generator.js';

export const rackDirections = [
	new Vec2(0, 0),
	new Vec2(0, 1),
	new Vec2(0, 2),
	new Vec2(1, 0),
	new Vec2(1, 1),
	new Vec2(1, 2),
	new Vec2(2, 0),
	new Vec2(2, 1),
	new Vec2(2, 2),
];

export const p1 = (input: string): string => {
	const serialNumber = Number.parseInt(input, 10);
	const map = new Map<string, number>();
	for (const vec of range({ from: 1, to: 300 }, { from: 1, to: 300 })) {
		const rackID = vec.x + 10;
		let powerLevel = rackID * vec.y;
		powerLevel += serialNumber;
		powerLevel *= rackID;
		powerLevel = Math.floor((powerLevel % 1000) / 100);
		powerLevel -= 5;
		map.set(vec.toString(), powerLevel);
	}

	const max = [...range({ from: 1, to: 298 }, { from: 1, to: 298 })].reduce(
		(acc, next) => {
			const sum = rackDirections
				.map((rd) => rd.clone().addMut(next))
				.map((c) => map.get(c.toString()) ?? 0)
				.reduce((a, n) => (a += n), 0);
			if (sum > acc.sum) {
				acc.vec = next;
				acc.sum = sum;
			}
			return acc;
		},
		{ vec: undefined as unknown as Vec2, sum: Number.NEGATIVE_INFINITY },
	);
	return `${max.vec.toString()} (${max.sum})`;
};

await task(p1, packageJson.aoc); // 21,37 (30) ~165ms