-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
127 lines (105 loc) · 1.82 KB
/
main.go
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
package main
import (
"fmt"
"slices"
"strings"
"github.com/devkvlt/aoc"
)
var grid []string
func reset() {
grid = aoc.Lines("input")
}
func transpose() {
tr := make([]string, len(grid[0]))
for i := 0; i < len(grid[0]); i++ {
s := make([]byte, len(grid))
for j := 0; j < len(grid); j++ {
s[j] = grid[j][i]
}
tr[i] = string(s)
}
grid = tr
}
func tiltLeft() {
for i, line := range grid {
parts := strings.Split(line, "#")
for j := 0; j < len(parts); j++ {
b := []byte(parts[j])
slices.SortFunc(b, func(a, b byte) int { return int(b) - int(a) })
parts[j] = string(b)
}
grid[i] = strings.Join(parts, "#")
}
}
func tiltRight() {
for i, line := range grid {
parts := strings.Split(line, "#")
for j := 0; j < len(parts); j++ {
b := []byte(parts[j])
slices.Sort(b)
parts[j] = string(b)
}
grid[i] = strings.Join(parts, "#")
}
}
func part1() {
reset()
transpose()
tiltLeft()
sum := 0
for _, line := range grid {
for i, ch := range line {
if ch == 'O' {
sum += len(line) - i
}
}
}
fmt.Println(sum)
}
func cycle() {
transpose()
tiltLeft()
transpose()
tiltLeft()
transpose()
tiltRight()
transpose()
tiltRight()
}
func key(lines []string) string {
return strings.Join(lines, "")
}
func part2() {
reset()
seen := map[string]bool{key(grid): true}
grids := [][]string{grid}
last := 0
for {
last++
cycle()
if seen[key(grid)] {
break
}
seen[key(grid)] = true
grids = append(grids, grid)
}
first := slices.IndexFunc(grids, func(s []string) bool {
return slices.Equal(s, grid)
})
i := (1000000000-first)%(last-first) + first
grid = grids[i]
transpose()
sum := 0
for _, line := range grid {
for i, ch := range line {
if ch == 'O' {
sum += len(line) - i
}
}
}
fmt.Println(sum)
}
func main() {
part1() // 113525
part2() // 101292
}