Day7.cs


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73

using aoc2019.lib;
using System;
using System.Collections.Generic;
using System.Linq;

namespace aoc2019
{
    internal class Day7 : Day
    {
        public override int DayNumber => 7;

        private readonly List<int> input;
        private readonly IntCodeVM[] Amplifiers = new IntCodeVM[5];
        public Day7()
        {
            input = Input.First().Split(',').Select(int.Parse).ToList();
            for (var i = 0; i < 5; i++) Amplifiers[i] = new IntCodeVM(input);
        }

        

        public override string Part1()
        {
            int i, largest = 0;

            foreach (var phaseSeq in Enumerable.Range(0, 5).Permute())
            {
                i = 0;
                foreach (var (vm, phase) in Amplifiers.Zip(phaseSeq))
                {
                    vm.Reset();
                    vm.Run(phase, i);
                    i = vm.Result;
                }

                if (i > largest)
                    largest = i;
            }

            return $"{largest}";
        }

        public override string Part2()
        {
            int i, largest = 0;

            foreach (var phaseSeq in Enumerable.Range(5, 5).Permute())
            {
                i = 0;
                foreach (var (vm, phase) in Amplifiers.Zip(phaseSeq))
                {
                    vm.Reset();
                    vm.input.Enqueue(phase);
                }

                var vms = new Queue<IntCodeVM>(Amplifiers);
                while (vms.Count > 0)
                {
                    var vm = vms.Dequeue();
                    var haltType = vm.Run(i);
                    if (haltType == IntCodeVM.HaltType.Waiting)
                        vms.Enqueue(vm);
                    i = vm.Result;
                }

                if (i > largest)
                    largest = i;
            }

            return $"{largest}";
        }
    }
}