-
Notifications
You must be signed in to change notification settings - Fork 0
/
8.js
158 lines (138 loc) · 2.62 KB
/
8.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
// Total duration: 16 min (rounded to the nearest minute)
// Started at: 00:27
// First star at: 00:35
// Second star at: 00:43
const solveProblem = (data) => {
// Parse data
const lines = data.split("\n").slice(0, -1);
const values = lines.map(line => line.split("").map(x => Number(x)))
// Part 1
const w = values.length;
const h = values[0].length;
const mask = values.map(line => line.map(v => 0))
let max;
// Left to right
for (let i = 0; i < h; i++) {
max = -1;
for (let j = 0; j < w; j++) {
if (values[i][j] > max) {
mask[i][j] = 1;
max = values[i][j];
} else {
continue;
}
}
}
// Right to left
for (let i = 0; i < h; i++) {
max = -1;
for (let j = w - 1; j >= 0; j--) {
if (values[i][j] > max) {
mask[i][j] = 1;
max = values[i][j];
} else {
continue;
}
}
}
// Top to bottom
for (let j = 0; j < w; j++) {
max = -1;
for (let i = 0; i < h; i++) {
if (values[i][j] > max) {
mask[i][j] = 1;
max = values[i][j];
} else {
continue;
}
}
}
// Bottom to top
for (let j = 0; j < w; j++) {
max = -1;
for (let i = h - 1; i >= 0; i--) {
if (values[i][j] > max) {
mask[i][j] = 1;
max = values[i][j];
} else {
continue;
}
}
}
let count = 0;
for (let j = 0; j < w; j++) {
for (let i = 0; i < h; i++) {
count += mask[i][j];
}
}
console.log(count)
console.log("");
// Part 2
const scores = values.map(line => line.map(v => -1))
const scoreAt = (i, j) => {
const height = values[i][j];
let a = 0;
for (let di = 1; di < w; di++) {
if (i + di >= w) {
break;
}
a++;
if (values[i + di][j] >= height) {
break;
}
}
let b = 0;
for (let di = -1; di > -w; di--) {
if (i + di < 0) {
break;
}
b++;
if (values[i + di][j] >= height) {
break;
}
}
let c = 0;
for (let dj = 1; dj < h; dj++) {
if (j + dj >= h) {
break;
}
c++;
if (values[i][j + dj] >= height) {
break;
}
}
let d = 0;
for (let dj = -1; dj > -h; dj--) {
if (j + dj < 0) {
break;
}
d++;
if (values[i][j + dj] >= height) {
break;
}
}
return a * b * c * d;
}
let bestScore = 0;
for (let i = 0; i < w; i++) {
for (let j = 0; j < h; j++) {
bestScore = Math.max(bestScore, scoreAt(i, j));
}
}
console.log(bestScore)
console.log("");
};
// Library code
const fs = require("fs");
const path = require('path');
const day = path.parse(__filename).name;
const files = [
`${day}-test`,
`${day}`,
];
files.forEach(file => {
fs.readFile(`./${file}.txt`, "utf8", (_, data) => {
console.log(`Data from file ${file}.txt`);
solveProblem(data);
});
});