結果

問題 No.3 ビットすごろく
ユーザー sansaquasansaqua
提出日時 2020-03-22 07:32:42
言語 Common Lisp
(sbcl 2.3.8)
結果
AC  
実行時間 10 ms / 5,000 ms
コード長 5,647 bytes
コンパイル時間 89 ms
コンパイル使用メモリ 42,000 KB
実行使用メモリ 29,656 KB
最終ジャッジ日時 2023-09-14 01:39:24
合計ジャッジ時間 1,714 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
27,772 KB
testcase_01 AC 10 ms
25,652 KB
testcase_02 AC 10 ms
29,656 KB
testcase_03 AC 9 ms
23,624 KB
testcase_04 AC 9 ms
25,616 KB
testcase_05 AC 10 ms
27,712 KB
testcase_06 AC 9 ms
23,640 KB
testcase_07 AC 9 ms
23,700 KB
testcase_08 AC 9 ms
23,680 KB
testcase_09 AC 8 ms
23,672 KB
testcase_10 AC 9 ms
25,784 KB
testcase_11 AC 10 ms
25,688 KB
testcase_12 AC 10 ms
23,724 KB
testcase_13 AC 10 ms
27,668 KB
testcase_14 AC 9 ms
23,632 KB
testcase_15 AC 10 ms
23,832 KB
testcase_16 AC 10 ms
25,784 KB
testcase_17 AC 10 ms
25,772 KB
testcase_18 AC 10 ms
25,736 KB
testcase_19 AC 10 ms
23,808 KB
testcase_20 AC 9 ms
23,696 KB
testcase_21 AC 9 ms
23,524 KB
testcase_22 AC 10 ms
27,800 KB
testcase_23 AC 9 ms
23,644 KB
testcase_24 AC 10 ms
25,896 KB
testcase_25 AC 10 ms
23,824 KB
testcase_26 AC 10 ms
27,708 KB
testcase_27 AC 10 ms
23,744 KB
testcase_28 AC 10 ms
27,836 KB
testcase_29 AC 9 ms
23,716 KB
testcase_30 AC 10 ms
27,664 KB
testcase_31 AC 10 ms
25,676 KB
testcase_32 AC 9 ms
23,716 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 14 SEP 2023 01:39:21 AM):
; processing (SB-INT:DEFCONSTANT-EQX OPT ...)
; processing (SET-DISPATCH-MACRO-CHARACTER #\# ...)
; processing (DISABLE-DEBUGGER)
; processing (DEFSTRUCT (QUEUE #) ...)
; processing (DECLAIM (INLINE ENQUEUE))
; processing (DEFUN ENQUEUE ...)
; processing (DECLAIM (INLINE DEQUEUE))
; processing (DEFUN DEQUEUE ...)
; processing (DECLAIM (INLINE QUEUE-EMPTY-P))
; processing (DEFUN QUEUE-EMPTY-P ...)
; processing (DECLAIM (INLINE QUEUE-PEEK))
; processing (DEFUN QUEUE-PEEK ...)
; processing (DECLAIM (INLINE ENQUEUE-FRONT))
; processing (DEFUN ENQUEUE-FRONT ...)
; processing (DEFMACRO DBG ...)
; processing (DEFMACRO DEFINE-INT-TYPES ...)
; processing (DEFINE-INT-TYPES 2 ...)
; processing (DECLAIM (INLINE PRINTLN))
; processing (DEFUN PRINTLN ...)
; processing (DEFCONSTANT +MOD+ ...)
; processing (DEFCONSTANT +INF+ ...)
; processing (DEFUN MAIN ...)
; processing (MAIN)

; wrote /home/judge/data/code/Main.fasl
; compilation finished in 0:00:00.026

ソースコード

diff # 

(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
           ;; enclose the form with VALUES to avoid being captured by LOOP macro
           #\# #\> (lambda (s c p) (declare (ignore c p)) `(values ,(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
;;;
;;; Queue with singly linked list
;;;

(defstruct (queue (:constructor make-queue
                      (&optional list &aux (tail (last list)))))
  (list nil :type list)
  (tail nil :type list))

(declaim (inline enqueue))
(defun enqueue (obj queue)
  "Pushes OBJ to the end of QUEUE."
  (symbol-macrolet ((list (queue-list queue))
                    (tail (queue-tail queue)))
    (if (null list)
        (setf tail (list obj)
              list tail)
        (setf (cdr tail) (list obj)
              tail (cdr tail))))
  queue)

(declaim (inline dequeue))
(defun dequeue (queue)
  "Removes and returns the element at the front of QUEUE. Returns NIL if QUEUE
is empty."
  (pop (queue-list queue)))

(declaim (inline queue-empty-p))
(defun queue-empty-p (queue)
  (null (queue-list queue)))

(declaim (inline queue-peek))
(defun queue-peek (queue)
  (car (queue-list queue)))

(declaim (inline enqueue-front))
(defun enqueue-front (obj queue)
  "Pushes OBJ to the front of QUEUE."
  (symbol-macrolet ((list (queue-list queue))
                    (tail (queue-tail queue)))
    (if (null list)
        (setf tail (list obj)
              list tail)
        (push obj list))
    queue))

(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
;;;

(defconstant +inf+ #xffffffff)
(defun main ()
  (declare #.OPT)
  (let* ((n (read))
         (dists (make-array (+ n 1) :element-type 'uint32 :initial-element +inf+))
         (que (make-queue)))
    (declare (uint32 n))
    (setf (aref dists 1) 1)
    (enqueue 1 que)
    (loop until (queue-empty-p que)
          for v of-type uint32 = (dequeue que)
          for delta = (logcount v)
          when (and (<= (+ v delta) n)
                    (= (aref dists (+ v delta)) +inf+))
          do (setf (aref dists (+ v delta)) (+ (aref dists v) 1))
             (enqueue (+ v delta) que)
          when (and (>= (- v delta) 1)
                    (= (aref dists (- v delta)) +inf+))
          do (setf (aref dists (- v delta)) (+ (aref dists v) 1))
             (enqueue (- v delta) que))
    (println
     (if (= (aref dists n) +inf+)
         -1
         (aref dists n)))))

#-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 "powershell.exe" '("-Command" "Get-Clipboard") :output out :search t)))

#+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)))

;; To run: (5am:run! :sample)
#+swank
(it.bese.fiveam:test :sample
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "5
"
    "4
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "11
"
    "9
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "4
"
    "-1
")))
0