-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday-22.lisp
106 lines (87 loc) · 3.79 KB
/
day-22.lisp
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
(defpackage :day-22
(:use :cl)
(:import-from :utils :read-day-file :split-blank-lines)
(:import-from :cl-ppcre :do-register-groups)
(:export #:part-1 #:part-2))
(in-package :day-22)
(defun load-decks ()
(let ((decks-lines (split-blank-lines (read-day-file "22"))))
(mapcar #'(lambda (lines)
(mapcar #'parse-integer (rest lines))) decks-lines)))
(defun play-game-1 (arg-1 arg-2)
(let ((deck-1 arg-1)
(deck-2 arg-2))
(loop while (and (not (null deck-1)) (not (null deck-2)))
do (let ((card-1 (first deck-1))
(card-2 (first deck-2)))
(if (< card-2 card-1)
(progn
(setf deck-1 (append (rest deck-1) (list card-1 card-2)))
(setf deck-2 (rest deck-2)))
(progn
(setf deck-2 (append (rest deck-2) (list card-2 card-1)))
(setf deck-1 (rest deck-1)))))
finally (return (if deck-1 deck-1 deck-2)))))
(defun winning-score (lst)
(loop with counter = 0
for card in (reverse lst)
summing (* (incf counter) card) into score
finally (return score)))
(defstruct hand
player-1
player-2)
(defun deck->vector (deck)
(make-array (length deck) :element-type 'integer :initial-contents deck))
(defparameter *bailout-engaged* nil)
(defun bailout-rule (prev-hands deck-1 deck-2)
(let ((vec-1 (deck->vector deck-1))
(vec-2 (deck->vector deck-2)))
(setf *bailout-engaged* (or (find vec-1 prev-hands :key #'hand-player-1 :test #'equalp)
(find vec-2 prev-hands :key #'hand-player-2 :test #'equalp))))
*bailout-engaged*)
(defun recurse-p (card-1 deck-1 card-2 deck-2)
(and (<= card-1 (length deck-1))
(<= card-2 (length deck-2))))
(defun determine-winner (deck-1 deck-2)
(if (or *bailout-engaged* (null deck-2))
(values :player-1 deck-1)
(values :player-2 deck-2)))
(defun copy-n (n deck)
(loop for i from 0 below n
for c in deck
collecting c into new-deck
finally (return new-deck)))
(defun play-game-2 (arg-prev-hands arg-1 arg-2)
(let ((prev-hands arg-prev-hands)
(deck-1 arg-1)
(deck-2 arg-2))
(loop while (and (not (bailout-rule prev-hands deck-1 deck-2))
(not *bailout-engaged*)
(not (null deck-1))
(not (null deck-2)))
do (let ((card-1 (first deck-1))
(card-2 (first deck-2))
(hand-winner nil))
(push (make-hand :player-1 (deck->vector deck-1)
:player-2 (deck->vector deck-2)) prev-hands)
(if (recurse-p card-1 (rest deck-1) card-2 (rest deck-2))
(setf hand-winner (play-game-2 nil (copy-n card-1 (rest deck-1)) (copy-n card-2(rest deck-2))))
(setf hand-winner (if (< card-2 card-1) :player-1 :player-2)))
(if (eq hand-winner :player-1)
(progn
(setf deck-1 (append (rest deck-1) (list card-1 card-2)))
(setf deck-2 (rest deck-2)))
(progn
(setf deck-2 (append (rest deck-2) (list card-2 card-1)))
(setf deck-1 (rest deck-1))))))
(determine-winner deck-1 deck-2)))
(defun part-1 ()
(destructuring-bind (deck-1 deck-2) (load-decks)
(let ((winner (play-game-1 deck-1 deck-2)))
(winning-score winner))))
(defun part-2 ()
(destructuring-bind (deck-1 deck-2) (load-decks)
(multiple-value-bind (winner winning-deck) (play-game-2 nil deck-1 deck-2)
(format t "~&bailout engaged ~A" *bailout-engaged*)
(format t "~&winner ~A deck ~A" winner winning-deck)
(winning-score winning-deck))))