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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#define COUNT 10
enum cnt_pos { T, R, B, L };
struct tile {
int id;
int match[144];
int cnt[4]; // cnt_pos
int top[COUNT];
int right[COUNT];
int bottom[COUNT];
int left[COUNT];
int top_rev[COUNT];
int right_rev[COUNT];
int bottom_rev[COUNT];
int left_rev[COUNT];
};
void reverse(int dest[], int src[])
{
for (int i = 0; i < COUNT; i++) {
dest[COUNT - 1 - i] = src[i];
}
}
long part_one(FILE *fp)
{
long res = 1;
struct tile tiles[144] = { 0 };
int tile_cnt = 0;
char *line = NULL;
size_t len;
int y = 0;
while (getline(&line, &len, fp) != -1) {
int num;
if (line[0] == '\n') {
tile_cnt++;
} else if (sscanf(line, "Tile %d:", &num) == 1) {
struct tile new = { 0 };
new.id = num;
tiles[tile_cnt] = new;
y = 0;
} else {
struct tile *tile = &tiles[tile_cnt];
if (y == 0) {
for (int i = 0; i < COUNT; i++) {
tile->top[i] = line[i] == '#';
tile->cnt[T] += tile->top[i];
}
} else if (y == COUNT - 1) {
for (int i = 0; i < COUNT; i++) {
tile->bottom[i] = line[i] == '#';
tile->cnt[B] += tile->bottom[i];
}
}
tile->left[y] = line[0] == '#';
tile->cnt[L] += tile->left[y];
tile->right[y] = line[COUNT - 1] == '#';
tile->cnt[R] += tile->right[y];
y++;
}
}
tile_cnt++;
free(line);
for (int i = 0; i < tile_cnt; i++) {
struct tile *tile = &tiles[i];
reverse(tile->top_rev, tile->top);
reverse(tile->right_rev, tile->right);
reverse(tile->bottom_rev, tile->bottom);
reverse(tile->left_rev, tile->left);
}
for (int i = 0; i < tile_cnt; i++) {
struct tile *tile = &tiles[i];
// Find adjacent
int *cur, *cur_rev, cnt;
for (int j = 0; j < 4; j++) { // TRBL
switch (j) {
case T:
cnt = tile->cnt[T];
cur = tile->top;
cur_rev = tile->top_rev;
break;
case R:
cnt = tile->cnt[R];
cur = tile->right;
cur_rev = tile->right_rev;
break;
case B:
cnt = tile->cnt[B];
cur = tile->bottom;
cur_rev = tile->bottom_rev;
break;
case L:
cnt = tile->cnt[L];
cur = tile->left;
cur_rev = tile->left_rev;
break;
default:
exit(1);
break;
}
for (int k = 0; k < tile_cnt; k++) {
struct tile *cmp = &tiles[k];
if (cmp->id == tile->id)
continue;
int match_cnt = 0;
if (cnt == cmp->cnt[T]) {
if (!memcmp(cur, cmp->top, 40)) {
match_cnt++;
} else if (!memcmp(cur_rev, cmp->top, 40)) {
match_cnt++;
}
}
if (cnt == cmp->cnt[R]) {
if (!memcmp(cur, cmp->right, 40)) {
match_cnt++;
} else if (!memcmp(cur_rev, cmp->right, 40)) {
match_cnt++;
}
}
if (cnt == cmp->cnt[B]) {
if (!memcmp(cur, cmp->bottom, 40)) {
match_cnt++;
} else if (!memcmp(cur_rev, cmp->bottom, 40)) {
match_cnt++;
}
}
if (cnt == cmp->cnt[L]) {
if (!memcmp(cur, cmp->left, 40)) {
match_cnt++;
} else if (!memcmp(cur_rev, cmp->left, 40)) {
match_cnt++;
}
}
tile->match[k] += match_cnt;
}
}
}
for (int i = 0; i < tile_cnt; i++) {
struct tile *tile = &tiles[i];
int cnt = 0;
for (int j = 0; j < tile_cnt; j++) {
cnt += tile->match[j];
}
if (cnt == 2)
res *= tile->id;
}
return res;
}
long part_two(FILE *fp)
{
long res = 0;
return res;
}
int main(int argc, char *argv[])
{
FILE *fp = fopen("input", "r");
if (!fp)
exit(EXIT_FAILURE);
clock_t tic = clock();
printf("%lu\n", part_one(fp));
rewind(fp);
printf("%lu\n", part_two(fp));
clock_t toc = clock();
printf("TIME: %f seconds\n", (double)(toc - tic) / CLOCKS_PER_SEC);
fclose(fp);
return 0;
}
|
