1
0

Added AOC 2022 day 02

This commit is contained in:
Mike Schwörer 2022-12-02 12:32:14 +01:00
parent a9737985e2
commit 8fa2813711
Signed by: Mikescher
GPG Key ID: D3C7172E0A70F8CF
5 changed files with 2707 additions and 0 deletions

View File

@ -0,0 +1,43 @@
--- Day 2: Rock Paper Scissors ---
The Elves begin to set up camp on the beach. To decide whose tent gets to be closest to the snack storage, a giant Rock Paper Scissors tournament is already in progress.
Rock Paper Scissors is a game between two players. Each game contains many rounds; in each round, the players each simultaneously choose one of Rock, Paper, or Scissors using a hand shape. Then, a winner for that round is selected: Rock defeats Scissors, Scissors defeats Paper, and Paper defeats Rock. If both players choose the same shape, the round instead ends in a draw.
Appreciative of your help yesterday, one Elf gives you an encrypted strategy guide (your puzzle input) that they say will be sure to help you win. "The first column is what your opponent is going to play: A for Rock, B for Paper, and C for Scissors. The second column--" Suddenly, the Elf is called away to help with someone's tent.
The second column, you reason, must be what you should play in response: X for Rock, Y for Paper, and Z for Scissors. Winning every time would be suspicious, so the responses must have been carefully chosen.
The winner of the whole tournament is the player with the highest score. Your total score is the sum of your scores for each round. The score for a single round is the score for the shape you selected (1 for Rock, 2 for Paper, and 3 for Scissors) plus the score for the outcome of the round (0 if you lost, 3 if the round was a draw, and 6 if you won).
Since you can't be sure if the Elf is trying to help you or trick you, you should calculate the score you would get if you were to follow the strategy guide.
For example, suppose you were given the following strategy guide:
A Y
B X
C Z
This strategy guide predicts and recommends the following:
In the first round, your opponent will choose Rock (A), and you should choose Paper (Y). This ends in a win for you with a score of 8 (2 because you chose Paper + 6 because you won).
In the second round, your opponent will choose Paper (B), and you should choose Rock (X). This ends in a loss for you with a score of 1 (1 + 0).
The third round is a draw with both players choosing Scissors, giving you a score of 3 + 3 = 6.
In this example, if you were to follow the strategy guide, you would get a total score of 15 (8 + 1 + 6).
What would your total score be if everything goes exactly according to your strategy guide?
--- Part Two ---
The Elf finishes helping with the tent and sneaks back over to you. "Anyway, the second column says how the round needs to end: X means you need to lose, Y means you need to end the round in a draw, and Z means you need to win. Good luck!"
The total score is still calculated in the same way, but now you need to figure out what shape to choose so the round ends as indicated. The example above now goes like this:
In the first round, your opponent will choose Rock (A), and you need the round to end in a draw (Y), so you also choose Rock. This gives you a score of 1 + 3 = 4.
In the second round, your opponent will choose Paper (B), and you choose Rock so you lose (X) with a score of 1 + 0 = 1.
In the third round, you will defeat your opponent's Scissors with Rock for a score of 1 + 6 = 7.
Now that you're correctly decrypting the ultra top secret strategy guide, you would get a total score of 12.
Following the Elf's instructions for the second column, what would your total score be if everything goes exactly according to your strategy guide?

File diff suppressed because it is too large Load Diff

View File

