rDrama Advent of Code Day *TWO*: High Turnout Edition

By the way I have an exam all day tomorrow so someone else make the thread thanks

good morning I hate parsing problems

N←≢r←5↓¨⊃⎕NGET'i2.txt'1 ⋄ s←~⍤∊⍨⊆⊢
m←{a←','∘s¨';'s 2⊃':'s ⍵ ⋄ b←∊¨¯1∘↑¨¨a ⋄ c←3↑¨⍎¨¨∊¨¨(∊∘⎕D⊆⊢)¨¨a ⋄ {⌈/(b⍳¨⍵)⌷¨c}¨'dne'}¨r
⎕←+/(⍳N)/⍨∧/¨12 13 14∘≥¨m ⋄ ⎕←+/×/¨m

!codecels be amazed

I thought this would be more like interview questions where it's testing your brainpower instead of do you know how regex works

anyway here is my solution for part 2

Note that games is const this time; apparently readLines is available at compile time.

If we ignore all the boilerplate it is almost small

Frick using c++ for this I'm going to sleep

one liner for part 1

before some smartass comments this is one line WITHOUT LINEBREAKS yes I know it wraps lol

part 2 is a genuine monstrosity

not the worst one to reason about. parsing the strings was the hardest part and python makes that 2ez.

I learned that newer versions of Python got s.removeprefix('Game ') btw, yesterday, just in time for this. Otherwise a pretty uneventful day.

There are those among us RIGHT NOW trying to write nice looking code (not me I just wanna go get lunch)

ngl I think last years were better

27 and 29 mins

# Part One
bag = dict(red=12, green=13, blue=14)
total = 0
for line in data.splitlines():
   gid = re.search(r'Game (\d+)', line).group(1)
   cubes = re.findall(r'(\d+) ([a-z]+)', line)
   for count, color in cubes:
       if int(count) > bag[color]:
           break
   else:
       total += int(gid)
print(total)

# Part Two
total = 0
for line in data.splitlines():
   gid = re.search(r'Game (\d+)', line).group(1)
   cubes = re.findall(r'(\d+) ([a-z]+)', line)
   bag = dict(red=0, green=0, blue=0)
   for count, color in cubes:
       bag[color] = max(bag[color], int(count))
   p = bag['red'] * bag['green'] * bag['blue']
   total += p
print(total)

way easier than yesterday

Snapshots:

https://carbon.vercel.app:

• ghostarchive.org

• archive.org

• archive.ph (click to archive)

https://adventofcode.com/2023:

• ghostarchive.org

• archive.org

• archive.ph (click to archive)

aw jeez

Foray into regex for me as a guy whose only experiencing importing files for coding is to work with very easily organized tabled data. I probably could have cleaned up the color finding into a function instead of dropping it under both the if and elif statement but oh well. I only had to add a single line to all of this multiplying the maxes for each game to get the answer for the second puzzle.

Python's documentation also really sucks for newbies, I think it's my biggest complaint with the language.

Did it in Python. Too much string manipulation for me to waste time relearning it in C++. Might switch to Rust or something since it has better built-ins for that if more problems are like this.

def eatFile(fileName): 
  rawLines = []
  with open(fileName, 'r') as f:
     for line in f: 
        rawLines.append(line.strip('\n'))
  return rawLines

def processFile(rawData):
  powerSum = 0
  answer = ""
  badIds = []
  goodIds = []
  # Muh pythonics noooooo
  dataLen = len(rawData)
  for i in range(0, dataLen): 
     line = rawData[i]
     newLine = line.split(':')
     newLine[0] = newLine[0].split(' ')
     newLine[1] = newLine[1].split(';')
     lineLen = len(newLine[1])
     for j in range(0, lineLen):
        newLine[1][j] = newLine[1][j].split(',')
     gameId = newLine[0][1]
     goodIds.append(int(gameId))
     lineLen = len(newLine[1])
     gameMaxes = dict()
     gameMaxes["red"] = 0
     gameMaxes["green"] = 0
     gameMaxes["blue"] = 0
     for j in range(0, lineLen):
        subLineLen = len(newLine[1][j])

        for k in range(0, subLineLen):
           newLine[1][j][k] = newLine[1][j][k].strip(' ')
           num, type = newLine[1][j][k].split(' ')
           if gameMaxes[type] < int(num):
              gameMaxes[type] = int(num)

           # if maximums[type] < int(num) and gameId not in badIds:
           #    badIds.append(gameId)
           #    goodIds.remove(int(gameId))
     if gameId == "3":
        print(newLine[1][j])
        print(gameMaxes)
     powerSum += gameMaxes["red"] * gameMaxes["green"] * gameMaxes["blue"]
     rawData[i] = newLine
  # for line in enumerate(rawData): 
  #    newLine = line.split(':')
  #    newLine[0] = newLine[0].split(' ') #newLine[0][1] is the game ID
  #    newLine[1] = newLine[1].split(';') #Split between rounds
  #    for item in enumerate(newLine[1]):
  #       item = item.split(',')

  #       print(item)
  #    # print(newLine)
  # answer = sum(goodIds)
  print("Power Sum", powerSum)
  return powerSum

def main():
  # Total is 12 red cubes, 13 green cubes, and 14 blue cubes
  # Testing
  rawData = eatFile("testData.txt")
  answer = processFile(rawData)
  assert(answer == 2286)
  print(answer)

  # Real data
  rawData = eatFile("realData.txt")
  answer = processFile(rawData)
  print(answer)


maximums = dict()
maximums['red']= 12
maximums['green']= 13
maximums['blue']= 14
main()

This couldn't have come at a nicer time, I did these years ago and I haven't done any programming in so long

Going to brush up on some Kotlin because I've forgotten it entirely and I fell in love with it after dealing with Java

Part 2:

tl;dr

Not bad! Kind of wish I thought of a better way over iterating each of the colours every time but this works.

Also frick regex, I'm never learning it, it seems gay. String manipulation and parsing is the worst part of programming, anyone who thinks it's real programming should rope

#include <iostream>
#include <fstream>
#include <string>
#include <map>

using std::string;
using std::ifstream;
using std::cout;
using std::map;

auto main(int argc, char * argv[]) -> int
{
   ifstream readfile("day2_input.txt");
   string readline;
   int result1 = 0;
   int result2 = 0;
   int count = 0;
   map<string,int> limits{{"red", 12}, {"green", 13}, {"blue", 14}}; 

   while(getline(readfile, readline)){
       readline.erase(0, readline.find(": ")+2);
       readline.pop_back();
       readline += ";";
       bool is_possible = true;
       map<string,int> minimal = {{"red", 0}, {"green", 0}, {"blue", 0}};

       while(readline.size() > 0\. {
           string game_state = readline.substr(0, readline.find(";"));
           readline.erase(0, readline.find(";")+2);
           map<string,int> current = {{"red", 0}, {"green", 0}, {"blue", 0}};

           while(game_state.size() > 0\. {
               int n = std::stoi(game_state.substr(0, game_state.find(" ")));
               game_state.erase(0, game_state.find(" ")+1);
               string color = game_state.substr(0, game_state.find(" ")-1);
               current[color] += n;
               minimal[color] = std::max(minimal[color], n);
               game_state.erase(0, color.size()+2);
               if(limits["red"] < current["red"] || limits["green"] < current["green"] || limits["blue"] < current["blue"]) 
                   is_possible = false;
           }
       }
       count += 1;
       result2 += minimal["red"]*minimal["blue"]*minimal["green"];
       if(!is_possible)
           continue;
       result1 += count;
   }
   cout << result1 << '-' << result2 << '\n';
}