結果
| 問題 | No.885 アマリクエリ |
| ユーザー |
 sansaqua
|
| 提出日時 | 2019-09-14 10:33:26 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
AC
|
| 実行時間 | 523 ms / 2,000 ms |
| コード長 | 23,383 bytes |
| コンパイル時間 | 819 ms |
| コンパイル使用メモリ | 89,064 KB |
| 実行使用メモリ | 66,140 KB |
| 最終ジャッジ日時 | 2023-09-19 05:07:06 |
| 合計ジャッジ時間 | 4,323 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge13 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 49 ms
27,952 KB |
| testcase_01 | AC | 478 ms
57,984 KB |
| testcase_02 | AC | 153 ms
36,312 KB |
| testcase_03 | AC | 62 ms
26,012 KB |
| testcase_04 | AC | 64 ms
26,052 KB |
| testcase_05 | AC | 51 ms
26,076 KB |
| testcase_06 | AC | 36 ms
25,960 KB |
| testcase_07 | AC | 53 ms
33,496 KB |
| testcase_08 | AC | 45 ms
25,980 KB |
| testcase_09 | AC | 523 ms
66,140 KB |
| testcase_10 | AC | 12 ms
25,544 KB |
| testcase_11 | AC | 13 ms
29,016 KB |
| testcase_12 | AC | 13 ms
27,616 KB |
| testcase_13 | AC | 16 ms
29,988 KB |
| testcase_14 | AC | 15 ms
27,960 KB |
| testcase_15 | AC | 16 ms
28,036 KB |
| testcase_16 | AC | 13 ms
25,680 KB |
| testcase_17 | AC | 14 ms
28,892 KB |
| testcase_18 | AC | 13 ms
27,768 KB |
| testcase_19 | AC | 13 ms
30,896 KB |
| testcase_20 | AC | 14 ms
28,892 KB |
| testcase_21 | AC | 13 ms
25,632 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 19 SEP 2023 05:07:01 AM): ; processing (SB-INT:DEFCONSTANT-EQX OPT ...) ; processing (SET-DISPATCH-MACRO-CHARACTER #\# ...) ; processing (DISABLE-DEBUGGER) ; processing (DECLAIM (INLINE OP)) ; processing (DEFUN OP ...) ; processing (DEFCONSTANT +OP-IDENTITY+ ...) ; processing (DECLAIM (INLINE UPDATER-OP)) ; processing (DEFUN UPDATER-OP ...) ; processing (DEFCONSTANT +UPDATER-IDENTITY+ ...) ; processing (DECLAIM (INLINE MODIFIER-OP)) ; processing (DEFUN MODIFIER-OP ...) ; processing (DEFSTRUCT (TREAP # ...) ...) ; processing (DECLAIM (INLINE TREAP-COUNT)) ; processing (DEFUN TREAP-COUNT ...) ; processing (DECLAIM (INLINE TREAP-ACCUMULATOR)) ; processing (DEFUN TREAP-ACCUMULATOR ...) ; processing (DECLAIM (INLINE UPDATE-COUNT)) ; processing (DEFUN UPDATE-COUNT ...) ; processing (DECLAIM (INLINE UPDATE-ACCUMULATOR)) ; processing (DEFUN UPDATE-ACCUMULATOR ...) ; file: /home/judge/data/code/Main.lisp ; in: DEFUN UPDATE-ACCUMULATOR ; (OP (%TREAP-ACCUMULATOR (%TREAP-LEFT TREAP)) (%TREAP-VALUE TREAP)) ; --> BLOCK ; ==> ; (MIN X Y) ; ; note: could not stack allocate SB-C::MINREST in: ; (OP (%TREAP-ACCUMULATOR (%TREAP-LEFT TREAP)) (%TREAP-VALUE TREAP)) ; ; note: could not stack allocate #:ARG03 in: ; (OP (%TREAP-ACCUMULATOR (%TREAP-LEFT TREAP)) (%TREAP-VALUE TREAP)) ; processing (DECLAIM (INLINE FORCE-UP)) ; processing (DEFUN FORCE-UP ...) ; file: /home/judge/data/code/Main.lisp ; in: DEFUN FORCE-UP ; (UPDATE-ACCUMULATOR TREAP) ; --> BLOCK SETF LET SB-KERNEL:THE* IF IF LET OP BLOCK ; ==> ; (MIN X Y) ; ; note: could not stack allocate SB-C::MINREST in: (UPDATE-ACCUMULATOR TREAP) ; ; note: could not stack allocate #:ARG03 in: (UPDATE-ACCUMULATOR TREAP) ; processing (DECLAIM (INLINE FORCE-DOWN)) ; processing (DEFUN FORCE-DOWN ...) ; processing (DEFUN TREAP-FIND ...) ; processing (DEFUN TREAP-BISECT-RIGHT-1 ...) ; processing (DEFUN TREAP-BISECT-LEFT ...) ; processing (DECLAIM (FTYPE # ..
ソースコード
;; -*- coding: utf-8 -*-
(eval-when (:compile-toplevel :load-toplevel :execute)
(sb-int:defconstant-eqx OPT
#+swank '(optimize (speed 3) (safety 2))
#-swank '(optimize (speed 3) (safety 0) (debug 0))
#'equal)
#+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)
#-swank (set-dispatch-macro-character
#\# #\> (lambda (s c p) (declare (ignore c p)) (read s nil nil t))))
#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)
#-swank (disable-debugger) ; for CS Academy
;; BEGIN_INSERTED_CONTENTS
;;;
;;; Treap with explicit key
;;; Virtually it works like std::map, std::multiset, or java.util.TreeMap.
;;;
;; Tips to use this structure as multiset: Just define OP as (defun op (x y) (+
;; x y)) and insert each element by (treap-ensure-key <treap> <key> 1 :if-exists
;; #'1+) instead of TREAP-INSERT.
(declaim (inline op))
(defun op (x y)
"Is the operator comprising a monoid"
(min x y))
(defconstant +op-identity+ most-positive-fixnum
"identity element w.r.t. OP")
(declaim (inline updater-op))
(defun updater-op (a b)
"Is the operator to compute and update LAZY value."
(+ a b))
(defconstant +updater-identity+ 0
"identity element w.r.t. UPDATER-OP")
(declaim (inline modifier-op))
(defun modifier-op (a b size)
"Is the operator to update ACCUMULATOR based on LAZY value."
(declare (ignore size))
(+ a b))
;; Treap with explicit key
(defstruct (treap (:constructor %make-treap (key priority value &key left right (accumulator value) lazy (count 1)))
(:copier nil)
(:conc-name %treap-))
(key 0 :type fixnum)
(value +op-identity+ :type fixnum)
(accumulator +op-identity+ :type fixnum)
(lazy +updater-identity+ :type fixnum)
(priority 0 :type (integer 0 #.most-positive-fixnum))
(count 0 :type (integer 0 #.most-positive-fixnum))
(left nil :type (or null treap))
(right nil :type (or null treap)))
(declaim (inline treap-count))
(defun treap-count (treap)
"Returns the size of the (nullable) TREAP."
(declare ((or null treap) treap))
(if (null treap)
0
(%treap-count treap)))
(declaim (inline treap-accumulator))
(defun treap-accumulator (treap)
(declare ((or null treap) treap))
(if (null treap)
+op-identity+
(%treap-accumulator treap)))
(declaim (inline update-count))
(defun update-count (treap)
(declare (treap treap))
(setf (%treap-count treap)
(+ 1
(treap-count (%treap-left treap))
(treap-count (%treap-right treap)))))
(declaim (inline update-accumulator))
(defun update-accumulator (treap)
(declare (treap treap))
(setf (%treap-accumulator treap)
(if (%treap-left treap)
(if (%treap-right treap)
(let ((mid-res (op (%treap-accumulator (%treap-left treap))
(%treap-value treap))))
(declare (dynamic-extent mid-res))
(op mid-res (%treap-accumulator (%treap-right treap))))
(op (%treap-accumulator (%treap-left treap))
(%treap-value treap)))
(if (%treap-right treap)
(op (%treap-value treap)
(%treap-accumulator (%treap-right treap)))
(%treap-value treap)))))
(declaim (inline force-up))
(defun force-up (treap)
"Propagates up the information from children."
(declare (treap treap))
(update-count treap)
(update-accumulator treap))
(declaim (inline force-down))
(defun force-down (treap)
"Propagates down the information to children."
(declare (treap treap))
(unless (eql +updater-identity+ (%treap-lazy treap))
(when (%treap-left treap)
(setf (%treap-lazy (%treap-left treap))
(updater-op (%treap-lazy (%treap-left treap))
(%treap-lazy treap)))
(setf (%treap-accumulator (%treap-left treap))
(modifier-op (%treap-accumulator (%treap-left treap))
(%treap-lazy treap)
(%treap-count (%treap-left treap)))))
(when (%treap-right treap)
(setf (%treap-lazy (%treap-right treap))
(updater-op (%treap-lazy (%treap-right treap))
(%treap-lazy treap)))
(setf (%treap-accumulator (%treap-right treap))
(modifier-op (%treap-accumulator (%treap-right treap))
(%treap-lazy treap)
(%treap-count (%treap-right treap)))))
(setf (%treap-value treap)
(modifier-op (%treap-value treap)
(%treap-lazy treap)
1))
(setf (%treap-lazy treap) +updater-identity+)))
(defun treap-find (treap key &key (order #'<))
"Finds the key that satisfies (and (not (funcall order key (%treap-key
sub-treap))) (not (funcall order (%treap-key sub-treap) key))) and returns KEY
and the assigned value. Returns NIL if KEY is not contained."
(declare (function order)
((or null treap) treap))
(cond ((null treap) (values nil nil))
((funcall order key (%treap-key treap))
(treap-find (%treap-left treap) key :order order))
((funcall order (%treap-key treap) key)
(treap-find (%treap-right treap) key :order order))
(t (values key (%treap-value treap)))))
(defun treap-bisect-right-1 (treap key &key (order #'<))
"Returns the largest key equal to or smaller than KEY and the assigned
value. Returns NIL if KEY is smaller than any keys in TREAP."
(declare ((or null treap) treap)
(function order))
(labels ((recur (treap)
(unless treap (return-from recur nil))
(force-down treap)
(if (funcall order key (%treap-key treap))
(recur (%treap-left treap))
(or (recur (%treap-right treap))
treap))))
(let ((result (recur treap)))
(if result
(values (%treap-key result) (%treap-value result))
(values nil nil)))))
(defun treap-bisect-left (treap key &key (order #'<))
"Returns the smallest key equal to or larger than KEY and the assigned
value. Returns NIL if KEY is larger than any keys in TREAP."
(declare ((or null treap) treap)
(function order))
(labels ((recur (treap)
(unless treap (return-from recur nil))
(force-down treap)
(if (funcall order (%treap-key treap) key)
(recur (%treap-right treap))
(or (recur (%treap-left treap))
treap))))
(let ((result (recur treap)))
(if result
(values (%treap-key result) (%treap-value result))
(values nil nil)))))
(declaim (ftype (function * (values (or null treap) (or null treap) &optional)) treap-split))
(defun treap-split (treap key &key (order #'<))
"Destructively splits the TREAP with reference to KEY and returns two treaps,
the smaller sub-treap (< KEY) and the larger one (>= KEY)."
(declare (function order)
((or null treap) treap))
(if (null treap)
(values nil nil)
(progn
(force-down treap)
(if (funcall order (%treap-key treap) key)
(multiple-value-bind (left right)
(treap-split (%treap-right treap) key :order order)
(setf (%treap-right treap) left)
(force-up treap)
(values treap right))
(multiple-value-bind (left right)
(treap-split (%treap-left treap) key :order order)
(setf (%treap-left treap) right)
(force-up treap)
(values left treap))))))
(declaim (inline treap-insert))
(defun treap-insert (treap key value &key (order #'<))
"Destructively inserts KEY into TREAP and returns the resultant treap. You
cannot rely on the side effect. Use the returned value.
The behavior is undefined when duplicate keys are inserted."
(declare ((or null treap) treap)
(function order))
(labels ((recur (node treap)
(declare (treap node))
(unless treap (return-from recur node))
(force-down treap)
(if (> (%treap-priority node) (%treap-priority treap))
(progn
(setf (values (%treap-left node) (%treap-right node))
(treap-split treap (%treap-key node) :order order))
(force-up node)
node)
(progn
(if (funcall order (%treap-key node) (%treap-key treap))
(setf (%treap-left treap)
(recur node (%treap-left treap)))
(setf (%treap-right treap)
(recur node (%treap-right treap))))
(force-up treap)
treap))))
(recur (%make-treap key (random most-positive-fixnum) value) treap)))
(declaim (inline treap-ensure-key))
(defun treap-ensure-key (treap key value &key (order #'<) if-exists)
"IF-EXISTS := nil | function
Ensures that TREAP contains KEY and assigns VALUE to it if IF-EXISTS is
false. If IF-EXISTS is function and TREAP already contains KEY, TREAP-ENSURE-KEY
updates the value by the function instead of overwriting it with VALUE."
(declare (function order)
((or null treap) treap))
(labels ((find-and-update (treap)
;; Updates the value slot and returns T if KEY exists
(unless treap (return-from find-and-update nil))
(force-down treap)
(cond ((funcall order key (%treap-key treap))
(when (find-and-update (%treap-left treap))
(force-up treap)
t))
((funcall order (%treap-key treap) key)
(when (find-and-update (%treap-right treap))
(force-up treap)
t))
(t (setf (%treap-value treap)
(if if-exists
(funcall if-exists (%treap-value treap))
value))
(force-up treap)
t))))
(if (find-and-update treap)
treap
(treap-insert treap key value :order order))))
(defun treap-merge (left right)
"Destructively concatenates two treaps. Assumes that all keys of LEFT are
smaller (or larger, depending on the order) than those of RIGHT."
(declare (optimize (speed 3))
((or null treap) left right))
(cond ((null left) (when right (force-down right) (force-up right)) right)
((null right) (when left (force-down left) (force-up left)) left)
(t (force-down left)
(force-down right)
(if (> (%treap-priority left) (%treap-priority right))
(progn
(setf (%treap-right left)
(treap-merge (%treap-right left) right))
(force-up left)
left)
(progn
(setf (%treap-left right)
(treap-merge left (%treap-left right)))
(force-up right)
right)))))
(defun treap-delete (treap key &key (order #'<))
"Destructively deletes the KEY in TREAP and returns the resultant
treap. Returns the unmodified TREAP If KEY doesn't exist. You cannot rely on the
side effect. Use the returned value.
(Note that this function deletes at most one node even if duplicated keys
exist.)"
(declare ((or null treap) treap)
(function order))
(when treap
(force-down treap)
(cond ((funcall order key (%treap-key treap))
(setf (%treap-left treap)
(treap-delete (%treap-left treap) key :order order))
(force-up treap)
treap)
((funcall order (%treap-key treap) key)
(setf (%treap-right treap)
(treap-delete (%treap-right treap) key :order order))
(force-up treap)
treap)
(t
(treap-merge (%treap-left treap) (%treap-right treap))))))
(declaim (inline treap-map))
(defun treap-map (function treap)
"Successively applies FUNCTION to TREAP[0], ..., TREAP[SIZE-1]. FUNCTION must
take two arguments: KEY and VALUE."
(labels ((recur (treap)
(when treap
(force-down treap)
(recur (%treap-left treap))
(funcall function (%treap-key treap) (%treap-value treap))
(recur (%treap-right treap))
(force-up treap))))
(recur treap)))
(defmethod print-object ((object treap) stream)
(print-unreadable-object (object stream :type t)
(let ((init t))
(treap-map (lambda (key value)
(if init
(setf init nil)
(write-char #\ stream))
(format stream "<~A . ~A>" key value))
object))))
(defmacro do-treap ((key-var value-var treap &optional result) &body body)
"Successively binds the key and value of INODE[0], ..., INODE[SIZE-1] to
KEY-VAR and VALUE-VAR and executes BODY."
`(block nil
(treap-map (lambda (,key-var ,value-var) ,@body) ,treap)
,result))
;; Reference: https://cp-algorithms.com/data_structures/treap.html
;; TODO: take a sorted list as the argument
(declaim (inline make-treap))
(defun make-treap (sorted-vector)
"Makes a treap using each key of the given SORTED-VECTOR in O(n). Note that
this function doesn't check if the SORTED-VECTOR is actually sorted w.r.t. your
intended order. The values are filled with the identity element."
(declare (vector sorted-vector))
(labels ((heapify (top)
(when top
(let ((prioritized-node top))
(when (and (%treap-left top)
(> (%treap-priority (%treap-left top))
(%treap-priority prioritized-node)))
(setq prioritized-node (%treap-left top)))
(when (and (%treap-right top)
(> (%treap-priority (%treap-right top))
(%treap-priority prioritized-node)))
(setq prioritized-node (%treap-right top)))
(unless (eql prioritized-node top)
(rotatef (%treap-priority prioritized-node)
(%treap-priority top))
(heapify prioritized-node)))))
(build (l r)
(declare ((integer 0 #.most-positive-fixnum) l r))
(if (= l r)
nil
(let* ((mid (ash (+ l r) -1))
(node (%make-treap (aref sorted-vector mid)
(random most-positive-fixnum)
+op-identity+)))
(setf (%treap-left node) (build l mid))
(setf (%treap-right node) (build (+ mid 1) r))
(heapify node)
(update-count node)
node))))
(build 0 (length sorted-vector))))
(define-condition invalid-treap-index-error (type-error)
((treap :initarg :treap :reader invalid-treap-index-error-treap)
(index :initarg :index :reader invalid-treap-index-error-index))
(:report
(lambda (condition stream)
(format stream "Invalid index ~W for treap ~S."
(invalid-treap-index-error-index condition)
(invalid-treap-index-error-treap condition)))))
(defun treap-ref (treap index)
"Returns the key and value corresponding to the INDEX."
(declare (optimize (speed 3))
((or null treap) treap)
((integer 0 #.most-positive-fixnum) index))
(when (>= index (treap-count treap))
(error 'invalid-treap-index-error :treap treap :index index))
(labels ((%ref (treap index)
(declare (optimize (safety 0))
(treap treap)
((integer 0 #.most-positive-fixnum) index))
(force-down treap)
(prog1
(let ((left-count (treap-count (%treap-left treap))))
(cond ((< index left-count)
(%ref (%treap-left treap) index))
((> index left-count)
(%ref (%treap-right treap) (- index left-count 1)))
(t (values (%treap-key treap) (%treap-value treap)))))
(force-up treap))))
(%ref treap index)))
;; FIXME: might be problematic when two priorities collide.
(declaim (inline treap-query))
(defun treap-query (treap &key left right (order #'<))
"Queries the sum of the half-open interval specified by the keys: [LEFT,
RIGHT). If LEFT [RIGHT] is not given, it is assumed to be -inf [+inf]."
(if (null left)
(if (null right)
(treap-accumulator treap)
(multiple-value-bind (treap-0-r treap-r-n)
(treap-split treap right :order order)
(prog1 (treap-accumulator treap-0-r)
(treap-merge treap-0-r treap-r-n))))
(if (null right)
(multiple-value-bind (treap-0-l treap-l-n)
(treap-split treap left :order order)
(prog1 (treap-accumulator treap-l-n)
(treap-merge treap-0-l treap-l-n)))
(progn
(assert (not (funcall order right left)))
(multiple-value-bind (treap-0-l treap-l-n)
(treap-split treap left :order order)
(multiple-value-bind (treap-l-r treap-r-n)
(treap-split treap-l-n right :order order)
(prog1 (treap-accumulator treap-l-r)
(treap-merge treap-0-l (treap-merge treap-l-r treap-r-n)))))))))
(declaim (inline treap-update))
(defun treap-update (treap x left right &key (order #'<))
"Updates TREAP[KEY] := (OP TREAP[KEY] X) for all KEY in [l, r)"
(assert (not (funcall order left right)))
(multiple-value-bind (treap-0-l treap-l-n)
(treap-split treap left :order order)
(multiple-value-bind (treap-l-r treap-r-n)
(treap-split treap-l-n right :order order)
(when treap-l-r
(setf (%treap-lazy treap-l-r)
(updater-op (%treap-lazy treap-l-r) x)))
(treap-merge treap-0-l (treap-merge treap-l-r treap-r-n)))))
;; Should we do this with UNWIND-PROTECT?
(defmacro with-buffered-stdout (&body body)
"Buffers all outputs to *STANDARD-OUTPUT* in BODY and flushes them to
*STANDARD-OUTPUT* after BODY has been done (without error). Note that only
BASE-CHAR is allowed."
(let ((out (gensym)))
`(let ((,out (make-string-output-stream :element-type 'base-char)))
(let ((*standard-output* ,out))
,@body)
(write-string (get-output-stream-string ,out)))))
(declaim (ftype (function * (values fixnum &optional)) read-fixnum))
(defun read-fixnum (&optional (in *standard-input*))
(declare #.OPT)
(macrolet ((%read-byte ()
`(the (unsigned-byte 8)
#+swank (char-code (read-char in nil #\Nul))
#-swank (sb-impl::ansi-stream-read-byte in nil #.(char-code #\Nul) nil))))
(let* ((minus nil)
(result (loop (let ((byte (%read-byte)))
(cond ((<= 48 byte 57)
(return (- byte 48)))
((zerop byte) ; #\Nul
(error "Read EOF or #\Nul."))
((= byte #.(char-code #\-))
(setf minus t)))))))
(declare ((integer 0 #.most-positive-fixnum) result))
(loop
(let* ((byte (%read-byte)))
(if (<= 48 byte 57)
(setq result (+ (- byte 48)
(* 10 (the (integer 0 #.(floor most-positive-fixnum 10)) result))))
(return (if minus (- result) result))))))))
(defmacro dbg (&rest forms)
#+swank
(if (= (length forms) 1)
`(format *error-output* "~A => ~A~%" ',(car forms) ,(car forms))
`(format *error-output* "~A => ~A~%" ',forms `(,,@forms)))
#-swank (declare (ignore forms)))
(defmacro define-int-types (&rest bits)
`(progn
,@(mapcar (lambda (b) `(deftype ,(intern (format nil "UINT~A" b)) () '(unsigned-byte ,b))) bits)
,@(mapcar (lambda (b) `(deftype ,(intern (format nil "INT~A" b)) () '(signed-byte ,b))) bits)))
(define-int-types 2 4 7 8 15 16 31 32 62 63 64)
(declaim (inline println))
(defun println (obj &optional (stream *standard-output*))
(let ((*read-default-float-format* 'double-float))
(prog1 (princ obj stream) (terpri stream))))
(defconstant +mod+ 1000000007)
;;;
;;; Body
;;;
(defun main ()
(declare #.OPT)
(let* ((n (read))
treap
(sum 0))
(declare (uint62 n sum))
(dotimes (i n)
(let ((a (read-fixnum)))
(incf sum a)
(setq treap (treap-ensure-key treap a 1 :if-exists #'1+))))
(let ((q (read)))
(declare (uint32 q))
(with-buffered-stdout
(dotimes (i q)
(let ((x (read-fixnum)))
(multiple-value-bind (left right) (treap-split treap x)
(setq treap left)
(do-treap (key count right)
(declare (uint31 key count))
(let ((new-key (mod key x)))
(declare (uint31 new-key))
(setq treap (treap-ensure-key treap new-key count :if-exists (lambda (i) (+ i count))))
(decf sum (* count (- key new-key)))))
(println sum))))))))
#-swank (main)
;;;
;;; Test and benchmark
;;;
#+swank
(defun io-equal (in-string out-string &key (function #'main) (test #'equal))
"Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if
the string output to *STANDARD-OUTPUT* is equal to OUT-STRING."
(labels ((ensure-last-lf (s)
(if (eql (uiop:last-char s) #\Linefeed)
s
(uiop:strcat s uiop:+lf+))))
(funcall test
(ensure-last-lf out-string)
(with-output-to-string (out)
(let ((*standard-output* out))
(with-input-from-string (*standard-input* (ensure-last-lf in-string))
(funcall function)))))))
#+swank
(defun get-clipbrd ()
(with-output-to-string (out)
(run-program "C:/msys64/usr/bin/cat.exe" '("/dev/clipboard") :output out)))
#+swank (defparameter *this-pathname* (uiop:current-lisp-file-pathname))
#+swank (defparameter *dat-pathname* (uiop:merge-pathnames* "test.dat" *this-pathname*))
#+swank
(defun run (&optional thing (out *standard-output*))
"THING := null | string | symbol | pathname
null: run #'MAIN using the text on clipboard as input.
string: run #'MAIN using the string as input.
symbol: alias of FIVEAM:RUN!.
pathname: run #'MAIN using the text file as input."
(let ((*standard-output* out))
(etypecase thing
(null
(with-input-from-string (*standard-input* (delete #\Return (get-clipbrd)))
(main)))
(string
(with-input-from-string (*standard-input* (delete #\Return thing))
(main)))
(symbol (5am:run! thing))
(pathname
(with-open-file (*standard-input* thing)
(main))))))
#+swank
(defun gen-dat ()
(uiop:with-output-file (out *dat-pathname* :if-exists :supersede)
(format out "")))
#+swank
(defun bench (&optional (out (make-broadcast-stream)))
(time (run *dat-pathname* out)))