結果
問題 | No.1580 I like Logarithm! |
ユーザー | sansaqua |
提出日時 | 2021-07-02 21:52:21 |
言語 | Common Lisp (sbcl 2.3.8) |
結果 |
AC
|
実行時間 | 31 ms / 2,000 ms |
コード長 | 6,925 bytes |
コンパイル時間 | 899 ms |
コンパイル使用メモリ | 53,252 KB |
実行使用メモリ | 30,116 KB |
最終ジャッジ日時 | 2023-09-11 21:43:55 |
合計ジャッジ時間 | 3,467 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 10 ms
23,680 KB |
testcase_01 | AC | 10 ms
23,500 KB |
testcase_02 | AC | 9 ms
23,552 KB |
testcase_03 | AC | 10 ms
23,596 KB |
testcase_04 | AC | 10 ms
27,600 KB |
testcase_05 | AC | 10 ms
27,596 KB |
testcase_06 | AC | 20 ms
30,044 KB |
testcase_07 | AC | 30 ms
28,268 KB |
testcase_08 | AC | 10 ms
25,660 KB |
testcase_09 | AC | 11 ms
23,820 KB |
testcase_10 | AC | 13 ms
25,968 KB |
testcase_11 | AC | 22 ms
28,252 KB |
testcase_12 | AC | 23 ms
26,232 KB |
testcase_13 | AC | 21 ms
28,328 KB |
testcase_14 | AC | 29 ms
28,188 KB |
testcase_15 | AC | 27 ms
30,100 KB |
testcase_16 | AC | 9 ms
23,532 KB |
testcase_17 | AC | 10 ms
23,588 KB |
testcase_18 | AC | 10 ms
23,600 KB |
testcase_19 | AC | 9 ms
23,516 KB |
testcase_20 | AC | 11 ms
27,660 KB |
testcase_21 | AC | 10 ms
23,604 KB |
testcase_22 | AC | 10 ms
23,520 KB |
testcase_23 | AC | 9 ms
23,524 KB |
testcase_24 | AC | 9 ms
23,504 KB |
testcase_25 | AC | 10 ms
23,524 KB |
testcase_26 | AC | 29 ms
26,316 KB |
testcase_27 | AC | 31 ms
30,116 KB |
testcase_28 | AC | 30 ms
28,248 KB |
testcase_29 | AC | 29 ms
26,252 KB |
testcase_30 | AC | 29 ms
26,152 KB |
testcase_31 | AC | 30 ms
30,016 KB |
testcase_32 | AC | 30 ms
28,180 KB |
testcase_33 | AC | 30 ms
26,296 KB |
testcase_34 | AC | 30 ms
30,020 KB |
testcase_35 | AC | 30 ms
26,156 KB |
testcase_36 | AC | 30 ms
26,144 KB |
testcase_37 | AC | 30 ms
26,212 KB |
testcase_38 | AC | 29 ms
26,256 KB |
testcase_39 | AC | 31 ms
28,180 KB |
testcase_40 | AC | 31 ms
26,312 KB |
testcase_41 | AC | 30 ms
26,292 KB |
testcase_42 | AC | 30 ms
26,244 KB |
testcase_43 | AC | 30 ms
30,016 KB |
testcase_44 | AC | 29 ms
26,144 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 11 SEP 2023 09:43:51 PM): ; 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/MOD-OPERATIONS ...) ; processing (IN-PACKAGE :CP/MOD-OPERATIONS) ; processing (DEFVAR *MODULUS* ...) ; processing (DECLAIM (# *MODULUS*) ...) ; processing (DEFMACRO DEFINE-MOD-OPERATIONS ...) ; processing (DEFINE-MOD-OPERATIONS COMMON-LISP-USER::+MOD+ ...) ; processing (DEFPACKAGE :CP/GEOMETRIC-SEQUENCE ...) ; processing (IN-PACKAGE :CP/GEOMETRIC-SEQUENCE) ; processing (DECLAIM (INLINE MAKE-GEOMETRIC-SEQUENCE)) ; processing (DEFUN MAKE-GEOMETRIC-SEQUENCE ...) ; processing (USE-PACKAGE :CP/GEOMETRIC-SEQUENCE ...) ; processing (USE-PACKAGE :CP/MOD-OPERATIONS ...) ; processing (IN-PACKAGE :CL-USER) ; processing (DEFUN MAIN ...) ; processing (MAIN) ; wrote /home/judge/data/code/Main.fasl ; compilation finished in 0:00:00.176
ソースコード
(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*)) (setq *random-state* (make-random-state t))) #-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/mod-operations (:use :cl) (:export #:define-mod-operations #:*modulus*) (:documentation "Provides modular arithmetic.")) (in-package :cp/mod-operations) (eval-when (:compile-toplevel :load-toplevel :execute) (defvar *modulus* 0)) (declaim ((unsigned-byte 31) *modulus*) #+sbcl (sb-ext:always-bound *modulus*)) (defmacro define-mod-operations (divisor &optional (package #+sbcl (sb-int:sane-package) #-sbcl *package*)) (let ((mod* (intern "MOD*" package)) (mod+ (intern "MOD+" package)) (mod- (intern "MOD-" package)) (incfmod (intern "INCFMOD" package)) (decfmod (intern "DECFMOD" package)) (mulfmod (intern "MULFMOD" package))) `(progn (defun ,mod* (&rest args) (cond ((cdr args) (reduce (lambda (x y) (mod (* x y) ,divisor)) args)) (args (mod (car args) ,divisor)) (t (mod 1 ,divisor)))) (defun ,mod+ (&rest args) (cond ((cdr args) (reduce (lambda (x y) (mod (+ x y) ,divisor)) args)) (args (mod (car args) ,divisor)) (t 0))) (defun ,mod- (&rest args) (if (cdr args) (reduce (lambda (x y) (mod (- x y) ,divisor)) args) (mod (- (car args)) ,divisor))) #+sbcl (eval-when (:compile-toplevel :load-toplevel :execute) (locally (declare (sb-ext:muffle-conditions warning)) (sb-c:define-source-transform ,mod* (&rest args) (case (length args) (0 `(mod 1 ,',divisor)) (1 `(mod ,(car args) ,',divisor)) (otherwise (reduce (lambda (x y) `(mod (* ,x ,y) ,',divisor)) args)))) (sb-c:define-source-transform ,mod+ (&rest args) (case (length args) (0 0) (1 `(mod ,(car args) ,',divisor)) (otherwise (reduce (lambda (x y) `(mod (+ ,x ,y) ,',divisor)) args)))) (sb-c:define-source-transform ,mod- (&rest args) (case (length args) (0 (values nil t)) (1 `(mod (- ,(car args)) ,',divisor)) (otherwise (reduce (lambda (x y) `(mod (- ,x ,y) ,',divisor)) args)))))) (define-modify-macro ,incfmod (delta) (lambda (x y) (mod (+ x y) ,divisor))) (define-modify-macro ,decfmod (delta) (lambda (x y) (mod (- x y) ,divisor))) (define-modify-macro ,mulfmod (multiplier) (lambda (x y) (mod (* x y) ,divisor)))))) (define-mod-operations cl-user::+mod+ :cl-user) (defpackage :cp/geometric-sequence (:use :cl) (:export #:make-geometric-sequence)) (in-package :cp/geometric-sequence) (declaim (inline make-geometric-sequence)) (defun make-geometric-sequence (rate length modulus &key (scale 1) (element-type '(unsigned-byte 31))) "Returns a vector of the given length: VECTOR[x] := SCALE * (RATE^x) mod MODULUS." (declare (fixnum rate scale) ((mod #.array-dimension-limit) length) ((integer 1 #.most-positive-fixnum) modulus)) (let ((result (make-array length :element-type element-type))) (unless (zerop length) (setf (aref result 0) (mod scale modulus)) (loop for i from 1 below length do (setf (aref result i) (mod (* rate (aref result (- i 1))) modulus)))) result)) ;; BEGIN_USE_PACKAGE (eval-when (:compile-toplevel :load-toplevel :execute) (use-package :cp/geometric-sequence :cl-user)) (eval-when (:compile-toplevel :load-toplevel :execute) (use-package :cp/mod-operations :cl-user)) (in-package :cl-user) ;;; ;;; Body ;;; (defun main () (let* ((a (read)) (b (map '(simple-array uint8 (*)) #'digit-char-p (read-line))) (n (length b)) (res 0) (powers (make-geometric-sequence a (+ n 1) +mod+)) (bmod 0)) (loop for i from 0 to (- n 2) do (incfmod res (mod* i (mod- (aref powers (+ i 1)) (aref powers i))))) (loop for d across b do (setq bmod (mod+ (mod* bmod a) d))) (incfmod res (mod* (- n 1) (mod+ 1 (mod- bmod (aref powers (- n 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/1580")) #+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 "10 " (run "3 101 " nil))) (5am:is (equal "0 " (run "5 3 " nil))) (5am:is (equal "248642342 " (run "9 723280082373276788237831270873218023778028108321832138003218732 " nil))))