this post was submitted on 05 Dec 2024
26 points (100.0% liked)

Advent Of Code

979 readers
22 users here now

An unofficial home for the advent of code community on programming.dev!

Advent of Code is an annual Advent calendar of small programming puzzles for a variety of skill sets and skill levels that can be solved in any programming language you like.

AoC 2024

Solution Threads

M T W T F S S
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

Rules/Guidelines

Relevant Communities

Relevant Links

Credits

Icon base by Lorc under CC BY 3.0 with modifications to add a gradient

console.log('Hello World')

founded 1 year ago
MODERATORS
Ategon
[email protected]
CameronDev
26
๐Ÿ–จ๏ธ - 2024 DAY 5 SOLUTIONS - ๐Ÿ–จ๏ธ (self.advent_of_code)
submitted 2 weeks ago by CameronDev to c/advent_of_code
57 comments fedilink hide all child comments
 

Day 5: Print Queue

Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://topaz.github.io/paste/ if you prefer sending it through a URL

FAQ

you are viewing a single comment's thread
view the rest of the comments
[โ€“] [email protected] 1 points 2 weeks ago (1 children)

Go

Using a map to store u|v relations. Part 2 sorting with a custom compare function worked very nicely

spoiler

func main() {
	file, _ := os.Open("input.txt")
	defer file.Close()
	scanner := bufio.NewScanner(file)

	mapPages := make(map[string][]string)
	rulesSection := true
	middleSumOk := 0
	middleSumNotOk := 0

	for scanner.Scan() {
		line := scanner.Text()
		if line == "" {
			rulesSection = false
			continue
		}

		if rulesSection {
			parts := strings.Split(line, "|")
			u, v := parts[0], parts[1]
			mapPages[u] = append(mapPages[u], v)
		} else {
			update := strings.Split(line, ",")
			isOk := true

			for i := 1; i < len(update); i++ {
				u, v := update[i-1], update[i]
				if !slices.Contains(mapPages[u], v) {
					isOk = false
					break
				}
			}

			middlePos := len(update) / 2
			if isOk {
				middlePage, _ := strconv.Atoi(update[middlePos])
				middleSumOk += middlePage
			} else {
				slices.SortFunc(update, func(u, v string) int {
					if slices.Contains(mapPages[u], v) {
						return -1
					} else if slices.Contains(mapPages[v], u) {
						return 1
					}
					return 0
				})
				middlePage, _ := strconv.Atoi(update[middlePos])
				middleSumNotOk += middlePage
			}
		}
	}

	fmt.Println("Part 1:", middleSumOk)
	fmt.Println("Part 2:", middleSumNotOk)
}

[โ€“] HeckGazer 1 points 2 weeks ago* (last edited 2 weeks ago)

Because you're just sorting integers and in a single pass, the a == b and a > b distinction doesn't actually matter here, so the cmp can very simply be is a|b in rules, no map needed.

Edit: I realise it would be a sidegrade for your case because of how you did P1, just thought it was an interesting insight, especially for those that did P1 by checking if the input was sorted using the same custom compare.

func solution(input string) (int, int) {
	// rules: ["a|b", ...]
	// updates: [[1, 2, 3, 4], ...]
	var rules, updates = parse(input)

	sortFunc := func(a int, b int) int {
		if slices.Contains(rules, strconv.Itoa(a)+"|"+strconv.Itoa(b)) {
			return -1
		}
		return 1
	}

	var sumOrdered = 0
	var sumUnordered = 0
	for _, update := range updates {
		if slices.IsSortedFunc(update, sortFunc) {
			sumOrdered += update[len(update)/2]
		} else {
			slices.SortStableFunc(update, sortFunc)
			sumUnordered += update[len(update)/2]
		}
	}
	return sumOrdered, sumUnordered
}