結果
| 問題 | No.978 Fibonacci Convolution Easy |
| ユーザー |
 sansaqua
|
| 提出日時 | 2020-01-31 21:54:38 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
AC
|
| 実行時間 | 412 ms / 2,000 ms |
| コード長 | 5,186 bytes |
| コンパイル時間 | 998 ms |
| コンパイル使用メモリ | 37,632 KB |
| 実行使用メモリ | 75,392 KB |
| 最終ジャッジ日時 | 2024-09-18 20:57:22 |
| 合計ジャッジ時間 | 5,288 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 13 ms
24,832 KB |
| testcase_01 | AC | 185 ms
75,264 KB |
| testcase_02 | AC | 105 ms
59,392 KB |
| testcase_03 | AC | 395 ms
75,392 KB |
| testcase_04 | AC | 127 ms
68,096 KB |
| testcase_05 | AC | 33 ms
32,128 KB |
| testcase_06 | AC | 164 ms
75,264 KB |
| testcase_07 | AC | 272 ms
75,392 KB |
| testcase_08 | AC | 197 ms
75,264 KB |
| testcase_09 | AC | 304 ms
75,392 KB |
| testcase_10 | AC | 404 ms
75,264 KB |
| testcase_11 | AC | 147 ms
75,392 KB |
| testcase_12 | AC | 30 ms
31,104 KB |
| testcase_13 | AC | 165 ms
75,264 KB |
| testcase_14 | AC | 53 ms
39,936 KB |
| testcase_15 | AC | 196 ms
75,136 KB |
| testcase_16 | AC | 409 ms
75,392 KB |
| testcase_17 | AC | 412 ms
75,392 KB |
| testcase_18 | AC | 8 ms
22,400 KB |
| testcase_19 | AC | 7 ms
22,400 KB |
| testcase_20 | AC | 7 ms
22,400 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 18 SEP 2024 08:57:16 PM): ; file: /home/judge/data/code/Main.lisp ; in: DEFUN MOD-INVERSE ; (+ U MODULUS) ; ; note: deleting unreachable code ; ; compilation unit finished ; printed 1 note ; wrote /home/judge/data/code/Main.fasl ; compilation finished in 0:00:00.074
ソースコード
(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
;;;
;;; 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))
(sb-c:define-source-transform mod* (&rest args)
(if (null args)
1
(reduce (lambda (x y) `(mod (* ,x ,y) ,',divisor)) args)))
(defun mod+ (&rest args)
(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+ 1000000007)
;;;
;;; Body
;;;
(define-mod-operations +mod+)
(defun mod-inverse (a modulus)
(declare ((integer 1 #.most-positive-fixnum) modulus))
(let ((a (mod a modulus))
(b modulus)
(u 1)
(v 0))
(declare (fixnum a b u v))
(loop until (zerop b)
for quot = (floor a b)
do (decf a (the fixnum (* quot b)))
(rotatef a b)
(decf u (the fixnum (* quot v)))
(rotatef u v))
(setq u (mod u modulus))
(if (< u 0)
(+ u modulus)
u)))
(defun main ()
(let* ((n (read))
(p (read))
(a-2 (mod (- p) +mod+))
(a-1 1)
(cumul 0)
(res 0))
(declare (uint31 n p a-2 a-1 cumul res))
(dotimes (i n)
(let ((new-a (mod+ (mod* p a-1) a-2)))
(incfmod cumul new-a)
(incfmod res (mod* new-a cumul))
(psetq a-2 a-1
a-1 new-a)))
(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)))