finished day 2

This commit is contained in:
2022-12-03 19:44:47 +01:00
parent 8186283cf6
commit 9aede0e28b
7 changed files with 2625 additions and 33 deletions

1
.idea/modules.xml generated
View File

@@ -5,6 +5,7 @@
<module fileurl="file://$PROJECT_DIR$/.idea/advent_of_code_2022.iml" filepath="$PROJECT_DIR$/.idea/advent_of_code_2022.iml" />
<module fileurl="file://$PROJECT_DIR$/day_1/day_1.iml" filepath="$PROJECT_DIR$/day_1/day_1.iml" />
<module fileurl="file://$PROJECT_DIR$/day_2/day_2.iml" filepath="$PROJECT_DIR$/day_2/day_2.iml" />
<module fileurl="file://$PROJECT_DIR$/day_2_part_2/day_2_part_2.iml" filepath="$PROJECT_DIR$/day_2_part_2/day_2_part_2.iml" />
</modules>
</component>
</project>

View File

@@ -40,7 +40,7 @@ At some point i wanted to define the map as a global variable and stumbled upon
```rust
use std::collections::HashMap;
pub const Countries: HashMap<&str, &str> = [
pub const COUNTRIES: HashMap<&str, &str> = [
("UK", "United Kingdom"),
("US", "United States")
].iter().cloned().collect();
@@ -81,3 +81,8 @@ error: cannot determine resolution for the macro `phf_map`
= note: import resolution is stuck, try simplifying macro imports
```
--update
all of that did not work... going to try to figure something out. i really didn't wanna initialise the maps on start.
--update 2
we're skipping global, first answer [here](https://stackoverflow.com/a/27826181) says avoid global as much as possible followed by 19 paragraphs of explanation so i'm guessing this guy knows his stuff. Gonna initialise some map and pass it's ref to the functions needed

View File

@@ -4,11 +4,11 @@ use std::io::{BufRead, BufReader};
use std::iter::Iterator;
pub const scores:HashMap<&str, u32> = HashMap::from([
("A",1), //rock
("B",2), //paper
("C",3) //scizzors
]);
// pub const scores: HashMap<&str, u8> = HashMap::from([
// ("A",1), //rock
// ("B",2), //paper
// ("C",3) //scizzors
// ]);
// figuring out a way to do this :/
// 1 2 = lose
@@ -17,55 +17,80 @@ pub const scores:HashMap<&str, u32> = HashMap::from([
// 2 3 = lose
// 3 1 = lose
// 3 2 = win
//
// static possibilities: HashMap<i32,i32> = HashMap::from([
// (12,0),
// (13,6),
// (21,6),
// (23,0),
// (31,0),
// (32,6),
// (11,3),
// (22,3),
// (33,3)
// ]);
static possibilities: HashMap<u32,u32> = HashMap::from([
(12,0),
(13,6),
(21,6),
(23,0),
(31,0),
(32,6),
(11,3),
(22,3),
(33,3)
]);
static shape_map: HashMap<&str, &str> = [
("X","A"),
("Y","B"),
("Z","C")
].iter().cloned().collect();
// static shape_map: HashMap<&str, &str> = [
// ("X","A"),
// ("Y","B"),
// ("Z","C")
// ].iter().cloned().collect();
struct Play {
them: u32,
you: u32
them: i32,
you: i32
}
fn main() {
println!("Hello, world!");
let scores: HashMap<&str, i32> = HashMap::from([
("A",1), //rock
("B",2), //paper
("C",3), //scizzors
("X",1),
("Y",2),
("Z",3)
]);
let possibilities: HashMap<i32,i32> = HashMap::from([
(12,0),
(13,6),
(21,6),
(23,0),
(31,0),
(32,6),
(11,3),
(22,3),
(33,3)
]);
let current_path = std::env::current_dir().unwrap();
let res = rfd::FileDialog::new().set_directory(&current_path).pick_file().unwrap();
let book = File::open(res.as_path()).unwrap();
let reader = BufReader::new(book);
let mut complete_score:u32 = 0;
for line in reader.lines() {
let play = parse_line(line.unwrap());
let score = get_score(play);
println!("score for line {} is {}", line.unwrap(), score);
complete_score += score;
let mut complete_score:i32 = 0;
for buffer in reader.lines() {
if let Ok(unparsed_play) = buffer { //found the way to handle these results :)
let play = parse_line(&unparsed_play, &scores);
let score = get_score(play, &possibilities);
println!("score for line {} is {}", &unparsed_play, score);
complete_score += score;
}
}
println!("the completed score for the whole book is {}",complete_score)
}
fn parse_line(line: String) -> Play {
fn parse_line(line: &String, scores: &HashMap<&str, i32>) -> Play {
let mut temp = line.split(' ').collect::<Vec<&str>>();
return Play {them: scores[temp[0]].clone(), you: scores[temp[1]].clone() }
}
fn get_score(p: Play) -> u32 {
fn get_score(p: Play, possibilities: &HashMap<i32, i32>) -> i32 {
return possibilities[&(p.you*10+p.them)]+&p.you;
}

3
day_2_part_2/basic Normal file
View File

@@ -0,0 +1,3 @@
A Y
B X
C Z

View File

@@ -0,0 +1,12 @@
<?xml version="1.0" encoding="UTF-8"?>
<module type="RUST_MODULE" version="4">
<component name="NewModuleRootManager" inherit-compiler-output="true">
<exclude-output />
<content url="file://$MODULE_DIR$">
<sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
<excludeFolder url="file://$MODULE_DIR$/target" />
</content>
<orderEntry type="inheritedJdk" />
<orderEntry type="sourceFolder" forTests="false" />
</component>
</module>

2500
day_2_part_2/input.txt Normal file

File diff suppressed because it is too large Load Diff

46
day_2_part_2/readme.md Normal file
View File

@@ -0,0 +1,46 @@
--- 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?
Your puzzle answer was XXXXXXX.
The first half of this puzzle is complete! It provides one gold star: *
--- 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?