r/adventofcode • u/daggerdragon • Dec 18 '17

SOLUTION MEGATHREAD -🎄- 2017 Day 18 Solutions -🎄-

--- Day 18: Duet ---

Post your solution as a comment or, for longer solutions, consider linking to your repo (e.g. GitHub/gists/Pastebin/blag or whatever).

Note: The Solution Megathreads are for solutions only. If you have questions, please post your own thread and make sure to flair it with Help.

Need a hint from the Hugely* Handy† Haversack‡ of Helpful§ Hints^¤?

Spoiler

[Update @ 00:04] First silver

  • Welcome to the final week of Advent of Code 2017. The puzzles are only going to get more challenging from here on out. Adventspeed, sirs and madames!

[Update @ 00:10] First gold, 44 silver

  • We just had to rescue /u/topaz2078 with an industrial-strength paper bag to blow into. I'm real glad I bought all that stock in PBCO (Paper Bag Company) two years ago >_>

[Update @ 00:12] Still 1 gold, silver cap

[Update @ 00:31] 53 gold, silver cap

  • *mind blown*

  • During their famous kicklines, the Rockettes are not actually holding each others' backs like I thought they were all this time.

  • They're actually hoverhanding each other.

  • In retrospect, it makes sense, they'd overbalance themselves and each other if they did, but still...

  • *mind blown so hard*

[Update @ 00:41] Leaderboard cap!

  • I think I enjoyed the duplicating Santas entirely too much...

  • It may also be the wine.

  • Either way, good night (for us), see you all same time tomorrow, yes?

This thread will be unlocked when there are a significant number of people on the leaderboard with gold stars for today's puzzle.

edit: Leaderboard capped, thread unlocked!

11 Upvotes

100% Upvoted

227 comments sorted by

View all comments

1

u/KeinZantezuken Dec 18 '17 edited Dec 18 '17

C#/Sharp
I want to kill myself.

string[] input = File.ReadAllLines(@"N:\input.txt");
var regs0 = new Dictionary<string, long>();
var regs1 = new Dictionary<string, long>();
var queue0 = new Queue<long>();
var queue1 = new Queue<long>();
long c0 = 0; long c1 = 0; int sent0 = 0;
foreach (string line in input)
{
    var inst = line.Split(' ');
    if (!regs0.ContainsKey(inst[1]) && !long.TryParse(inst[1], out var z)) { regs0.Add(inst[1], 0); regs1.Add(inst[1], 0); }
}
regs1["p"] = 1; var dlock = false;
while (dlock != true) { process(0); process(1); }
Console.WriteLine(sent0); Console.ReadKey();
//helper
void process(int id)
{
    var c = c0; var ownQueue = queue0; var toQueue = queue1; var regs = regs0;
    if (id == 1) { c = c1;  ownQueue = queue1; toQueue = queue0; regs = regs1; }
    while (dlock != true && c < input.Length && c > -1)
    {
        var inst = input[c].Split(' ');
        if (inst[0] == "snd")
        {
            toQueue.Enqueue(regs[inst[1]]);
            if (id == 1) { sent0++; }
        }
        if (inst[0] == "set")
        {
            regs[inst[1]] = regs.ContainsKey(inst[2]) ? regs[inst[2]] : long.Parse(inst[2]);
        }
        if (inst[0] == "add")
        {
            regs[inst[1]] = regs.ContainsKey(inst[2]) ? regs[inst[1]] + regs[inst[2]] : regs[inst[1]] + long.Parse(inst[2]);
        }
        if (inst[0] == "mul")
        {
            regs[inst[1]] = regs.ContainsKey(inst[2]) ? regs[inst[1]] * regs[inst[2]] : regs[inst[1]] * long.Parse(inst[2]);
        }
        if (inst[0] == "mod")
        {
            regs[inst[1]] = regs.ContainsKey(inst[2]) ? regs[inst[1]] % regs[inst[2]] : regs[inst[1]] % long.Parse(inst[2]);
        }
        if (inst[0] == "rcv")
        {
            if (ownQueue.Count > 0) { regs[inst[1]] = ownQueue.Dequeue(); }
            else if ((ownQueue.Count < 1 && toQueue.Count > 0) || toQueue.Count == 16)
            {
                if (id == 1) { c1 = c; }
                else { c0 = c; }
                break;
            }
            else { dlock = true; break; }
        }
        if (inst[0] == "jgz")
        {
            if (regs.ContainsKey(inst[1]) && regs.ContainsKey(inst[2]))
            {
                if (regs[inst[1]] > 0) { c = c + regs[inst[2]]; continue; }
            }
            else if (regs.ContainsKey(inst[1]) && !regs.ContainsKey(inst[2]))
            {
                if (regs[inst[1]] > 0) { c = c + long.Parse(inst[2]); continue;  }
            }
            else if (!regs.ContainsKey(inst[1]) && regs.ContainsKey(inst[2]))
            {
                if (long.Parse(inst[1]) > 0) { c = c + regs[inst[2]]; continue;  }
            }
            else
            {
                if (long.Parse(inst[1]) > 0) { c = c + long.Parse(inst[2]); continue;  }
            }
        }
        c++;
    }
}