結果

問題 No.2803 Bocching Star
ユーザー Lisp_Coder
提出日時 2024-07-21 01:11:03
言語 Common Lisp
(sbcl 2.5.0)
結果
RE  
実行時間 -
コード長 1,659 bytes
コンパイル時間 214 ms
コンパイル使用メモリ 30,080 KB
実行使用メモリ 28,288 KB
最終ジャッジ日時 2024-07-21 01:11:06
合計ジャッジ時間 2,906 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample RE * 3
other RE * 35
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 21 JUL 2024 01:11:03 AM):

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

ソースコード

diff # 

#-swank
(unless (member :child-sbcl *features*)
  (quit
   :recklessly-p t
   :unix-status
   (process-exit-code
    (run-program *runtime-pathname*
                 `("--control-stack-size" "1024MB"
                   "--noinform" "--disable-ldb" "--lose-on-corruption" "--end-runtime-options"
                   "--eval" "(push :child-sbcl *features*)"
                   "--script" ,(namestring *load-pathname*))
                 :output t :error t :input t))))

(defun read-integers ()
  (with-open-file (stream *standard-input* :direction :input :external-format :utf-8)
    (loop for num = (read stream nil)
          while num
          collect num)))

(defun write-result (count result)
  (with-open-file (stream *standard-output* :direction :output :external-format :utf-8)
    (format stream "~d~%" count)
    (loop for x in result do (format stream "~d " x))
    (format stream "~%")))

(defun main ()
  (let* ((data (read-integers))
         (N (first data))
         (S (second data))
         (P (subseq data 2 (+ 2 N)))
         (indexed-P (loop for i from 0 below N collect (cons (nth i P) (1+ i))))
         (sorted-P (sort indexed-P #'< :key #'car))
         (result '()))
    (loop for i from 0 below N
          for (value . index) = (nth i sorted-P)
          for left-diff = (if (> i 0) (- value (car (nth (1- i) sorted-P))) most-positive-fixnum)
          for right-diff = (if (< i (1- N)) (- (car (nth (1+ i) sorted-P)) value) most-positive-fixnum)
          for near = (min left-diff right-diff)
          when (> near S) do (push index result))
    (setf result (sort result #'<))
    (write-result (length result) result)))

(main)
0