Akumatic/Advent-of-Code
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

2022 Day 01

Browse Source
This commit is contained in:
Akumatic 2022-12-01 10:54:04 +01:00
parent bf2efe4d5a
commit ba976e7049
7 changed files with 2397 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

50
2022/01/README.md Normal file
View File

@ -0,0 +1,50 @@
# 2022 Day 01: Calorie Counting
Copyright (c) Eric Wastl
#### [Direct Link](https://adventofcode.com/2022/day/1)
## Part 1
The jungle must be too overgrown and difficult to navigate in vehicles or access from the air; the Elves' expedition traditionally goes on foot. As your boats approach land, the Elves begin taking inventory of their supplies. One important consideration is food - in particular, the number of **Calories** each Elf is carrying (your puzzle input).
The Elves take turns writing down the number of Calories contained by the various meals, snacks, rations, etc. that they've brought with them, one item per line. Each Elf separates their own inventory from the previous Elf's inventory (if any) by a blank line.
For example, suppose the Elves finish writing their items' Calories and end up with the following list:
```
1000
2000
3000
4000
5000
6000
7000
8000
9000
10000
```
This list represents the Calories of the food carried by five Elves:
- The first Elf is carrying food with `1000`, `2000`, and `3000` Calories, a total of **`6000`** Calories.
- The second Elf is carrying one food item with **`4000`** Calories.
- The third Elf is carrying food with `5000` and `6000` Calories, a total of **`11000`** Calories.
- The fourth Elf is carrying food with `7000`, `8000`, and `9000` Calories, a total of **`24000`** Calories.
- The fifth Elf is carrying one food item with **`10000`** Calories.
In case the Elves get hungry and need extra snacks, they need to know which Elf to ask: they'd like to know how many Calories are being carried by the Elf carrying the **most** Calories. In the example above, this is **`24000`** (carried by the fourth Elf).
Find the Elf carrying the most Calories. **How many total Calories is that Elf carrying?**
## Part 2
By the time you calculate the answer to the Elves' question, they've already realized that the Elf carrying the most Calories of food might eventually **run out of snacks**.
To avoid this unacceptable situation, the Elves would instead like to know the total Calories carried by the **top three** Elves carrying the most Calories. That way, even if one of those Elves runs out of snacks, they still have two backups.
In the example above, the top three Elves are the fourth Elf (with `24000` Calories), then the third Elf (with `11000` Calories), then the fifth Elf (with `10000` Calories). The sum of the Calories carried by these three elves is **`45000`**.
Find the top three Elves carrying the most Calories. **How many Calories are those Elves carrying in total?**

20
2022/01/code.py Normal file
View File

@ -0,0 +1,20 @@
# SPDX-License-Identifier: MIT
# Copyright (c) 2022 Akumatic
#
# https://adventofcode.com/2022/day/01
def read_file(filename: str = "input.txt") -> list:
with open(f"{__file__.rstrip('code.py')}{filename}", "r") as f:
groups = [group for group in f.read().strip().split("\n\n")]
return [sum(int(i) for i in group.split("\n")) for group in groups]
def part1(vals: list) -> int:
return sorted(vals)[-1]
def part2(vals: list) -> int:
return sum(sorted(vals)[-3:])
if __name__ == "__main__":
vals = read_file()
print(f"Part 1: {part1(vals)}")
print(f"Part 2: {part2(vals)}")

2255
2022/01/input.txt Normal file
View File

File diff suppressed because it is too large Load Diff

2
2022/01/solution.txt Normal file
View File

@ -0,0 +1,2 @@
Part 1: 69310
Part 2: 206104

14
2022/01/test_code.py Normal file
View File

@ -0,0 +1,14 @@
# SPDX-License-Identifier: MIT
# Copyright (c) 2022 Akumatic
from code import read_file, part1, part2
def test():
vals = read_file("test_input.txt")
assert part1(vals) == 24000
print("Passed Part 1")
assert part2(vals) == 45000
print("Passed Part 2")
if __name__ == "__main__":
test()

14
2022/01/test_input.txt Normal file
View File

@ -0,0 +1,14 @@
1000
2000
3000
4000
5000
6000
7000
8000
9000
10000

42
2022/README.md Normal file
View File

@ -0,0 +1,42 @@
# Advent of Code - 2022
Copyright (c) Eric Wastl
#### [Direct Link](https://adventofcode.com/2022)
## Intro
Santa's reindeer typically eat regular reindeer food, but they need a lot of [magical energy](https://adventofcode.com/2018/day/25) to deliver presents on Christmas. For that, their favorite snack is a special type of **star** fruit that only grows deep in the jungle. The Elves have brought you on their annual expedition to the grove where the fruit grows.
To supply enough magical energy, the expedition needs to retrieve a minimum of **fifty stars** by December 25th. Although the Elves assure you that the grove has plenty of fruit, you decide to grab any fruit you see along the way, just in case.
Collect stars by solving puzzles. Two puzzles will be made available on each day in the Advent calendar; the second puzzle is unlocked when you complete the first. Each puzzle grants **one star**. Good luck!
## Overview
| Day | Part 1 | Part 2 | My Solution | Official Website |
| --- | --- | --- |---| --- |
| 01 | :white_check_mark | :white_check_mark | [Solution](01/code.py) | [Day 01](https://adventofcode.com/2022/day/1) |
| 02 | | | | [Day 02](https://adventofcode.com/2022/day/2) |
| 03 | | | | [Day 03](https://adventofcode.com/2022/day/3) |
| 04 | | | | [Day 04](https://adventofcode.com/2022/day/4) |
| 05 | | | | [Day 05](https://adventofcode.com/2022/day/5) |
| 06 | | | | [Day 06](https://adventofcode.com/2022/day/6) |
| 07 | | | | [Day 07](https://adventofcode.com/2022/day/7) |
| 08 | | | | [Day 08](https://adventofcode.com/2022/day/8) |
| 09 | | | | [Day 09](https://adventofcode.com/2022/day/9) |
| 10 | | | | [Day 10](https://adventofcode.com/2022/day/10) |
| 11 | | | | [Day 11](https://adventofcode.com/2022/day/11) |
| 12 | | | | [Day 12](https://adventofcode.com/2022/day/12) |
| 13 | | | | [Day 13](https://adventofcode.com/2022/day/13) |
| 14 | | | | [Day 14](https://adventofcode.com/2022/day/14) |
| 15 | | | | [Day 15](https://adventofcode.com/2022/day/15) |
| 16 | | | | [Day 16](https://adventofcode.com/2022/day/16) |
| 17 | | | | [Day 17](https://adventofcode.com/2022/day/17) |
| 18 | | | | [Day 18](https://adventofcode.com/2022/day/18) |
| 19 | | | | [Day 19](https://adventofcode.com/2022/day/19) |
| 20 | | | | [Day 20](https://adventofcode.com/2022/day/20) |
| 21 | | | | [Day 21](https://adventofcode.com/2022/day/21) |
| 22 | | | | [Day 22](https://adventofcode.com/2022/day/22) |
| 23 | | | | [Day 23](https://adventofcode.com/2022/day/23) |
| 24 | | | | [Day 24](https://adventofcode.com/2022/day/24) |
| 25 | | | | [Day 25](https://adventofcode.com/2022/day/25) |