結果

問題 No.1449 新プロランド
ユーザー linuxmetel
提出日時 2021-03-31 09:49:14
言語 Common Lisp
(sbcl 2.5.0)
結果
AC  
実行時間 76 ms / 2,000 ms
コード長 4,904 bytes
コンパイル時間 1,530 ms
コンパイル使用メモリ 37,504 KB
実行使用メモリ 31,488 KB
最終ジャッジ日時 2024-12-24 01:42:15
合計ジャッジ時間 3,423 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 26
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 24 DEC 2024 01:42:11 AM):

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

ソースコード

diff # 

; inf, -inf です (おそらく実装依存で SBCL では動く)
(defconstant  inf #.DOUBLE-FLOAT-POSITIVE-INFINITY)
(defconstant -inf #.DOUBLE-FLOAT-NEGATIVE-INFINITY)

(defmacro swap (p q)       
  (let ((g (gensym)))
    `(let ((,g ,q)) (setf ,q ,p ,p ,g))))
 
(defun max-fun (f x y)
  (if (funcall f x y)
      x
      y))
 
(defclass binary-heap ()
  ((vec :accessor .binary-heap-vec
        :initform (make-array 8192 :initial-element nil)
        :initarg :vec)
   (emp :accessor .binary-heap-emp
        :initform 0
        :initarg :emp)
   (cap :accessor .binary-heap-cap
        :initform 8192
        :initarg :cap)
   (fun :accessor .binary-heap-fun
        :initform #'>
        :initarg :fun)))
 
(declaim (inline left))
(defun left (i)
  (+ (* i 2) 1))
 
(declaim (inline right))
(defun right (i)
  (+ (* i 2) 2))
 
(declaim (inline pare))
(defun pare (i)
  (floor (1- i) 2))
 
(defun make-binary-heap (&key (cap 8192) (fun #'>))
  (make-instance 'binary-heap :cap cap :fun fun
                 :vec (make-array cap :initial-element nil)))
 
(defun binary-heap-push (heap x)
  (let* ((vec (.binary-heap-vec heap))
         (emp (.binary-heap-emp heap))
         (i emp)
         (fun (.binary-heap-fun heap)))
    (setf (aref vec emp) x)
    (loop until (= i 0)
          while (funcall fun (aref vec i) (aref vec (pare i)))
          do (swap (aref vec i) (aref vec (pare i)))
             (setq i (pare i)))
    (setf (.binary-heap-emp heap) (1+ emp))
    x))
 
(defun binary-heap-pop (heap)
  (if (= (.binary-heap-emp heap) 0)
      nil
      (let* ((vec (.binary-heap-vec heap))
             (ret (aref vec 0))
             (emp (setf (.binary-heap-emp heap) (1- (.binary-heap-emp heap))))
             (fun (.binary-heap-fun heap))
             (i 0))
        (setf (aref vec 0) (aref vec emp) (aref vec emp) nil)
        (loop until (>= (right i) emp)
              while (funcall fun (max-fun fun
                                          (aref vec (left i))
                                          (aref vec (right i)))
                             (aref vec i))
              do (if (funcall fun (aref vec (left i)) (aref vec (right i)))
                     (progn (swap (aref vec (left i)) (aref vec i))
                            (setq i (left i)))
                     (progn (swap (aref vec (right i)) (aref vec i))
                            (setq i (right i)))))
        (when (and (= (left i) (- emp 1))
                   (funcall fun (aref vec (left i)) (aref vec i)))
          (swap (aref vec (left i)) (aref vec i)))
        ret)))
 
(defun binary-heap-most (heap)
  (aref (.binary-heap-vec heap) 0))
 
(defun binary-heap-empty (heap)
  (equal (.binary-heap-emp heap) 0))
 
; graph グラフ
; time 各頂点での時間
; start 最初の地点
(defun dijkstra (graph time start)
  (let* (; (list 最短時間 (min 1001 食べた量) 頂点番号)
         (que (make-binary-heap :cap 32768 :fun #'(lambda (p q) (< (car p) (car q))))) ; 優先度付きキュー
         
         ; start からの各頂点までの最短時間 (inf に初期化)
         ; (aref d 頂点番号 食べた時間)
         (d (make-array (list (1+ (length graph)) 1005) :initial-element inf)))
    (setf (aref d start 0) 0) ; d の最初の頂点 を 初期化
    (binary-heap-push que (list 0 0 start)) ; start をキューに追加
    (loop :with p = nil
          :until (binary-heap-empty que)
          :do (setq p (binary-heap-pop que))
          :unless (< (aref d (third p) (second p)) (first p))
          :do (destructuring-bind (a b c) p
                (loop :for e :in (aref graph c)
                      :do (destructuring-bind (to . cost) e
                            (let* ((speed (min 1001 (+ b (aref time c))))
                                   (time1 (+ a (floor cost speed) (aref time c))))
                              (when (> (aref d to speed) time1)
                                (setf (aref d to speed) time1)
                                (binary-heap-push que (list time1 speed to))))))))
    d))


; read してグローバル変数を定義します
; (def-read! *a* *b* *c*)
; (defvar *a* (read)) (defvar *b* (read)) (defvar *c* (read))
(defmacro def-read! (&rest args)
    `(progn
       ,@(loop :for i :in args
               :collect `(defvar ,i (read)))))

(def-read! *n* *m*)

(defparameter *g* (make-array *n* :initial-element '()))

(loop :repeat *m*
      :do (let ((a (1- (read)))
                (b (1- (read)))
                (c (read)))
            (push (cons a c) (aref *g* b))
            (push (cons b c) (aref *g* a))))

(defparameter *t* (concatenate 'vector (loop :repeat *n*
                                             :collect (read))))

(format t "~a~%" (let ((d (dijkstra *g* *t* 0)))
                   (loop :for i :below 1005
                         :minimize (aref d (1- *n*) i)
                         )))
0