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

Advent Of Code

920 readers
1 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 2 years ago
MODERATORS
 

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
[–] TunaCowboy 1 points 1 month ago* (last edited 1 month ago)

python

solution

import re
import aoc

def setup():
    lines = aoc.get_lines(5)
    return ([list(map(int, re.findall(r'\d+', x)))
             for x in lines if re.search(r'\|', x)],
            [list(map(int, re.findall(r'\d+', x)))
             for x in lines if re.search(r',', x)], 0)

def one():
    rules, updates, acc = setup()
    for update in updates:
        v = 1
        for i, u in enumerate(update):
            r = [x[0] for x in rules if x[1] == u and x[0] in update]
            if not all(n in update[:i] for n in r):
                v = 0
                break
        if v:
            acc += update[len(update) // 2]
    print(acc)

def fix(update, rules):
    c = 1
    while c:
        c = 0
        for i, u in enumerate(update):
            r = [x[0] for x in rules if x[1] == u and x[0] in update]
            for p in r:
                pi = update.index(p)
                if pi > i:
                    update[i], update[pi] = update[pi], update[i]
                    c = 1
    return update[len(update) // 2]

def two():
    rules, updates, acc = setup()
    for update in updates:
        v = 1
        for i, u in enumerate(update):
            r = [x[0] for x in rules if x[1] == u and x[0] in update]
            if not all(n in update[:i] for n in r):
                v = 0
                break
        if not v:
            acc += fix(update, rules)
    print(acc)

one()
two()