-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.go
More file actions
92 lines (76 loc) · 1.75 KB
/
main.go
File metadata and controls
92 lines (76 loc) · 1.75 KB
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
package main
import (
"bufio"
"fmt"
"io"
"os"
"path"
"strings"
)
func input() *os.File {
input, err := os.Open(path.Join("2020", "24", "input.txt"))
if err != nil {
panic(err)
}
return input
}
func traverse(path string) tile {
x, y := 0, 0
for i := 0; i < len(path); i++ {
switch path[i] {
case 'e':
x += 1
case 'w':
x -= 1
case 'n':
switch path[i+1] {
case 'w':
x += 1
y += 1
case 'e':
y += 1
default:
panic(path[i:])
}
case 's':
switch path[i+1] {
case 'w':
y -= 1
case 'e':
x -= 1
y -= 1
default:
panic(path[i:])
}
default:
panic(path[i:])
}
}
return tile{x: x, y: y}
}
type tile struct {
x, y int
}
func solve(r io.Reader) {
scanner := bufio.NewScanner(r)
numBlack := 0
tiles := make(map[tile]bool)
for scanner.Scan() {
row := scanner.Text()
tile := traverse(row)
tiles[tile] = !tiles[tile]
if tiles[tile] {
numBlack += 1
} else {
numBlack -= 1
}
}
if scanner.Err() != nil {
panic(scanner.Err())
}
fmt.Println(numBlack)
}
func main() {
solve(strings.NewReader("sesenwnenenewseeswwswswwnenewsewsw\nneeenesenwnwwswnenewnwwsewnenwseswesw\nseswneswswsenwwnwse\nnwnwneseeswswnenewneswwnewseswneseene\nswweswneswnenwsewnwneneseenw\neesenwseswswnenwswnwnwsewwnwsene\nsewnenenenesenwsewnenwwwse\nwenwwweseeeweswwwnwwe\nwsweesenenewnwwnwsenewsenwwsesesenwne\nneeswseenwwswnwswswnw\nnenwswwsewswnenenewsenwsenwnesesenew\nenewnwewneswsewnwswenweswnenwsenwsw\nsweneswneswneneenwnewenewwneswswnese\nswwesenesewenwneswnwwneseswwne\nenesenwswwswneneswsenwnewswseenwsese\nwnwnesenesenenwwnenwsewesewsesesew\nnenewswnwewswnenesenwnesewesw\neneswnwswnwsenenwnwnwwseeswneewsenese\nneswnwewnwnwseenwseesewsenwsweewe\nwseweeenwnesenwwwswnew"))
solve(input())
}