結果
| 問題 | No.3030 ミラー・ラビン素数判定法のテスト |
| ユーザー |
 sansaqua
|
| 提出日時 | 2020-12-27 09:50:00 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
AC
|
| 実行時間 | 632 ms / 9,973 ms |
| コード長 | 6,520 bytes |
| コンパイル時間 | 1,962 ms |
| コンパイル使用メモリ | 38,016 KB |
| 実行使用メモリ | 77,184 KB |
| 最終ジャッジ日時 | 2024-11-16 23:35:58 |
| 合計ジャッジ時間 | 4,382 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 10 ms
23,168 KB |
| testcase_01 | AC | 10 ms
23,168 KB |
| testcase_02 | AC | 10 ms
23,296 KB |
| testcase_03 | AC | 10 ms
23,168 KB |
| testcase_04 | AC | 387 ms
77,056 KB |
| testcase_05 | AC | 343 ms
77,056 KB |
| testcase_06 | AC | 155 ms
76,544 KB |
| testcase_07 | AC | 153 ms
76,672 KB |
| testcase_08 | AC | 166 ms
76,800 KB |
| testcase_09 | AC | 632 ms
77,184 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 16 NOV 2024 11:35:53 PM): ; file: /home/judge/data/code/Main.lisp ; in: DEFUN %STRONG-PROBABLE-PRIME-P ; (* CP/PRIMALITY::RES CP/PRIMALITY::BASE) ; ; note: forced to do */UNSIGNED=>INTEGER (cost 10) ; unable to do inline fixnum arithmetic (cost 2) because: ; The first argument is a (MOD 9223372036854775807), not a FIXNUM. ; The second argument is a (UNSIGNED-BYTE 63), not a FIXNUM. ; The result is a (VALUES (MOD 85070591730234615838173535747377725443) ; &OPTIONAL), not a (VALUES FIXNUM &OPTIONAL). ; unable to do inline (signed-byte 64) arithmetic (cost 4) because: ; The result is a (VALUES (MOD 85070591730234615838173535747377725443) ; &OPTIONAL), not a (VALUES (SIGNED-BYTE 64) ; &OPTIONAL). ; (* CP/PRIMALITY::BASE CP/PRIMALITY::BASE) ; ; note: forced to do */UNSIGNED=>INTEGER (cost 10) ; unable to do inline fixnum arithmetic (cost 2) because: ; The first argument is a (UNSIGNED-BYTE 63), not a FIXNUM. ; The second argument is a (UNSIGNED-BYTE 63), not a FIXNUM. ; The result is a (VALUES (MOD 85070591730234615847396907784232501250) ; &OPTIONAL), not a (VALUES FIXNUM &OPTIONAL). ; unable to do inline (signed-byte 64) arithmetic (cost 4) because: ; The result is a (VALUES (MOD 85070591730234615847396907784232501250) ; &OPTIONAL), not a (VALUES (SIGNED-BYTE 64) ; &OPTIONAL). ; (* CP/PRIMALITY::Y CP/PRIMALITY::Y) ; ; note: forced to do */UNSIGNED=>INTEGER (cost 10) ; unable to do inline fixnum arithmetic (cost 2) because: ; The first argument is a (OR (INTEGER 0 0) (INTEGER 2 9223372036854775806)), not a FIXNUM. ; The second argument is a (OR (INTEGER 0 0) ;
ソースコード
(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 (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)
#+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)))
(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/tzcount
(:use :cl)
(:export #:tzcount))
(in-package :cp/tzcount)
(declaim (inline tzcount))
(defun tzcount (x)
"Returns the number of trailing zero bits. Note that (TZCOUNT 0) = -1."
(- (integer-length (logand x (- x))) 1))
;;;
;;; Primality test (deterministic Miller-Rabin)
;;;
;; Tuned for SBCL on x86-64 ((INTEGER 0 #.MOST-POSITIVE-FIXNUM) ==
;; (UNSIGNED-BYTE 62))
(defpackage :cp/primality
(:use :cl :cp/tzcount)
(:export #:prime-p))
(in-package :cp/primality)
(defun %strong-probable-prime-p (n base)
(declare (optimize (speed 3))
((unsigned-byte 63) n base))
(or (= n base)
(labels ((mod-power (base power)
(declare ((unsigned-byte 63) base power))
(loop with res of-type (unsigned-byte 63) = 1
while (> power 0)
when (oddp power)
do (setq res (mod (* res base) n))
do (setq base (mod (* base base) n)
power (ash power -1))
finally (return res))))
(let* ((d (floor (- n 1) (logand (- n 1) (- 1 n))))
(y (mod-power base d)))
(declare ((unsigned-byte 63) y))
(or (= y 1)
(= y (- n 1))
(let ((s (tzcount (- n 1))))
(loop repeat (- s 1)
do (setq y (mod (* y y) n))
(when (<= y 1) (return nil))
(when (= y (- n 1)) (return t)))))))))
;; https://primes.utm.edu/prove/prove2_3.html
;; TODO: more efficient SPRP
(defun prime-p (n)
(declare ((unsigned-byte 63) n))
(cond ((<= n 1) nil)
((evenp n) (= n 2))
((< n 4759123141)
(loop for base in '(2 7 61)
always (%strong-probable-prime-p n base)))
((< n 2152302898747)
(loop for base in '(2 3 5 7 11)
always (%strong-probable-prime-p n base)))
;; NOTE: branches below are not tested
(t
(loop for base in '(2 325 9375 28178 450775 9780504 1795265022)
always (%strong-probable-prime-p n base)))))
(defpackage :cp/read-int64
(:use :cl)
(:export #:read-int64))
(in-package :cp/read-int64)
(declaim (ftype (function * (values (signed-byte 64) &optional)) read-int64))
(defun read-int64 (&optional (in *standard-input*))
(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 ((signed-byte 64) result))
(loop
(let* ((byte (%read-byte)))
(if (<= 48 byte 57)
(setq result (+ (- byte 48)
(* 10 (the (integer 0 #.(floor (expt 2 63) 10))
result))))
(return (if minus (- result) result))))))))
;; BEGIN_USE_PACKAGE
(eval-when (:compile-toplevel :load-toplevel :execute)
(use-package :cp/read-int64 :cl-user))
(eval-when (:compile-toplevel :load-toplevel :execute)
(use-package :cp/primality :cl-user))
(in-package :cl-user)
;;;
;;; Body
;;;
(defun main ()
(let* ((n (read)))
(write-string
(with-output-to-string (*standard-output* nil :element-type 'base-char)
(dotimes (_ n)
(let ((x (read-int64)))
(format t "~D ~D~%"
x
(if (prime-p x)
1
0))))))))
#-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/3030"))
#+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 (or (> sb-c::*compiler-warning-count* 0)
sb-c::*undefined-warnings*)
(error "count: ~D, undefined warnings: ~A"
sb-c::*compiler-warning-count*
sb-c::*undefined-warnings*)))
;; To run: (5am:run! :sample)
#+swank
(5am:test :sample
(5am:is
(equal "10 0
2 1
1 0
5 1
"
(run "4
10
2
1
5
" nil))))