結果

問題 No.1 道のショートカット
コンテスト
ユーザー sansaqua
提出日時 2019-09-18 04:50:31
言語 Common Lisp
(sbcl 2.5.0)
結果
AC  
実行時間 9 ms / 5,000 ms
コード長 3,903 bytes
コンパイル時間 170 ms
コンパイル使用メモリ 59,648 KB
実行使用メモリ 22,784 KB
最終ジャッジ日時 2024-07-20 16:42:05
合計ジャッジ時間 1,461 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 40
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 20 JUL 2024 04:42:03 PM):

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

ソースコード

diff # 

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

(defconstant +inf+ #xffffffff)
(define-modify-macro minf (new-value) min)

(defun main ()
  (declare #.OPT)
  (let* ((n (read))
         (c (read))
         (v (read))
         (revgraph (make-array n :element-type 'list :initial-element nil))
         (ss (make-array v :element-type 'uint32))
         (ts (make-array v :element-type 'uint32))
         (ys (make-array v :element-type 'uint32))
         (ms (make-array v :element-type 'uint32))
         (dp (make-array '(50 301) :element-type 'uint32 :initial-element +inf+)))
    (declare (uint16 n c v))
    (dotimes (i v) (setf (aref ss i) (- (read-fixnum) 1)))
    (dotimes (i v) (setf (aref ts i) (- (read-fixnum) 1)))
    (dotimes (i v) (setf (aref ys i) (read-fixnum)))
    (dotimes (i v) (setf (aref ms i) (read-fixnum)))
    (dotimes (i v)
      (push (list* (aref ss i) (aref ys i) (aref ms i)) (aref revgraph (aref ts i))))
    (dotimes (cost (+ c 1))
      (setf (aref dp 0 cost) 0))
    (dotimes (v n)
      (let ((base (array-row-major-index dp v 0)))
        (dolist (edge (aref revgraph v))
          (destructuring-bind (prev yen . minute) edge
            (declare (uint32 prev yen minute))
            (loop for cost from yen to c
                  do (minf (row-major-aref dp (+ base cost))
                           (+ minute (aref dp prev (- cost yen)))))))))
    (println (if (= +inf+ (aref dp (- n 1) c))
                 -1
                 (aref dp (- n 1) c)))))

#-swank (main)
0