-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmain2.go
113 lines (96 loc) · 1.68 KB
/
main2.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
package main
import (
"fmt"
"strings"
)
func main() {
m := parse()
equivalent := findEquivalent(m, 1000000000)
for i := 0; i < equivalent; i++ {
m.Cycle()
}
fmt.Println(m.Load())
}
func findEquivalent(m Map, goal int) int {
m = m.Copy()
var start, end int
visited := map[string]int{}
for i := 1; i <= goal; i++ {
m.Cycle()
str := m.String()
if round, ok := visited[str]; ok {
start, end = round, i
break
}
visited[str] = i
}
return (goal-start)%(end-start) + start
}
func (m Map) String() string {
s := strings.Builder{}
for r := 0; r < len(m); r++ {
for c := 0; c < len(m[r]); c++ {
s.WriteByte(m[r][c])
}
}
return s.String()
}
func (m Map) Cycle() {
m.North()
m.West()
m.South()
m.East()
}
func (m Map) Copy() Map {
cp := make(Map, len(m))
for i := range m {
cp[i] = make([]byte, len(m[i]))
copy(cp[i], m[i])
}
return cp
}
func (m Map) South() {
for change := true; change; {
change = false
for r := len(m) - 2; r >= 0; r-- {
for c := 0; c < len(m[r]); c++ {
if m[r][c] == 'O' {
if m[r+1][c] == '.' {
m[r][c], m[r+1][c] = '.', 'O'
change = true
}
}
}
}
}
}
func (m Map) West() {
for change := true; change; {
change = false
for r := 0; r < len(m); r++ {
for c := 1; c < len(m[r]); c++ {
if m[r][c] == 'O' {
if m[r][c-1] == '.' {
m[r][c], m[r][c-1] = '.', 'O'
change = true
}
}
}
}
}
}
func (m Map) East() {
for change := true; change; {
change = false
for r := 0; r < len(m); r++ {
for c := len(m[r]) - 2; c >= 0; c-- {
if m[r][c] == 'O' {
if m[r][c+1] == '.' {
m[r][c], m[r][c+1] = '.', 'O'
change = true
}
}
}
}
}
}