結果
| 問題 | No.1438 Broken Drawers |
| ユーザー |
 sansaqua
|
| 提出日時 | 2021-03-26 21:36:24 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
AC
|
| 実行時間 | 37 ms / 2,000 ms |
| コード長 | 8,438 bytes |
| コンパイル時間 | 836 ms |
| コンパイル使用メモリ | 41,848 KB |
| 実行使用メモリ | 30,444 KB |
| 最終ジャッジ日時 | 2023-08-19 07:41:21 |
| 合計ジャッジ時間 | 3,120 ms |
|
ジャッジサーバーID （参考情報） |
judge10 / judge9 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 9 ms
24,000 KB |
| testcase_01 | AC | 10 ms
27,736 KB |
| testcase_02 | AC | 9 ms
25,828 KB |
| testcase_03 | AC | 9 ms
27,848 KB |
| testcase_04 | AC | 10 ms
27,828 KB |
| testcase_05 | AC | 8 ms
23,700 KB |
| testcase_06 | AC | 33 ms
26,840 KB |
| testcase_07 | AC | 33 ms
28,644 KB |
| testcase_08 | AC | 10 ms
27,772 KB |
| testcase_09 | AC | 9 ms
26,036 KB |
| testcase_10 | AC | 9 ms
27,844 KB |
| testcase_11 | AC | 9 ms
23,932 KB |
| testcase_12 | AC | 18 ms
27,820 KB |
| testcase_13 | AC | 24 ms
24,328 KB |
| testcase_14 | AC | 15 ms
24,240 KB |
| testcase_15 | AC | 34 ms
30,248 KB |
| testcase_16 | AC | 34 ms
30,300 KB |
| testcase_17 | AC | 35 ms
26,640 KB |
| testcase_18 | AC | 35 ms
26,756 KB |
| testcase_19 | AC | 37 ms
30,244 KB |
| testcase_20 | AC | 36 ms
30,220 KB |
| testcase_21 | AC | 34 ms
28,772 KB |
| testcase_22 | AC | 35 ms
28,768 KB |
| testcase_23 | AC | 36 ms
26,652 KB |
| testcase_24 | AC | 36 ms
30,444 KB |
| testcase_25 | AC | 36 ms
26,620 KB |
| testcase_26 | AC | 36 ms
30,224 KB |
| testcase_27 | AC | 36 ms
26,648 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 19 AUG 2023 07:41:17 AM): ; processing (IN-PACKAGE :CL-USER) ; processing (DEFPARAMETER *OPT* ...) ; processing (SET-DISPATCH-MACRO-CHARACTER #\# ...) ; processing (DOLIST (F #) ...) ; processing (SETQ *RANDOM-STATE* ...) ; processing (DEFINE-INT-TYPES 2 ...) ; processing (DEFCONSTANT +MOD+ ...) ; processing (DEFMACRO DBG ...) ; processing (DECLAIM (INLINE PRINTLN)) ; processing (DEFUN PRINTLN ...) ; processing (DEFPACKAGE :CP/READ-FIXNUM ...) ; processing (IN-PACKAGE :CP/READ-FIXNUM) ; processing (DECLAIM (FTYPE # ...)) ; processing (DEFUN READ-FIXNUM ...) ; processing (DEFPACKAGE :CP/BISECT ...) ; processing (IN-PACKAGE :CP/BISECT) ; processing (DECLAIM (INLINE BISECT-LEFT)) ; processing (DEFUN BISECT-LEFT ...) ; processing (DECLAIM (INLINE BISECT-RIGHT)) ; processing (DEFUN BISECT-RIGHT ...) ; processing (USE-PACKAGE :CP/BISECT ...) ; processing (USE-PACKAGE :CP/READ-FIXNUM ...) ; processing (IN-PACKAGE :CL-USER) ; processing (DEFCONSTANT +INF+ ...) ; processing (DEFUN MAIN ...) ; processing (MAIN) ; wrote /home/judge/data/code/Main.fasl ; compilation finished in 0:00:00.173
ソースコード
(in-package :cl-user)
(eval-when (:compile-toplevel :load-toplevel :execute)
(defparameter *opt*
#+swank '(optimize (speed 3) (safety 2))
#-swank '(optimize (speed 3) (safety 0) (debug 0)))
#+swank (ql:quickload '(:cl-debug-print :fiveam :cp/util) :silent t)
#+swank (use-package :cp/util :cl-user)
#-swank (set-dispatch-macro-character
#\# #\> (lambda (s c p) (declare (ignore c p)) `(values ,(read s nil nil t))))
#+sbcl (dolist (f '(:popcnt :sse4)) (pushnew f sb-c:*backend-subfeatures*))
#+sbcl (setq *random-state* (seed-random-state (nth-value 1 (get-time-of-day)))))
#-swank (eval-when (:compile-toplevel)
(setq *break-on-signals* '(and warning (not style-warning))))
#+swank (set-dispatch-macro-character #\# #\> #'cl-debug-print:debug-print-reader)
(macrolet ((def (b)
`(progn (deftype ,(intern (format nil "UINT~A" b)) () '(unsigned-byte ,b))
(deftype ,(intern (format nil "INT~A" b)) () '(signed-byte ,b))))
(define-int-types (&rest bits) `(progn ,@(mapcar (lambda (b) `(def ,b)) bits))))
(define-int-types 2 4 7 8 15 16 31 32 62 63 64))
(defconstant +mod+ 1000000007)
(defmacro dbg (&rest forms)
(declare (ignorable forms))
#+swank (if (= (length forms) 1)
`(format *error-output* "~A => ~A~%" ',(car forms) ,(car forms))
`(format *error-output* "~A => ~A~%" ',forms `(,,@forms))))
(declaim (inline println))
(defun println (obj &optional (stream *standard-output*))
(let ((*read-default-float-format*
(if (typep obj 'double-float) 'double-float *read-default-float-format*)))
(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))))))))
(defpackage :cp/bisect
(:use :cl)
(:export #:bisect-left #:bisect-right))
(in-package :cp/bisect)
(declaim (inline bisect-left))
(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))
"TARGET := vector | function (taking an integer argument)
ORDER := strict order
Analogue of lower_bound() of C++ or bisect_left() of Python: Returns the
smallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the
complement of ORDER. In other words, this function returns the leftmost index at
which VALUE can be inserted with keeping the order. Therefore, TARGET must be
monotonically non-decreasing with respect to ORDER.
- This function returns END if VALUE exceeds TARGET[END-1].
- The range [START, END) is half-open.
- END must be explicitly specified if TARGET is function.
- KEY is applied to each element of TARGET before comparison."
(declare (integer start)
((or null integer) end))
(macrolet
((frob (accessor &optional declaration)
`(labels
((%bisect-left (ng ok)
;; TARGET[OK] >= VALUE always holds (assuming
;; TARGET[END] = +infinity)
,@(when declaration (list declaration))
(if (<= (- ok ng) 1)
ok
(let ((mid (ash (+ ng ok) -1)))
(if (funcall order (funcall key (,accessor target mid)) value)
(%bisect-left mid ok)
(%bisect-left ng mid))))))
(assert (<= start end))
(%bisect-left (- start 1) end))))
(etypecase target
(vector
(let ((end (or end (length target))))
(frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))
(function
(assert end () "Requires END argument if TARGET is a function.")
(frob funcall)))))
(declaim (inline bisect-right))
(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))
"TARGET := vector | function (taking an integer argument)
ORDER := strict order
Analogue of upper_bound() of C++ or bisect_right() of Python: Returns the
smallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,
this function returns the rightmost index at which VALUE can be inserted with
keeping the order. Therefore, TARGET must be monotonically non-decreasing with
respect to ORDER.
- This function returns END if VALUE >= TARGET[END-1].
- The range [START, END) is half-open.
- END must be explicitly specified if TARGET is function.
- KEY is applied to each element of TARGET before comparison."
(declare (integer start)
((or null integer) end))
(macrolet
((frob (accessor &optional declaration)
`(labels
((%bisect-right (ng ok)
;; TARGET[OK] > VALUE always holds (assuming
;; TARGET[END] = +infinity)
,@(when declaration (list declaration))
(if (<= (- ok ng) 1)
ok
(let ((mid (ash (+ ng ok) -1)))
(if (funcall order value (funcall key (,accessor target mid)))
(%bisect-right ng mid)
(%bisect-right mid ok))))))
(assert (<= start end))
(%bisect-right (- start 1) end))))
(etypecase target
(vector
(let ((end (or end (length target))))
(frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))
(function
(assert end () "Requires END argument if TARGET is a function.")
(frob funcall)))))
;; BEGIN_USE_PACKAGE
(eval-when (:compile-toplevel :load-toplevel :execute)
(use-package :cp/bisect :cl-user))
(eval-when (:compile-toplevel :load-toplevel :execute)
(use-package :cp/read-fixnum :cl-user))
(in-package :cl-user)
;;;
;;; Body
;;;
(defconstant +inf+ #x7fffffff)
(defun main ()
(let* ((n (read))
(poses (make-array n :element-type 'uint31 :initial-element 0))
(marked (make-array (+ n 1) :element-type 'bit :initial-element 0))
(res 0))
(dotimes (i n)
(let ((a (- (read-fixnum) 1)))
(setf (aref poses a) i)))
(dotimes (a n)
(let ((pos (aref poses a)))
(unless (= 1 (aref marked (+ pos 1)))
(incf res)
(setf (aref marked pos) 1))))
(println res)))
#-swank (main)
;;;
;;; Test
;;;
#+swank
(progn
(defparameter *lisp-file-pathname* (uiop:current-lisp-file-pathname))
(setq *default-pathname-defaults* (uiop:pathname-directory-pathname *lisp-file-pathname*))
(uiop:chdir *default-pathname-defaults*)
(defparameter *dat-pathname* (uiop:merge-pathnames* "test.dat" *lisp-file-pathname*))
(defparameter *problem-url* "https://yukicoder.me/problems/no/1438"))
#+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)))
#+(and sbcl (not swank))
(eval-when (:compile-toplevel)
(when sb-c::*undefined-warnings*
(error "undefined warnings: ~{~A~^ ~}" sb-c::*undefined-warnings*)))
;; To run: (5am:run! :sample)
#+swank
(5am:test :sample
(5am:is
(equal "4
"
(run "5
2 3 4 1 5
" nil)))
(5am:is
(equal "5
"
(run "8
4 3 5 1 7 6 2 8
" nil)))
(5am:is
(equal "8
"
(run "15
12 5 15 3 11 8 14 13 6 10 9 7 4 2 1
" nil))))