feat(2020-16/angch): hack

Author: angch

2020-16/angch/main.go

@@ -0,0 +1,165 @@
+package main
+
+import (
+	"bufio"
+	"fmt"
+	"log"
+	"os"
+	"strconv"
+	"strings"
+)
+
+func do(fileName string) (ret1 int, ret2 int) {
+	file, err := os.Open(fileName)
+	if err != nil {
+		log.Fatal(err)
+	}
+	defer file.Close()
+	scanner := bufio.NewScanner(file)
+
+	rules := make(map[string]map[int]bool)
+
+	for scanner.Scan() {
+		l := scanner.Text()
+		_ = l
+
+		if l == "" {
+			break
+		}
+		r, a1, a2, b1, b2 := "", 0, 0, 0, 0
+
+		l1 := strings.Split(l, ":")
+		fmt.Sscanf(l1[1], "%d-%d or %d-%d", &a1, &a2, &b1, &b2)
+		r = l1[0]
+		// log.Println(r)
+		// log.Println(r, a1, a2, b1, b2)
+		rng := make(map[int]bool)
+		for i := a1; i <= a2; i++ {
+			rng[i] = true
+		}
+		for i := b1; i <= b2; i++ {
+			rng[i] = true
+		}
+		rules[r] = rng
+	}
+	mytick := []int{}
+	for scanner.Scan() {
+		l := scanner.Text()
+		_ = l
+
+		if l == "" {
+			break
+		}
+		f := strings.Split(l, ",")
+		if len(f) < 2 {
+			continue
+		}
+		for _, v := range f {
+			i, _ := strconv.Atoi(v)
+			mytick = append(mytick, i)
+		}
+	}
+	_ = mytick
+
+	// log.Println(rules)
+	invalidCount := 0
+	checkTick := make([][]int, 0)
+	for scanner.Scan() {
+		l := scanner.Text()
+		_ = l
+
+		if l == "" {
+			break
+		}
+		f := strings.Split(l, ",")
+		if len(f) < 2 {
+			continue
+		}
+		invalidtick := false
+		// a:
+		values := make([]int, 0)
+		for _, v := range f {
+			i, _ := strconv.Atoi(v)
+			// log.Println(i)
+
+			invalid := true
+			for _, rule := range rules {
+				if rule[i] {
+					invalid = false
+					break
+				}
+			}
+			if invalid {
+				// log.Println("invalid", i)
+				invalidCount += i
+				invalidtick = true
+			}
+			values = append(values, i)
+		}
+		if !invalidtick {
+			// log.Println("add")
+			checkTick = append(checkTick, values)
+		}
+	}
+	ret1 = invalidCount
+	// log.Println("mt", checkTick)
+
+	possibleFields := make(map[string]map[int]bool)
+	for k, rule := range rules {
+		field := 0
+		possibleFields[k] = make(map[int]bool)
+	f:
+		for ; field < len(mytick); field++ {
+			for _, tick := range checkTick {
+				if !rule[tick[field]] {
+					continue f
+				}
+			}
+			possibleFields[k][field] = true
+		}
+	}
+
+	// log.Println(possibleFields)
+	done := len(rules)
+
+	fieldMap := make(map[string]int)
+	for done > 0 {
+	a:
+		for k := range rules {
+			if len(possibleFields[k]) == 1 {
+				field := 0
+				for v := range possibleFields[k] {
+					field = v
+				}
+
+				// log.Println(k, field)
+				fieldMap[k] = field
+
+				for k2 := range possibleFields {
+					if k2 == k {
+						continue
+					}
+					delete(possibleFields[k2], field)
+				}
+				done--
+				delete(rules, k)
+				break a
+			}
+		}
+	}
+	// log.Println(fieldMap)
+	ret2 = 1
+	for k, v := range fieldMap {
+		if strings.Contains(k, "departure") {
+			// log.Println(v)
+			ret2 *= mytick[v]
+		}
+	}
+
+	return ret1, ret2
+}
+func main() {
+	// log.Println(do("test.txt"))
+	// log.Println(do("test2.txt"))
+	log.Println(do("input.txt"))
+}

2020-16/angch/test.txt

@@ -0,0 +1,12 @@
+class: 1-3 or 5-7
+row: 6-11 or 33-44
+seat: 13-40 or 45-50
+
+your ticket:
+7,1,14
+
+nearby tickets:
+7,3,47
+40,4,50
+55,2,20
+38,6,12

2020-16/angch/test2.txt

@@ -0,0 +1,11 @@
+class: 0-1 or 4-19
+row: 0-5 or 8-19
+seat: 0-13 or 16-19
+
+your ticket:
+11,12,13
+
+nearby tickets:
+3,9,18
+15,1,5
+5,14,9