advent-of-code/grids.go
xuu 1a3374a557
Some checks failed
Go Bump / bump (push) Successful in 7s
Go Test / build (push) Failing after 10m26s
chore: save day18 (#12)
Reviewed-on: #12
2023-12-27 14:07:32 -07:00

52 lines
1.0 KiB
Go

package aoc
type Vector struct {
Offset Point
Scale int
}
func (v Vector) Point() Point {
return v.Offset.Scale(v.Scale)
}
type Point [2]int
func (p Point) Add(a Point) Point {
return Point{p[0] + a[0], p[1] + a[1]}
}
func (p Point) Scale(m int) Point {
return Point{p[0] * m, p[1] * m}
}
func Transpose[T any](matrix [][]T) [][]T {
rows, cols := len(matrix), len(matrix[0])
m := make([][]T, cols)
for i := range m {
m[i] = make([]T, rows)
}
for i := 0; i < cols; i++ {
for j := 0; j < rows; j++ {
m[i][j] = matrix[j][i]
}
}
return m
}
// NumPoints the number of the points inside an outline plus the number of points in the outline
func NumPoints(outline []Point, borderLength int) int {
// shoelace - find the float area in a shape
sum := 0
for _, p := range Pairwise(outline) {
row1, col1 := p[0][0], p[0][1]
row2, col2 := p[1][0], p[1][1]
sum += row1*col2 - row2*col1
}
area := sum / 2
// pick's theorem - find the number of points in a shape given its area
return (ABS(area) - borderLength/2 + 1) + borderLength
}