Day 4 completed

Author: Zoe Peterson

day3.py

@@ -0,0 +1,52 @@
+import re
+import numpy as np
+
+def find_max_width_and_height(claims):
+	max_width = 0
+	max_height = 0
+	for claim in claims:
+		claim_list = re.split('@ |x|,|: |\n', claim)
+		x_start = int(claim_list[1])
+		y_start = int(claim_list[2])
+		width = int(claim_list[3])
+		height = int(claim_list[4])
+		if ((x_start + width) > max_width):
+			max_width = (x_start + width)
+		if ((y_start + height) > max_height):
+			max_height = (y_start + height)
+	return max_width, max_height
+
+def calculate_array_of_all_claims(claims, max_width, max_height):
+	array_of_all_claims = np.zeros([max_height, max_width])
+
+	for claim in claims:
+		claim_list = re.split('@ |x|,|: |\n', claim)
+		x_start = int(claim_list[1])
+		y_start = int(claim_list[2])
+		width = int(claim_list[3])
+		height = int(claim_list[4])
+		for y in range(y_start, (y_start + height)):
+			for x in range(x_start, (x_start + width)):
+				array_of_all_claims[y][x] = array_of_all_claims[y][x] + 1
+	return array_of_all_claims
+
+def find_overlaps(array_of_all_claims):
+	number_of_overlaps = 0
+	for row in range(len(array_of_all_claims)):
+		for column in range(len(array_of_all_claims[0])):
+			if (array_of_all_claims[row][column] > 1):
+				number_of_overlaps += 1
+	return number_of_overlaps
+
+def claim_that_does_not_overlap(array_of_all_claims):
+	print(array_of_all_claims)
+
+
+file_object = open("test_input_day_3.txt", "r")
+claims = file_object.readlines()
+max_width, max_height = find_max_width_and_height(claims)
+array_of_all_claims = calculate_array_of_all_claims(claims, max_width, max_height)
+print(find_overlaps(array_of_all_claims))
+print(claim_that_does_not_overlap(array_of_all_claims))
+
+file_object.close()

day4.py

@@ -0,0 +1,60 @@
+file_object = open("input_day_4.txt", "r")
+entries = file_object.readlines()
+file_object.close()
+
+#We need to put the entries in time order
+entries_list = []
+for entry in entries:
+	entries_list.append(entry)
+entries_list.sort()
+
+current_guard_id = 0
+time_fell_asleep = 0
+guard_sleep_amounts = {}
+current_sleepiest_guard = 0
+current_longest_time_slept = 0
+for entry in entries_list:
+	split_entry = entry.strip().replace('[', "").split(']')
+	#Case for "Guard #1871 begins shift"
+	if split_entry[1][1] == "G":
+		current_guard_id = split_entry[1].split()[1][1:]
+	#Case for falls asleep
+	elif split_entry[1].strip() == "falls asleep":
+		time_fell_asleep = int(split_entry[0][-2:])
+	#Case for wakes up
+	else:
+		time_slept =  (int(split_entry[0][-2:]) - time_fell_asleep)
+		if current_guard_id in guard_sleep_amounts.keys():
+			guard_sleep_amounts[current_guard_id] += time_slept
+		else:
+			guard_sleep_amounts[current_guard_id] = time_slept
+		#If adding this interval makes this guard the sleepiest so far, update
+		if guard_sleep_amounts[current_guard_id] > current_longest_time_slept:
+			current_longest_time_slept = guard_sleep_amounts[current_guard_id]
+			current_sleepiest_guard = current_guard_id
+
+sleepiest_guard = current_sleepiest_guard
+print("sleepiest guard", current_sleepiest_guard)
+
+#Find the minute this guard slept the most
+times_guard_slept_during_this_minute = [0] * 60
+
+current_guard_id = 0
+time_fell_asleep = 0
+for entry in entries_list:
+	split_entry = entry.strip().replace('[', "").split(']')
+	#Case for "Guard #1871 begins shift"
+	if split_entry[1][1] == "G":
+		current_guard_id = split_entry[1].split()[1][1:]
+	#Case for falls asleep
+	elif split_entry[1].strip() == "falls asleep":
+		time_fell_asleep = int(split_entry[0][-2:])
+	#Case for wakes up
+	else:
+		if current_guard_id == sleepiest_guard:
+			for i in range(time_fell_asleep, int(split_entry[0][-2:])):
+				times_guard_slept_during_this_minute[i] += 1
+
+sleepiest_minute = times_guard_slept_during_this_minute.index(max(times_guard_slept_during_this_minute))
+print("sleepiest minute", sleepiest_minute)
+print("answer", int(sleepiest_guard) * sleepiest_minute)

day4_part2.py

@@ -0,0 +1,39 @@
+file_object = open("input_day_4.txt", "r")
+entries = file_object.readlines()
+file_object.close()
+
+#We need to put the entries in time order
+entries_list = []
+for entry in entries:
+	entries_list.append(entry)
+entries_list.sort()
+
+current_guard_id = 0
+time_fell_asleep = 0
+guard_sleep_amounts = {}
+current_sleepiest_guard = 0
+current_sleepiest_minute_for_one_guard = 0
+for entry in entries_list:
+	split_entry = entry.strip().replace('[', "").split(']')
+	#Case for "Guard #1871 begins shift"
+	if split_entry[1][1] == "G":
+		current_guard_id = split_entry[1].split()[1][1:]
+	#Case for falls asleep
+	elif split_entry[1].strip() == "falls asleep":
+		time_fell_asleep = int(split_entry[0][-2:])
+	#Case for wakes up
+	else:
+		if not current_guard_id in guard_sleep_amounts.keys():
+			guard_sleep_amounts[current_guard_id] = [0] * 60
+
+		for i in range(time_fell_asleep, int(split_entry[0][-2:])):
+			guard_sleep_amounts[current_guard_id][i] += 1
+			if guard_sleep_amounts[current_guard_id][i] > current_sleepiest_minute_for_one_guard:
+				current_sleepiest_minute_for_one_guard = guard_sleep_amounts[current_guard_id][i]
+				current_sleepiest_guard = current_guard_id
+
+sleepiest_guard = current_sleepiest_guard
+print("sleepiest guard", sleepiest_guard)
+sleepiest_minute =  guard_sleep_amounts[sleepiest_guard].index(max(guard_sleep_amounts[sleepiest_guard]))
+print("sleepiest minute", sleepiest_minute)
+print("answer", int(sleepiest_guard) * sleepiest_minute)