-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday22b.c
162 lines (141 loc) · 4.83 KB
/
day22b.c
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
#include "common.h"
#include "deque.h"
struct GameState {
Deque_t player1;
Deque_t player2;
};
void gamestate_init (struct GameState * state) {
deque_init(&(state->player1), 52);
deque_init(&(state->player2), 52);
}
void gamestate_free (struct GameState * state) {
deque_free(&(state->player1));
deque_free(&(state->player2));
}
void gamestate_copy (struct GameState * dest, struct GameState const * src) {
deque_copy(&(dest->player1), &(src->player1));
deque_copy(&(dest->player2), &(src->player2));
}
_Bool gamestate_equals (struct GameState const * state0, struct GameState const * state1) {
if (state0->player1.count != state1->player1.count) {
return 0;
}
if (state0->player2.count != state1->player2.count) {
return 0;
}
for (size_t i = 0; i < state0->player1.count; ++i) {
ptrdiff_t ind0 = (state0->player1.first + i) % state0->player1.capacity;
ptrdiff_t ind1 = (state1->player1.first + i) % state1->player1.capacity;
if (state0->player1.values[ind0] != state1->player1.values[ind1]) {
return 0;
}
}
for (size_t i = 0; i < state0->player2.count; ++i) {
ptrdiff_t ind0 = (state0->player2.first + i) % state0->player2.capacity;
ptrdiff_t ind1 = (state1->player2.first + i) % state1->player2.capacity;
if (state0->player2.values[ind0] != state1->player2.values[ind1]) {
return 0;
}
}
return 1;
}
int playGame (struct GameState * state) {
size_t history_capacity = 64;
size_t history_count = 0;
struct GameState * history = malloc(sizeof(struct GameState)*history_capacity);
do {
for (size_t i = 0; i < history_count; ++i) {
if (gamestate_equals(state, &(history[i]))) {
for (size_t j = 0; j < history_count; ++j) {
gamestate_free(&(history[j]));
}
return 1;
}
}
if (history_count == history_capacity) {
history_capacity *= 2;
history = realloc(history, sizeof(struct GameState)*history_capacity);
}
gamestate_copy(&(history[history_count++]), state);
intptr_t v1 = deque_pop(&(state->player1));
intptr_t v2 = deque_pop(&(state->player2));
int winner;
if (v1 <= (intptr_t)state->player1.count && v2 <= (intptr_t)state->player2.count) {
struct GameState child_state;
gamestate_init(&child_state);
for (intptr_t i = 0; i < v1; ++i) {
ptrdiff_t ind = (state->player1.first + i) % state->player1.capacity;
deque_push(&(child_state.player1), state->player1.values[ind]);
}
for (intptr_t i = 0; i < v2; ++i) {
ptrdiff_t ind = (state->player2.first + i) % state->player2.capacity;
deque_push(&(child_state.player2), state->player2.values[ind]);
}
winner = playGame(&child_state);
gamestate_free(&child_state);
} else {
winner = (v1 > v2) ? 1 : 2;
}
if (winner == 1) {
deque_push(&(state->player1), v1);
deque_push(&(state->player1), v2);
} else {
ASSERT(winner == 2);
deque_push(&(state->player2), v2);
deque_push(&(state->player2), v1);
}
} while (state->player1.count && state->player2.count);
int winner;
if (state->player1.count) {
winner = 1;
} else {
ASSERT(state->player2.count);
winner = 2;
}
for (size_t i = 0; i < history_count; ++i) {
gamestate_free(&(history[i]));
}
return winner;
}
intptr_t computeScore (struct Deque * cards) {
intptr_t multiplier = cards->count;
intptr_t score = 0;
do {
intptr_t value = deque_pop(cards);
score += value * multiplier;
--multiplier;
} while (cards->count);
return score;
}
int main (int argc, char ** argv) {
struct GameState state;
gamestate_init(&state);
char buf [BUFSIZ];
char * s = fgets(&(buf[0]), sizeof(buf), stdin);
ASSERT(!strcmp(s, "Player 1:\n"));
do {
s = fgets(&(buf[0]), sizeof(buf), stdin);
ASSERT(s);
if (!strcmp(s, "\n")) {
break;
}
long value = strtol(s, NULL, 10);
deque_push(&(state.player1), value);
} while (1);
s = fgets(&(buf[0]), sizeof(buf), stdin);
ASSERT(!strcmp(s, "Player 2:\n"));
do {
s = fgets(&(buf[0]), sizeof(buf), stdin);
if (!s) {
break;
}
if (!strcmp(s, "\n")) {
break;
}
long value = strtol(s, NULL, 10);
deque_push(&(state.player2), value);
} while (1);
int winner = playGame(&state);
intptr_t score = computeScore((winner == 1) ? &(state.player1) : &(state.player2));
DISP(score);
}