yanick/adventofcode
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

prettier

Browse Source
This commit is contained in:
Yanick Champoux 2021-12-13 11:03:28 -05:00
parent 1e65e39123
commit 360fc700b1
3 changed files with 69 additions and 70 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

72
2021/13/part1.mjs
View File

@ -2,69 +2,69 @@ import fs from "fs-extra";
import fp from "lodash/fp.js";
import _ from "lodash";
export const processInput = (input) => fs.readFile(input,'utf8').then(
content => {
let [ coords, instructions ] = content.split("\n\n");
export const processInput = (input) =>
fs.readFile(input, "utf8").then((content) => {
let [coords, instructions] = content.split("\n\n");
let grid = [];
for( const [y,x] of coords.split("\n").map(line => line.split(",").map( x => parseInt(x) )) ) {
if(!grid[x]) grid[x] = [];
for (const [y, x] of coords
.split("\n")
.map((line) => line.split(",").map((x) => parseInt(x)))) {
if (!grid[x]) grid[x] = [];
grid[x][y] = true;
}
grid = [...grid];
grid = grid.map( x => x? [...x]:[] );
grid = grid.map((x) => (x ? [...x] : []));
instructions = instructions.split("\n").filter(x=>x).map( line => line.match(/([xy])=(\d+)/) )
.map( ([_,direction,level]) => ([direction,parseInt(level)]) );
instructions = instructions
.split("\n")
.filter((x) => x)
.map((line) => line.match(/([xy])=(\d+)/))
.map(([_, direction, level]) => [direction, parseInt(level)]);
return {
grid,
instructions,
}
};
});
}
);
export function foldGrid(grid,direction,level) {
if(direction === 'x') {
for( const row of grid ) {
if(!row) continue;
export function foldGrid(grid, direction, level) {
if (direction === "x") {
for (const row of grid) {
if (!row) continue;
const folded = row.splice(level);
folded.forEach((v,i) => {
if(i===0) return;
if(!v) return;
row[level-i] = v;
})
folded.forEach((v, i) => {
if (i === 0) return;
if (!v) return;
row[level - i] = v;
});
}
return grid;
}
const folded = grid.splice(level);
folded.forEach((v,i) => {
if(i===0) return;
if(!v) return;
grid[level-i] =
_.range(_.max([grid[level-i].length,folded[i].length])).
map( j => grid[level-i][j] || folded[i][j] );
})
folded.forEach((v, i) => {
if (i === 0) return;
if (!v) return;
grid[level - i] = _.range(
_.max([grid[level - i].length, folded[i].length])
).map((j) => grid[level - i][j] || folded[i][j]);
});
return grid;
}
export function printGrid(grid) {
return grid.map( line =>
(line||[]).map( x => x ? '#':'.' ).join('')
).join("\n");
return grid
.map((line) => (line || []).map((x) => (x ? "#" : ".")).join(""))
.join("\n");
}
export function solution({grid, instructions}) {
foldGrid(grid,...instructions.shift());
export function solution({ grid, instructions }) {
foldGrid(grid, ...instructions.shift());
return _.sum(grid.flat());
}

9
2021/13/part2.mjs
View File

@ -2,13 +2,10 @@ import fs from "fs-extra";
import fp from "lodash/fp.js";
import _ from "lodash";
import * as p1 from './part1.mjs';
import * as p1 from "./part1.mjs";
export function solution({grid, instructions}) {
instructions.forEach(i =>p1.foldGrid(grid,...i));
export function solution({ grid, instructions }) {
instructions.forEach((i) => p1.foldGrid(grid, ...i));
return p1.printGrid(grid);
}

10
2021/13/test.mjs
View File

@ -6,8 +6,8 @@ import fs from "fs-extra";
import * as p1 from "./part1.mjs";
import * as p2 from "./part2.mjs";
const sample = p1.processInput('sample');
const input = p1.processInput('input');
const sample = p1.processInput("sample");
const input = p1.processInput("input");
tap.test("part1", async (t) => {
const x = await sample;
@ -18,11 +18,13 @@ tap.test("part1", async (t) => {
tap.test("part2", async (t) => {
// t.equal(p2.solution(await sample), 0);
t.equal(p2.solution(await input),
t.equal(
p2.solution(await input),
`.##..###..#..#...##.####.###...##...##..
#..#.#..#.#.#.....#.#....#..#.#..#.#..#.
#..#.###..##......#.###..###..#....#....
####.#..#.#.#.....#.#....#..#.#.##.#....
#..#.#..#.#.#..#..#.#....#..#.#..#.#..#.
#..#.###..#..#..##..#....###...###..##..`);
#..#.###..#..#..##..#....###...###..##..`
);
});