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
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
long part_one(FILE *fp)
{
long res = 0;
int player_one[512] = { 0 }, player_two[512] = { 0 };
int one_low = 0, one_high = 0, two_low = 0, two_high = 0;
char *line = NULL;
size_t len;
int paragraph = 0;
int index = 0;
while (getline(&line, &len, fp) != -1) {
if (line[0] == '\n') {
index = 0;
paragraph++;
continue;
} else if (line[0] == 'P') {
continue;
} else {
int num;
sscanf(line, "%d", &num);
if (paragraph == 0)
player_one[index++] = num;
else
player_two[index++] = num;
}
}
one_high = two_high = index;
int cnt = 0;
while (1) {
int c1 = player_one[one_low++];
int c2 = player_two[two_low++];
cnt++;
if (!c1 || !c2)
break;
if (c1 > c2) {
player_one[one_high++] = c1;
player_one[one_high++] = c2;
} else {
player_two[two_high++] = c2;
player_two[two_high++] = c1;
}
}
int *winner = one_low == one_high + 1 ? player_two : player_one;
int low = one_low == one_high + 1 ? two_low : one_low;
int high = one_low == one_high + 1 ? two_high : one_high;
for (int i = high - low + 1, j = 0; i > 0; i--, j++)
res += i * winner[two_low + j - 1];
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;
}
|
