結果

問題 No.1211 円環はお断り
ユーザー sansaquasansaqua
提出日時 2020-08-30 14:57:30
言語 Common Lisp
(sbcl 2.3.8)
結果
WA  
実行時間 -
コード長 6,432 bytes
コンパイル時間 1,513 ms
コンパイル使用メモリ 49,948 KB
実行使用メモリ 135,240 KB
最終ジャッジ日時 2024-11-15 08:16:09
合計ジャッジ時間 30,136 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
29,008 KB
testcase_01 AC 11 ms
26,792 KB
testcase_02 AC 11 ms
31,008 KB
testcase_03 AC 10 ms
26,792 KB
testcase_04 AC 11 ms
26,916 KB
testcase_05 AC 11 ms
33,040 KB
testcase_06 AC 11 ms
30,908 KB
testcase_07 WA -
testcase_08 AC 10 ms
30,912 KB
testcase_09 AC 12 ms
27,304 KB
testcase_10 WA -
testcase_11 AC 11 ms
29,264 KB
testcase_12 AC 10 ms
29,008 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 AC 1,030 ms
115,992 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 175 ms
85,452 KB
testcase_22 AC 819 ms
107,804 KB
testcase_23 AC 930 ms
109,868 KB
testcase_24 AC 524 ms
101,920 KB
testcase_25 WA -
testcase_26 AC 1,080 ms
124,204 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 AC 1,356 ms
135,240 KB
testcase_33 AC 1,605 ms
128,376 KB
testcase_34 AC 1,562 ms
130,408 KB
testcase_35 WA -
testcase_36 AC 1,515 ms
128,160 KB
testcase_37 AC 1,590 ms
130,320 KB
testcase_38 AC 1,395 ms
128,288 KB
testcase_39 AC 1,394 ms
130,324 KB
testcase_40 AC 1,343 ms
128,288 KB
testcase_41 AC 10 ms
26,920 KB
testcase_42 AC 10 ms
26,792 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 15 NOV 2024 08:15:39 AM):

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

ソースコード

diff #

(in-package :cl-user)
(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)) `(values ,(read s nil nil t)))))
#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)

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

(defconstant +mod+ 1000000007)

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

(declaim (inline println))
(defun println (obj &optional (stream *standard-output*))
  (let ((*read-default-float-format* 'double-float))
    (prog1 (princ obj stream) (terpri stream))))

;; BEGIN_INSERTED_CONTENTS
(defpackage :cp/read-fixnum
  (:use :cl)
  (:export #:read-fixnum))
(in-package :cp/read-fixnum)

(declaim (ftype (function * (values fixnum &optional)) read-fixnum))
(defun read-fixnum (&optional (in *standard-input*))
  "NOTE: cannot read -2^62"
  (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 #\-))
                                  (setq 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))))))))

;; BEGIN_USE_PACKAGE
(eval-when (:compile-toplevel :load-toplevel :execute)
  (use-package :cp/read-fixnum :cl-user))
(in-package :cl-user)

;;;
;;; Body
;;;

(defconstant +max-depth+ 18)

(defun feasible-p (n k cumuls threshold)
  (declare (uint31 n k)
           ((simple-array uint62 (*)) cumuls)
           (uint62 threshold))
  (let ((dp (make-array (list +max-depth+ n) :element-type 'uint62 :initial-element 0))
        (dest 0))
    (dotimes (src n)
      (loop while (< (- (aref cumuls dest) (aref cumuls src)) threshold)
            do (incf dest))
      (setf (aref dp 0 src) (- dest src)))
    (loop for depth from 1 below +max-depth+
          do (dotimes (i n)
               (let ((prev-delta (aref dp (- depth 1) i)))
                 (setf (aref dp depth i)
                       (+ prev-delta
                          (+ (aref dp (- depth 1) (mod (+ i prev-delta) n))))))))
    (dotimes (init n)
      (let ((count 0)
            (sum 0))
        (declare (uint62 count sum))
        (loop for depth from (- +max-depth+ 1) downto 0
              for delta = (ash 1 depth)
              when (<= (+ count delta) k)
              do (incf sum (aref dp depth (mod sum n)))
                 (incf count delta)
              while (< sum n))
        (dbg init count sum)
        (when (<= sum n)
          (return-from feasible-p t))))
    nil))

(defun main ()
  (let* ((n (read))
         (k (read))
         (as (make-array n :element-type 'uint31 :initial-element 0))
         (cumuls (make-array (+ 1 (* 2 n)) :element-type 'uint62 :initial-element 0)))
    (dotimes (i n)
      (let ((a (read-fixnum)))
        (setf (aref as i) a
              (aref cumuls (+ i 1)) a
              (aref cumuls (+ i n 1)) a)))
    (dotimes (i (* 2 n))
      (incf (aref cumuls (+ i 1)) (aref cumuls i)))
    (sb-int:named-let bisect ((ok 0) (ng (+ 1 (aref cumuls n))))
      (if (<= (- ng ok) 1)
          (println ok)
          (let ((mid (ash (+ ok ng) -1)))
            (if (feasible-p n k cumuls mid)
                (bisect mid ng)
                (bisect ok mid)))))))

#-swank (main)

;;;
;;; Test and benchmark
;;;

#+swank
(defun get-clipbrd ()
  (with-output-to-string (out)
    #+os-windows (run-program "powershell.exe" '("-Command" "Get-Clipboard") :output out :search t)
    #+os-unix (run-program "xsel" '("-b" "-o") :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* (or out (make-string-output-stream)))
         (res (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))))))
    (if out res (get-output-stream-string *standard-output*))))

#+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
   (equal "4
"
          (run "6 4
8 6 9 1 2 1
" nil)))
  (it.bese.fiveam:is
   (equal "15
"
          (run "15 7
12 9 11 15 15 11 9 7 2 3 1 14 15 6 11
" nil))))
0