Added 2024 and day 1-3 solves in python

This commit is contained in:
d4rkr41n
2024-12-03 16:18:24 -06:00
parent f00e52f8a5
commit 2d5ce9ade1
12 changed files with 2441 additions and 0 deletions
+87
View File
@@ -0,0 +1,87 @@
Part 1: `383`
Part 2: `436`
[--- Day 2: Red-Nosed Reports ---
--------------------------------
Fortunately, the first location The Historians want to search isn't a long walk from the Chief Historian's office.
While the [Red-Nosed Reindeer nuclear fusion/fission plant](/2015/day/19) appears to contain no sign of the Chief Historian, the engineers there run up to you as soon as they see you. Apparently, they *still* talk about the time Rudolph was saved through molecular synthesis from a single electron.
They're quick to add that - since you're already here - they'd really appreciate your help analyzing some unusual data from the Red-Nosed reactor. You turn to check if The Historians are waiting for you, but they seem to have already divided into groups that are currently searching every corner of the facility. You offer to help with the unusual data.
The unusual data (your puzzle input) consists of many *reports*, one report per line. Each report is a list of numbers called *levels* that are separated by spaces. For example:
```
7 6 4 2 1
1 2 7 8 9
9 7 6 2 1
1 3 2 4 5
8 6 4 4 1
1 3 6 7 9
```
This example data contains six reports each containing five levels.
The engineers are trying to figure out which reports are *safe*. The Red-Nosed reactor safety systems can only tolerate levels that are either gradually increasing or gradually decreasing. So, a report only counts as safe if both of the following are true:
* The levels are either *all increasing* or *all decreasing*.
* Any two adjacent levels differ by *at least one* and *at most three*.
In the example above, the reports can be found safe or unsafe by checking those rules:
* `7 6 4 2 1`: *Safe* because the levels are all decreasing by 1 or 2.
* `1 2 7 8 9`: *Unsafe* because `2 7` is an increase of 5.
* `9 7 6 2 1`: *Unsafe* because `6 2` is a decrease of 4.
* `1 3 2 4 5`: *Unsafe* because `1 3` is increasing but `3 2` is decreasing.
* `8 6 4 4 1`: *Unsafe* because `4 4` is neither an increase or a decrease.
* `1 3 6 7 9`: *Safe* because the levels are all increasing by 1, 2, or 3.
So, in this example, `*2*` reports are *safe*.
Analyze the unusual data from the engineers. *How many reports are safe?*
, --- Part Two ---
----------------
The engineers are surprised by the low number of safe reports until they realize they forgot to tell you about the Problem Dampener.
The Problem Dampener is a reactor-mounted module that lets the reactor safety systems *tolerate a single bad level* in what would otherwise be a safe report. It's like the bad level never happened!
Now, the same rules apply as before, except if removing a single level from an unsafe report would make it safe, the report instead counts as safe.
More of the above example's reports are now safe:
* `7 6 4 2 1`: *Safe* without removing any level.
* `1 2 7 8 9`: *Unsafe* regardless of which level is removed.
* `9 7 6 2 1`: *Unsafe* regardless of which level is removed.
* `1 *3* 2 4 5`: *Safe* by removing the second level, `3`.
* `8 6 *4* 4 1`: *Safe* by removing the third level, `4`.
* `1 3 6 7 9`: *Safe* without removing any level.
Thanks to the Problem Dampener, `*4*` reports are actually *safe*!
Update your analysis by handling situations where the Problem Dampener can remove a single level from unsafe reports. *How many reports are now safe?*
]
+1000
View File
File diff suppressed because it is too large Load Diff
+31
View File
@@ -0,0 +1,31 @@
with open("../input.txt", "r") as fp:
inputs = [list(map(int, line.rstrip().split())) for line in fp]
safe = 0
for line in inputs:
increase = 0
decrease = 0
unsafe = False
for i, a in enumerate(line[:-1]):
b = line[i+1]
# Check for difference of 1-3
if abs(a-b) > 3 or abs(a-b) < 1:
unsafe = True
break
# Watch for increase/decrease
if a < b:
increase += 1
else:
decrease += 1
if increase != 0 and decrease != 0:
unsafe = True
break
if not unsafe:
safe += 1
print(safe)
+51
View File
@@ -0,0 +1,51 @@
with open("../input.txt", "r") as fp:
inputs = [list(map(int, line.rstrip().split())) for line in fp]
def is_safe(line, rec=True):
increase = 0
decrease = 0
for i, a in enumerate(line[:-1]):
b = line[i+1]
# Check for difference of 1-3
if abs(a-b) > 3 or abs(a-b) < 1:
if rec:
case_0 = line[:]
case_0.pop(0)
case_1 = line[:]
case_1.pop(i)
case_2 = line[:]
case_2.pop(i+1)
if is_safe(case_0, False) or is_safe(case_1, False) or is_safe(case_2, False):
return True
return False
# Watch for increase/decrease
if a < b:
increase += 1
else:
decrease += 1
if increase != 0 and decrease != 0:
if rec:
case_0 = line[:]
case_0.pop(0)
case_1 = line[:]
case_1.pop(i)
case_2 = line[:]
case_2.pop(i+1)
if is_safe(case_0, False) or is_safe(case_1, False) or is_safe(case_2, False):
return True
return False
return True
safe = 0
for line in inputs:
if is_safe(line):
safe += 1
print(safe)