@ -0,0 +1,66 @@
import std/strutils
const ROCK = 0
const PAPE = 1
const SCIS = 2
proc get_rps_winner(m1: int, m2: int): int =
if m1 == ROCK and m2 == ROCK:
return 0
if m1 == ROCK and m2 == PAPE:
return 2
if m1 == ROCK and m2 == SCIS:
return 1
if m1 == PAPE and m2 == ROCK:
return 1
if m1 == PAPE and m2 == PAPE:
return 0
if m1 == PAPE and m2 == SCIS:
return 2
if m1 == SCIS and m2 == ROCK:
return 2
if m1 == SCIS and m2 == PAPE:
return 1
if m1 == SCIS and m2 == SCIS:
return 0
return -1
proc run02_1(): string =
const input = staticRead"../input/day02.txt"
var score = 0
for line in splitLines(input):
if line == "":
continue
let move_elve = int(line[0]) - int('A')
let move_me = int(line[2]) - int('X')
let delta1 = (move_me + 1)
var delta2 = 0
let winner = get_rps_winner(move_elve, move_me)
if winner == 0:
delta2 = 3 # draw
elif winner == 1:
delta2 = 0 # elve win
elif winner == 2:
delta2 = 6 # me win
# echo line , " -> " , move_elve, "|", move_me, " -> ", winner, " || ", score, " + ", delta1, " + ", delta2
score += delta1
score += delta2
return intToStr(score)
when not defined(js):
echo run02_1()
else:
proc js_run02_1(): cstring {.exportc.} =
return cstring(run02_1())

View File

@ -0,0 +1,97 @@
import std/strutils
const ROCK = 0
const PAPE = 1
const SCIS = 2
const WIN = 2
const LOS = 0
const DRW = 1
proc get_rps_winner(m1: int, m2: int): int =
if m1 == ROCK and m2 == ROCK:
return 0
if m1 == ROCK and m2 == PAPE:
return 2
if m1 == ROCK and m2 == SCIS:
return 1
if m1 == PAPE and m2 == ROCK:
return 1
if m1 == PAPE and m2 == PAPE:
return 0
if m1 == PAPE and m2 == SCIS:
return 2
if m1 == SCIS and m2 == ROCK:
return 2
if m1 == SCIS and m2 == PAPE:
return 1
if m1 == SCIS and m2 == SCIS:
return 0
return -1
proc get_move(m1: int, res: int): int =
if m1 == ROCK and res == WIN:
return PAPE
if m1 == ROCK and res == LOS:
return SCIS
if m1 == ROCK and res == DRW:
return ROCK
if m1 == PAPE and res == WIN:
return SCIS
if m1 == PAPE and res == LOS:
return ROCK
if m1 == PAPE and res == DRW:
return PAPE
if m1 == SCIS and res == WIN:
return ROCK
if m1 == SCIS and res == LOS:
return PAPE
if m1 == SCIS and res == DRW:
return SCIS
return -1
proc run02_2(): string =
const input = staticRead"../input/day02.txt"
var score = 0
for line in splitLines(input):
if line == "":
continue
let move_elve = int(line[0]) - int('A')
let res_should = int(line[2]) - int('X')
let move_me = get_move(move_elve, res_should)
let delta1 = (move_me + 1)
var delta2 = 0
let winner = get_rps_winner(move_elve, move_me)
if winner == 0:
delta2 = 3 # draw
elif winner == 1:
delta2 = 0 # elve win
elif winner == 2:
delta2 = 6 # me win
# echo line , " -> " , move_elve, "|", move_me, " -> ", winner, " || ", score, " + ", delta1, " + ", delta2
score += delta1
score += delta2
return intToStr(score)
when not defined(js):
echo run02_2()
else:
proc js_run02_2(): cstring {.exportc.} =
return cstring(run02_2())

View File

@ -108,5 +108,6 @@ return
'2022' => '2022' =>
[ [
['day' => 1, 'parts' => 2, 'title' => 'Calorie Counting', 'language' => 'nim', 'solutions' => ['66719', '198551'] ], ['day' => 1, 'parts' => 2, 'title' => 'Calorie Counting', 'language' => 'nim', 'solutions' => ['66719', '198551'] ],
['day' => 2, 'parts' => 2, 'title' => 'Rock Paper Scissors', 'language' => 'nim', 'solutions' => ['14297', '10498'] ],
] ]
]; ];