adventofcode/2015/day13/problem

89 lines
3.4 KiB
Plaintext
Raw Permalink Normal View History

2018-03-15 16:24:23 +00:00
Advent of Code
2016-12-16 22:21:15 +00:00
--- Day 13: Knights of the Dinner Table ---
2018-03-15 16:24:23 +00:00
In years past, the holiday feast with your family hasn't gone so well. Not
everyone gets along! This year, you resolve, will be different. You're going
to find the optimal seating arrangement and avoid all those awkward
conversations.
2016-12-16 22:21:15 +00:00
2018-03-15 16:24:23 +00:00
You start by writing up a list of everyone invited and the amount their
happiness would increase or decrease if they were to find themselves sitting
next to each other person. You have a circular table that will be just big
enough to fit everyone comfortably, and so each person will have exactly two
neighbors.
2016-12-16 22:21:15 +00:00
2018-03-15 16:24:23 +00:00
For example, suppose you have only four attendees planned, and you calculate
their potential happiness as follows:
2016-12-16 22:21:15 +00:00
Alice would gain 54 happiness units by sitting next to Bob.
Alice would lose 79 happiness units by sitting next to Carol.
Alice would lose 2 happiness units by sitting next to David.
Bob would gain 83 happiness units by sitting next to Alice.
Bob would lose 7 happiness units by sitting next to Carol.
Bob would lose 63 happiness units by sitting next to David.
Carol would lose 62 happiness units by sitting next to Alice.
Carol would gain 60 happiness units by sitting next to Bob.
Carol would gain 55 happiness units by sitting next to David.
David would gain 46 happiness units by sitting next to Alice.
David would lose 7 happiness units by sitting next to Bob.
David would gain 41 happiness units by sitting next to Carol.
2018-03-15 16:24:23 +00:00
Then, if you seat Alice next to David, Alice would lose 2 happiness units
(because David talks so much), but David would gain 46 happiness units
(because Alice is such a good listener), for a total change of 44.
2016-12-16 22:21:15 +00:00
2018-03-15 16:24:23 +00:00
If you continue around the table, you could then seat Bob next to Alice (Bob
gains 83, Alice gains 54). Finally, seat Carol, who sits next to Bob (Carol
gains 60, Bob loses 7) and David (Carol gains 55, David gains 41). The
arrangement looks like this:
2016-12-16 22:21:15 +00:00
+41 +46
+55 David -2
Carol Alice
+60 Bob +54
-7 +83
2018-03-15 16:24:23 +00:00
After trying every other seating arrangement in this hypothetical scenario,
you find that this one is the most optimal, with a total change in happiness
of 330.
2016-12-16 22:21:15 +00:00
2018-03-15 16:24:23 +00:00
What is the total change in happiness for the optimal seating arrangement of
the actual guest list?
2016-12-16 22:21:15 +00:00
Your puzzle answer was 733.
--- Part Two ---
2018-03-15 16:24:23 +00:00
In all the commotion, you realize that you forgot to seat yourself. At this
point, you're pretty apathetic toward the whole thing, and your happiness
wouldn't really go up or down regardless of who you sit next to. You assume
everyone else would be just as ambivalent about sitting next to you, too.
2016-12-16 22:21:15 +00:00
2018-03-15 16:24:23 +00:00
So, add yourself to the list, and give all happiness relationships that
involve you a score of 0.
2016-12-16 22:21:15 +00:00
2018-03-15 16:24:23 +00:00
What is the total change in happiness for the optimal seating arrangement
that actually includes yourself?
2016-12-16 22:21:15 +00:00
Your puzzle answer was 725.
Both parts of this puzzle are complete! They provide two gold stars: **
2018-03-15 16:24:23 +00:00
At this point, you should return to your advent calendar and try another
puzzle.
2016-12-16 22:21:15 +00:00
If you still want to see it, you can get your puzzle input.
References
Visible links
. http://adventofcode.com/
. http://adventofcode.com/about
. http://adventofcode.com/stats
. http://adventofcode.com/leaderboard
. http://adventofcode.com/settings
. http://adventofcode.com/auth/logout
. http://adventofcode.com/
. http://adventofcode.com/day/13/input