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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
typedef unsigned uint;
typedef unsigned long ulong;
enum { Zero = 256, Len = Zero * 2 };
struct State {
char pots[Len];
};
struct Rule {
char pots[5];
char next;
};
int main() {
struct State state;
memset(state.pots, '.', Len);
scanf("initial state: %s\n\n", &state.pots[Zero]);
for (uint i = 0; i < Len; ++i) {
if (!state.pots[i]) state.pots[i] = '.';
}
uint rulen = 0;
struct Rule rules[32];
while (!feof(stdin)) {
scanf("%5c => %c\n", rules[rulen].pots, &rules[rulen].next);
rulen++;
}
ulong g;
for (g = 0; g < 50000000000L; ++g) {
if (g == 20) {
int sum = 0;
for (int i = 0; i < Len; ++i) {
if (state.pots[i] == '#') sum += i - Zero;
}
printf("%d\n", sum);
}
struct State next;
memset(next.pots, '.', Len);
for (uint i = 2; i < Len - 2; ++i) {
for (uint r = 0; r < rulen; ++r) {
if (memcmp(&state.pots[i - 2], rules[r].pots, 5)) continue;
next.pots[i] = rules[r].next;
break;
}
}
if (next.pots[2] == '#' || next.pots[Len - 3] == '#') abort();
if (!memcmp(&next.pots[1], state.pots, Len - 1)) break;
state = next;
}
long sum = 0;
for (long i = 0; i < Len; ++i) {
if (state.pots[i] == '#') sum += (50000000000L - g) + i - Zero;
}
printf("%ld\n", sum);
}
|