結果

問題 No.2811 Calculation Within Sequence
ユーザー Lisp_Coder
提出日時 2024-07-19 22:31:35
言語 Common Lisp
(sbcl 2.5.0)
結果
WA  
実行時間 -
コード長 1,295 bytes
コンパイル時間 871 ms
コンパイル使用メモリ 29,312 KB
実行使用メモリ 46,464 KB
最終ジャッジ日時 2024-07-19 22:31:44
合計ジャッジ時間 7,991 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1 WA * 2
other TLE * 2 -- * 39
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 19 JUL 2024 10:31:36 PM):

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

ソースコード

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 parse-input ()
  (let* ((a (read))
         (b (read))
         (seq-T (make-array a :initial-element 0))
         (seq-S (make-array b :initial-element 0)))
    (dotimes (i a) (setf (aref seq-T i) (read)))
    (dotimes (i b) (setf (aref seq-S i) (read)))
    (values seq-T seq-S)))
(defun can-make-equal (seq-T seq-S)
  (let ((T-sum (reduce #'+ seq-T))
        (S-sum (reduce #'+ seq-S))
        (T-set (remove-duplicates (sort (copy-seq seq-T) #'<)))
        (S-set (remove-duplicates (sort (copy-seq seq-S) #'<))))
    (cond ((= T-sum S-sum)
           (if (every #'(lambda (x) (member x T-set)) S-set)
               (format t "Yes~%")
               (format t "No~%")))
          (t (format t "No~%")))))
(defun main ()
  (multiple-value-bind (seq-T seq-S) (parse-input)
    (can-make-equal seq-T seq-S)))
(main)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0