結果
問題 | No.16 累乗の加算 |
ユーザー | sansaqua |
提出日時 | 2020-03-28 05:54:21 |
言語 | Common Lisp (sbcl 2.3.8) |
結果 |
AC
|
実行時間 | 9 ms / 5,000 ms |
コード長 | 5,609 bytes |
コンパイル時間 | 1,169 ms |
コンパイル使用メモリ | 41,828 KB |
実行使用メモリ | 28,496 KB |
最終ジャッジ日時 | 2024-06-10 17:02:56 |
合計ジャッジ時間 | 945 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 9 ms
26,540 KB |
testcase_01 | AC | 9 ms
28,488 KB |
testcase_02 | AC | 9 ms
28,492 KB |
testcase_03 | AC | 9 ms
28,492 KB |
testcase_04 | AC | 9 ms
26,532 KB |
testcase_05 | AC | 8 ms
26,532 KB |
testcase_06 | AC | 8 ms
26,540 KB |
testcase_07 | AC | 9 ms
26,536 KB |
testcase_08 | AC | 9 ms
26,536 KB |
testcase_09 | AC | 7 ms
26,536 KB |
testcase_10 | AC | 9 ms
26,540 KB |
testcase_11 | AC | 8 ms
26,536 KB |
testcase_12 | AC | 9 ms
26,536 KB |
testcase_13 | AC | 8 ms
28,496 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 10 JUN 2024 05:02:54 PM): ; wrote /home/judge/data/code/Main.fasl ; compilation finished in 0:00:00.048
ソースコード
(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 ;; enclose the form with VALUES to avoid being captured by LOOP macro #\# #\> (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) #-swank (disable-debugger) ; for CS Academy ;; BEGIN_INSERTED_CONTENTS ;; TODO: more efficient handling when modulus is (unsigned-byte 31) or ;; (unsigned-byte 32) (declaim (inline mod-power)) (defun mod-power (base power modulus) "BASE := integer POWER, MODULUS := non-negative fixnum" (declare ((integer 0 #.most-positive-fixnum) modulus power) (integer base)) (if (= modulus 1) 0 (labels ((recur (x p) (declare ((integer 0 #.most-positive-fixnum) x p) #+sbcl (values (integer 0 #.most-positive-fixnum))) (cond ((zerop p) 1) ((evenp p) (recur (mod (* x x) modulus) (ash p -1))) (t (mod (* x (recur x (- p 1))) modulus))))) (recur (mod base modulus) power)))) ;;; ;;; Arithmetic operations with static modulus ;;; ;; FIXME: Currently MOD* and MOD+ doesn't apply MOD when the number of ;; parameters is one. (defmacro define-mod-operations (divisor) `(progn (defun mod* (&rest args) (reduce (lambda (x y) (mod (* x y) ,divisor)) args)) (defun mod+ (&rest args) (reduce (lambda (x y) (mod (+ x y) ,divisor)) args)) #+sbcl (eval-when (:compile-toplevel :load-toplevel :execute) (locally (declare (muffle-conditions warning)) (sb-c:define-source-transform mod* (&rest args) (if (null args) 1 (reduce (lambda (x y) `(mod (* ,x ,y) ,',divisor)) args))) (sb-c:define-source-transform mod+ (&rest args) (if (null args) 0 (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))))) (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))) (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) (declaim (inline println)) (defun println (obj &optional (stream *standard-output*)) (let ((*read-default-float-format* 'double-float)) (prog1 (princ obj stream) (terpri stream)))) (defconstant +mod+ 1000003) ;;; ;;; Body ;;; (define-mod-operations +mod+) (defun main () (let* ((x (read)) (n (read)) (res 0)) (dotimes (i n) (let ((a (read))) (incfmod res (mod-power x a +mod+)))) (println res))) #-swank (main) ;;; ;;; Test and benchmark ;;; #+swank (defun io-equal (in-string out-string &key (function #'main) (test #'equal)) "Passes IN-STRING to *STANDARD-INPUT*, executes FUNCTION, and returns true if the string output to *STANDARD-OUTPUT* is equal to OUT-STRING." (labels ((ensure-last-lf (s) (if (eql (uiop:last-char s) #\Linefeed) s (uiop:strcat s uiop:+lf+)))) (funcall test (ensure-last-lf out-string) (with-output-to-string (out) (let ((*standard-output* out)) (with-input-from-string (*standard-input* (ensure-last-lf in-string)) (funcall function))))))) #+swank (defun get-clipbrd () (with-output-to-string (out) (run-program "powershell.exe" '("-Command" "Get-Clipboard") :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* out)) (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)))))) #+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 (common-lisp-user::io-equal "2 3 1 2 3 " "14 ")) (it.bese.fiveam:is (common-lisp-user::io-equal "2 2 0 100 " "253110 ")))