結果
| 問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
| ユーザー |
 sansaqua
|
| 提出日時 | 2021-01-22 23:45:07 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
AC
|
| 実行時間 | 537 ms / 2,000 ms |
| コード長 | 14,736 bytes |
| コンパイル時間 | 513 ms |
| コンパイル使用メモリ | 96,140 KB |
| 実行使用メモリ | 85,596 KB |
| 最終ジャッジ日時 | 2024-06-08 19:01:19 |
| 合計ジャッジ時間 | 16,251 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 10 ms
27,428 KB |
| testcase_01 | AC | 11 ms
27,180 KB |
| testcase_02 | AC | 11 ms
27,436 KB |
| testcase_03 | AC | 10 ms
27,176 KB |
| testcase_04 | AC | 11 ms
29,132 KB |
| testcase_05 | AC | 11 ms
27,176 KB |
| testcase_06 | AC | 12 ms
29,388 KB |
| testcase_07 | AC | 10 ms
27,304 KB |
| testcase_08 | AC | 11 ms
27,564 KB |
| testcase_09 | AC | 11 ms
29,644 KB |
| testcase_10 | AC | 13 ms
31,652 KB |
| testcase_11 | AC | 11 ms
29,520 KB |
| testcase_12 | AC | 12 ms
31,804 KB |
| testcase_13 | AC | 12 ms
27,564 KB |
| testcase_14 | AC | 12 ms
31,544 KB |
| testcase_15 | AC | 13 ms
27,816 KB |
| testcase_16 | AC | 12 ms
27,820 KB |
| testcase_17 | AC | 12 ms
27,564 KB |
| testcase_18 | AC | 31 ms
32,028 KB |
| testcase_19 | AC | 19 ms
29,856 KB |
| testcase_20 | AC | 31 ms
31,800 KB |
| testcase_21 | AC | 21 ms
30,048 KB |
| testcase_22 | AC | 25 ms
29,844 KB |
| testcase_23 | AC | 31 ms
31,904 KB |
| testcase_24 | AC | 32 ms
32,016 KB |
| testcase_25 | AC | 32 ms
31,888 KB |
| testcase_26 | AC | 35 ms
35,984 KB |
| testcase_27 | AC | 24 ms
29,752 KB |
| testcase_28 | AC | 210 ms
54,500 KB |
| testcase_29 | AC | 172 ms
49,140 KB |
| testcase_30 | AC | 145 ms
42,236 KB |
| testcase_31 | AC | 187 ms
48,384 KB |
| testcase_32 | AC | 245 ms
64,384 KB |
| testcase_33 | AC | 141 ms
46,284 KB |
| testcase_34 | AC | 254 ms
64,132 KB |
| testcase_35 | AC | 252 ms
51,160 KB |
| testcase_36 | AC | 398 ms
67,408 KB |
| testcase_37 | AC | 109 ms
50,384 KB |
| testcase_38 | AC | 182 ms
44,160 KB |
| testcase_39 | AC | 116 ms
42,128 KB |
| testcase_40 | AC | 157 ms
46,992 KB |
| testcase_41 | AC | 229 ms
54,444 KB |
| testcase_42 | AC | 338 ms
61,052 KB |
| testcase_43 | AC | 213 ms
48,512 KB |
| testcase_44 | AC | 255 ms
52,492 KB |
| testcase_45 | AC | 199 ms
46,452 KB |
| testcase_46 | AC | 235 ms
64,720 KB |
| testcase_47 | AC | 138 ms
50,372 KB |
| testcase_48 | AC | 430 ms
85,596 KB |
| testcase_49 | AC | 374 ms
81,672 KB |
| testcase_50 | AC | 441 ms
83,688 KB |
| testcase_51 | AC | 402 ms
81,668 KB |
| testcase_52 | AC | 390 ms
85,592 KB |
| testcase_53 | AC | 510 ms
81,676 KB |
| testcase_54 | AC | 497 ms
81,548 KB |
| testcase_55 | AC | 537 ms
83,696 KB |
| testcase_56 | AC | 508 ms
81,548 KB |
| testcase_57 | AC | 386 ms
81,548 KB |
| testcase_58 | AC | 99 ms
46,400 KB |
| testcase_59 | AC | 97 ms
42,356 KB |
| testcase_60 | AC | 94 ms
42,356 KB |
| testcase_61 | AC | 97 ms
42,360 KB |
| testcase_62 | AC | 95 ms
42,360 KB |
| testcase_63 | AC | 80 ms
44,268 KB |
| testcase_64 | AC | 82 ms
46,276 KB |
| testcase_65 | AC | 80 ms
42,228 KB |
| testcase_66 | AC | 80 ms
42,356 KB |
| testcase_67 | AC | 81 ms
42,356 KB |
| testcase_68 | AC | 11 ms
27,304 KB |
| testcase_69 | AC | 10 ms
27,308 KB |
| testcase_70 | AC | 10 ms
27,308 KB |
| testcase_71 | AC | 11 ms
29,260 KB |
| testcase_72 | AC | 11 ms
27,304 KB |
| testcase_73 | AC | 10 ms
27,304 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 08 JUN 2024 07:01:02 PM): ; file: /home/judge/data/code/Main.lisp ; in: DEFUN MAIN ; (MULTIPLE-VALUE-BIND (Y REM) ; (FLOOR RES X) ; (WHEN (AND (ZEROP REM) (GETHASH Y TABLE2)) ; (LOOP NAMED OUTER ; FOR A ACROSS AS ; DO (LOOP FOR B ACROSS BS ; WHEN (= # X) ; DO (FORMAT T "~D ~D " A B) (RETURN-FROM OUTER))) ; (LOOP FOR C ACROSS CS ; DO (LOOP FOR D ACROSS DS ; WHEN (= # Y) ; DO (FORMAT T "~D ~D~%" C D) (RETURN-FROM MAIN))))) ; ; note: doing signed word to integer coercion (cost 20) to Y ; ; compilation unit finished ; printed 1 note ; wrote /home/judge/data/code/Main.fasl ; compilation finished in 0:00:00.285
ソースコード
(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 (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
;;;
(defun sort< (as)
(declare #.*opt*
(inline sort)
((simple-array int32 (*)) as))
(sort as #'<))
(defun sort> (as)
(declare #.*opt*
(inline sort)
((simple-array int32 (*)) as))
(sort as #'>))
(defun solve (as bs s)
(declare #.*opt*
((simple-array int32 (*)) as bs))
(let* ((n (length as))
(m (length bs))
(as+ (make-array n :fill-pointer 0 :element-type 'int32))
(as- (make-array n :fill-pointer 0 :element-type 'int32))
(bs+ (make-array m :fill-pointer 0 :element-type 'int32))
(bs- (make-array m :fill-pointer 0 :element-type 'int32)))
(declare (uint31 n m))
(dotimes (i n)
(let ((a (aref as i)))
(assert (vector-push a (if (>= a 0) as+ as-)))))
(dotimes (i m)
(let ((b (aref bs i)))
(assert (vector-push b (if (>= b 0) bs+ bs-)))))
(let* ((as+< (sort< (coerce as+ '(simple-array int32 (*)))))
(as+> (sort> (coerce as+ '(simple-array int32 (*)))))
(as-< (sort< (coerce as- '(simple-array int32 (*)))))
(as-> (sort> (coerce as- '(simple-array int32 (*)))))
(bs+< (sort< (coerce bs+ '(simple-array int32 (*)))))
(bs+> (sort> (coerce bs+ '(simple-array int32 (*)))))
(bs-< (sort< (coerce bs- '(simple-array int32 (*)))))
(bs-> (sort> (coerce bs- '(simple-array int32 (*))))))
(declare ((simple-array int32 (*))
as+< as+> as-< as->
bs+< bs+> bs-< bs->))
(labels ((calc-count (threshold)
(declare (fixnum threshold))
(let ((res 0))
(declare (uint62 res))
(when (>= threshold 0)
(let ((end 0))
(sb-int:dovector (a as+>)
(loop until (or (= end (length bs+<))
(< threshold (* a (aref bs+< end))))
do (incf end)
finally (incf res end)))))
(if (>= threshold 0)
(incf res (the uint62 (* (length as+<) (length bs-<))))
(let ((end 0))
(sb-int:dovector (a as+<)
(loop until (or (= end (length bs-<))
(< threshold (* a (aref bs-< end))))
do (incf end)
finally (incf res end)))))
(if (>= threshold 0)
(incf res (the uint62 (* (length as-<) (length bs+<))))
(let ((end 0))
(sb-int:dovector (a as->)
(loop until (or (= end (length bs+>))
(< threshold (* a (aref bs+> end))))
do (incf end)
finally (incf res end)))))
(when (>= threshold 0)
(let ((end 0))
(sb-int:dovector (a as-<)
(loop until (or (= end (length bs->))
(< threshold (* a (aref bs-> end))))
do (incf end)
finally (incf res end)))))
;; (loop for a across as
;; for b across bs
;; when (<= (* a b)))
;; (sb-int:dovector (a as)
;; (when (<= (* a a) threshold)
;; (decf res)))
;; (setq res (ash res -1))
res)))
(sb-int:named-let bisect ((ng #.(- (expt 10 18))) (ok #.(expt 10 18)))
(declare (fixnum ng ok))
(if (<= (- ok ng) 1)
ok
(let ((mid (floor (+ ng ok) 2)))
(if (>= (calc-count mid) s)
(bisect ng mid)
(bisect mid ok)))))))))
(defun main ()
(declare #.*opt*)
(let* ((k (read))
(l (read))
(m (read))
(n (read))
(s (read))
(as (make-array k :element-type 'int32 :initial-element 0))
(bs (make-array l :element-type 'int32 :initial-element 0))
(cs (make-array m :element-type 'int32 :initial-element 0))
(ds (make-array n :element-type 'int32 :initial-element 0))
(vec1 (make-array (* k l) :element-type 'int32 :initial-element 0))
(vec2 (make-array (* m n) :element-type 'int32 :initial-element 0))
(table2 (make-hash-table :test #'eq)))
(declare (uint31 k l m n)
(uint62 s))
(dotimes (i k)
(setf (aref as i) (read-fixnum)))
(dotimes (i l)
(setf (aref bs i) (read-fixnum)))
(dotimes (i m)
(setf (aref cs i) (read-fixnum)))
(dotimes (i n)
(setf (aref ds i) (read-fixnum)))
(dotimes (i k)
(dotimes (j l)
(setf (aref vec1 (+ (* i l) j))
(* (aref as i) (aref bs j)))))
(dotimes (i m)
(dotimes (j n)
(setf (aref vec2 (+ (* i n) j))
(* (aref cs i) (aref ds j)))))
(let* ((res (solve vec1 vec2 s)))
(declare (fixnum res))
(sb-int:dovector (x vec2)
(setf (gethash x table2) t))
(println res)
(if (zerop res)
(multiple-value-bind (x1 x2 x3 x4)
(cond ((find 0 as) (values 0 (aref bs 0) (aref cs 0) (aref ds 0)))
((find 0 bs) (values (aref as 0) 0 (aref cs 0) (aref ds 0)))
((find 0 cs) (values (aref as 0) (aref bs 0) 0 (aref ds 0)))
((find 0 ds) (values (aref as 0) (aref bs 0) (aref cs 0) 0))
(t (error "Huh?")))
(format t "~D ~D ~D ~D~%" x1 x2 x3 x4))
(loop for x across vec1
unless (zerop x)
do (multiple-value-bind (y rem) (floor res x)
(when (and (zerop rem) (gethash y table2))
(loop named outer
for a across as
do (loop for b across bs
when (= (* a b) x)
do (format t "~D ~D " a b)
(return-from outer)))
(loop for c across cs
do (loop for d across ds
when (= (* c d) y)
do (format t "~D ~D~%" c d)
(return-from main))))))))))
#-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/1361"))
#+swank
(defun gen-dat ()
(uiop:with-output-file (out *dat-pathname* :if-exists :supersede)
(format out "600 599 598 597 ~D~%" 1)
(dotimes (_ 4)
(dolist (len '(600 599 598 597))
(dotimes (_ len)
(println (- (random 60000) 30000) 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 "36
-1 2 -3 6
"
(run "1 1 2 3 4
-1
2
-3 4
-5 6 -7
" nil)))
(5am:is
(equal "1
1 1 1 1
"
(run "1 2 3 4 12
1
1 1
1 1 1
1 1 1 1
" nil)))
(5am:is
(equal "288
2 3 6 8
"
(run "8 8 8 8 2000
3 1 4 1 5 9 2 6
5 3 5 8 9 7 9 3
2 3 8 4 6 2 6 4
3 3 8 3 2 7 9 5
" nil))))