-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay8.cs
72 lines (57 loc) · 2.07 KB
/
Day8.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
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Drawing;
using System.Text.RegularExpressions;
using System.Diagnostics;
namespace AdventOfCode2018
{
class Day8 : Day
{
public override bool Test()
{
return Utils.Test(Part1, "2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2", "138") &&
Utils.Test(Part2, "2 3 0 3 10 11 12 1 1 0 1 99 2 1 1 2", "66");
}
public override dynamic Options => new { basetime = 60, elves = 5 };
public override string Part1(string input, dynamic options)
{
var data = input.Split(' ').Select(i => int.Parse(i)).ToList();
return consumeNode(data, 0).Item1.ToString();
}
private (int,int,int) consumeNode(List<int> data, int offset)
{
var originalOffset = offset;
var nodes = data[offset];
var metadata = data[offset + 1];
var total = 0;
var alternateTotal = 0;
var childTotals = new int[nodes];
offset += 2;
for (int n = 0; n < nodes; n++)
{
(var metadatadelta, var alternateDelta, var newOffset) = consumeNode(data, offset);
total += metadatadelta;
offset = newOffset;
childTotals[n] = alternateDelta;
}
for(int m = 0;m < metadata;m++)
{
total += data[offset];
if (data[offset] > 0 && data[offset] < nodes + 1)
{
alternateTotal += childTotals[data[offset] - 1];
}
offset++;
}
return (total, nodes > 0 ? alternateTotal : total, offset);
}
public override string Part2(string input, dynamic options)
{
var data = input.Split(' ').Select(i => int.Parse(i)).ToList();
return consumeNode(data, 0).Item2.ToString();
}
}
}