-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDay12.cs
200 lines (160 loc) · 5.29 KB
/
Day12.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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
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 Day12 : Day
{
int offset = 10;
int generations = 200;
int size = 400;
public override bool Test()
{
return Utils.Test(Part1, testInput, "325");
}
public override string Part1(string input, dynamic options)
{
var statestring = Utils.splitLines(input).First().Split(' ')[2];
bool[] state = new bool[size];
for (int i = 0; i < statestring.Length; i++)
{
if (statestring[i] == '#')
{
state[offset + i] = true;
}
}
var rulesstrings = Utils.splitLines(input).Skip(2).ToList();
var rules = new bool[rulesstrings.Count,6];
for (int r = 0; r < rulesstrings.Count; r++)
{
for (int i = 0; i < 5; i++)
{
rules[r, i] = (rulesstrings[r][i] == '#');
rules[r, 5] = (rulesstrings[r][9] == '#');
}
}
for (int g = 0; g < 20; g++)
{
bool[] newState = new bool[size];
for (int x = 0; x < state.Length - 4; x++)
{
for (int r = 0; r < rulesstrings.Count; r++)
{
bool matches = true;
for (int i = 0; i < 5; i++)
{
matches &= (rules[r,i] == state[x + i]);
}
if (matches)
{
newState[x + 2] = rules[r, 5];
break;
}
}
}
state = newState;
}
Console.WriteLine();
return Total(state).ToString();
}
private void print(bool[] state)
{
Console.WriteLine();
foreach (bool b in state)
{
Console.Write(b ? "#" : ".");
}
}
private int Total(bool[] state)
{
int total = 0;
for (int x = 0; x < state.Length; x++)
{
if (state[x])
{
total += (x - offset);
}
}
return total;
}
public override string Part2(string input, dynamic options)
{
var statestring = Utils.splitLines(input).First().Split(' ')[2];
bool[] state = new bool[size];
for (int i = 0; i < statestring.Length; i++)
{
if (statestring[i] == '#')
{
state[offset + i] = true;
}
}
var rulesstrings = Utils.splitLines(input).Skip(2).ToList();
var rules = new bool[rulesstrings.Count, 6];
for (int r = 0; r < rulesstrings.Count; r++)
{
for (int i = 0; i < 5; i++)
{
rules[r, i] = (rulesstrings[r][i] == '#');
rules[r, 5] = (rulesstrings[r][9] == '#');
}
}
int prevTotal = Total(state);
int prevDelta = 0;
for (int g = 0; g < 200; g++)
{
bool[] newState = new bool[size];
for (int x = 0; x < state.Length - 4; x++)
{
for (int r = 0; r < rulesstrings.Count; r++)
{
bool matches = true;
for (int i = 0; i < 5; i++)
{
matches &= (rules[r, i] == state[x + i]);
}
if (matches)
{
newState[x + 2] = rules[r, 5];
break;
}
}
}
state = newState;
//print(state);
var total = Total(state);
var delta = total - prevTotal;
Console.Write(" " + total + " " + delta);
if (prevDelta == delta)
{
Console.WriteLine("converged after " + g);
return ((long)total + (long)delta * (50000000000l - g - 1)).ToString();
}
prevTotal = total;
prevDelta = delta;
}
Console.WriteLine();
return Total(state).ToString();
}
private string testInput =>
@"initial state: #..#.#..##......###...###
...## => #
..#.. => #
.#... => #
.#.#. => #
.#.## => #
.##.. => #
.#### => #
#.#.# => #
#.### => #
##.#. => #
##.## => #
###.. => #
###.# => #
####. => #";
}
}