結果
| 問題 | No.917 Make One With GCD |
| ユーザー |
 sansaqua
|
| 提出日時 | 2019-10-26 01:22:07 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 9,246 bytes |
| コンパイル時間 | 266 ms |
| コンパイル使用メモリ | 62,856 KB |
| 実行使用メモリ | 31,288 KB |
| 最終ジャッジ日時 | 2024-06-24 11:07:57 |
| 合計ジャッジ時間 | 6,620 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | TLE | - |
| testcase_01 | AC | 10 ms
28,880 KB |
| testcase_02 | AC | 10 ms
27,052 KB |
| testcase_03 | AC | 10 ms
27,048 KB |
| testcase_04 | AC | 10 ms
27,048 KB |
| testcase_05 | AC | 11 ms
27,048 KB |
| testcase_06 | AC | 11 ms
30,908 KB |
| testcase_07 | AC | 11 ms
31,008 KB |
| testcase_08 | AC | 10 ms
26,924 KB |
| testcase_09 | AC | 56 ms
27,052 KB |
| testcase_10 | AC | 70 ms
31,140 KB |
| testcase_11 | AC | 158 ms
27,304 KB |
| testcase_12 | AC | 143 ms
31,288 KB |
| testcase_13 | AC | 101 ms
31,160 KB |
| testcase_14 | AC | 84 ms
29,260 KB |
| testcase_15 | AC | 107 ms
29,132 KB |
| testcase_16 | AC | 79 ms
31,140 KB |
| testcase_17 | AC | 10 ms
27,048 KB |
| testcase_18 | AC | 15 ms
27,180 KB |
| testcase_19 | AC | 10 ms
26,924 KB |
| testcase_20 | AC | 11 ms
29,000 KB |
| testcase_21 | AC | 17 ms
27,048 KB |
| testcase_22 | AC | 13 ms
31,140 KB |
| testcase_23 | AC | 26 ms
27,176 KB |
| testcase_24 | AC | 12 ms
27,052 KB |
| testcase_25 | AC | 53 ms
27,308 KB |
| testcase_26 | AC | 10 ms
29,004 KB |
| testcase_27 | AC | 10 ms
31,016 KB |
| testcase_28 | AC | 10 ms
27,048 KB |
| testcase_29 | AC | 11 ms
29,004 KB |
| testcase_30 | AC | 11 ms
27,180 KB |
| testcase_31 | AC | 10 ms
27,052 KB |
| testcase_32 | AC | 11 ms
29,004 KB |
| testcase_33 | AC | 10 ms
27,048 KB |
| testcase_34 | AC | 10 ms
27,052 KB |
| testcase_35 | AC | 10 ms
27,176 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 24 JUN 2024 11:07:49 AM): ; file: /home/judge/data/code/Main.lisp ; in: DEFUN MAIN ; (SB-INT:DOHASH ((P _) PFACTOR-SET) ; (SETF (AREF PS POS) P) ; (INCF POS)) ; --> BLOCK MAPHASH LET* SB-KERNEL:%COERCE-CALLABLE-TO-FUN ; ==> ; 1 ; ; caught STYLE-WARNING: ; The variable _ is defined but never used. ; ; compilation unit finished ; caught 1 STYLE-WARNING condition ; wrote /home/judge/data/code/Main.fasl ; compilation finished in 0:00:00.099
ソースコード
;; -*- coding: utf-8 -*-
(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
#\# #\> (lambda (s c p) (declare (ignore c p)) (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
(declaim (ftype (function * (values simple-bit-vector &optional)) make-prime-table))
(defun make-prime-table (sup)
"Returns a simple-bit-vector of length SUP, whose (0-based) i-th bit is 1 if i
is prime and 0 otherwise.
Example: (make-prime-table 10) => #*0011010100"
(declare (optimize (speed 3) (safety 0)))
(check-type sup (integer 2 (#.array-total-size-limit)))
(let ((table (make-array sup :element-type 'bit :initial-element 0))
(sup/64 (ceiling sup 64)))
;; special treatment for p = 2
(dotimes (i sup/64)
(setf (sb-kernel:%vector-raw-bits table i) #xAAAAAAAAAAAAAAAA))
(setf (sbit table 1) 0
(sbit table 2) 1)
;; p >= 3
(loop for p from 3 to (+ 1 (isqrt (- sup 1))) by 2
when (= 1 (sbit table p))
do (loop for composite from (* p p) below sup by p
do (setf (sbit table composite) 0)))
table))
;; FIXME: Currently the element type of the resultant vector is (UNSIGNED-BYTE 62).
(defun make-prime-sequence (sup)
"Returns the ascending sequence of primes smaller than SUP."
(declare (optimize (speed 3) (safety 0)))
(check-type sup (integer 2 (#.array-total-size-limit)))
(let ((table (make-prime-table sup)))
(let* ((length (count 1 table))
(result (make-array length :element-type '(integer 0 #.most-positive-fixnum)))
(index 0))
(declare ((integer 0 #.most-positive-fixnum) length))
(loop for x below sup
when (= 1 (sbit table x))
do (setf (aref result index) x)
(incf index))
(values result table))))
(defstruct (prime-data (:constructor %make-prime-data (seq table)))
(seq nil :type (simple-array (integer 0 #.most-positive-fixnum) (*)))
(table nil :type simple-bit-vector))
(defun make-prime-data (sup)
(multiple-value-call #'%make-prime-data (make-prime-sequence sup)))
(declaim (inline factorize)
(ftype (function * (values list &optional)) factorize))
(defun factorize (x prime-data)
"Returns the associative list of prime factors of X, which is composed
of (<prime> . <exponent>). E.g. (factorize 100 <prime-table>) => '((2 . 2) (5
. 5)).
- Any numbers beyond the range of PRIME-DATA are regarded as prime.
- The returned list is in descending order w.r.t. prime factors."
(declare (integer x))
(setq x (abs x))
(when (<= x 1)
(return-from factorize nil))
(let ((prime-seq (prime-data-seq prime-data))
result)
(loop for prime of-type unsigned-byte across prime-seq
do (when (= x 1)
(return-from factorize result))
(loop for exponent of-type (integer 0 #.most-positive-fixnum) from 0
do (multiple-value-bind (quot rem) (floor x prime)
(if (zerop rem)
(setf x quot)
(progn
(when (> exponent 0)
(push (cons prime exponent) result))
(loop-finish))))))
(if (= x 1)
result
(cons (cons x 1) result))))
(defun make-omega-table (sup prime-data)
"Returns the table of prime omega function on {0, 1, ..., SUP-1}."
(declare ((integer 0 #.most-positive-fixnum) sup))
;; (assert (>= (expt (aref prime-seq (- (length prime-seq) 1)) 2) (- sup 1)))
(let ((prime-seq (prime-data-seq prime-data))
(table (make-array sup :element-type '(unsigned-byte 32)))
(res (make-array sup :element-type '(unsigned-byte 8))))
(dotimes (i (length table))
(setf (aref table i) i))
(loop for p of-type (integer 0 #.most-positive-fixnum) across prime-seq
do (loop for i from p below sup by p
do (loop
(multiple-value-bind (quot rem) (floor (aref table i) p)
(if (zerop rem)
(progn (incf (aref res i))
(setf (aref table i) quot))
(return))))))
(loop for i below sup
unless (= 1 (aref table i))
do (incf (aref res i)))
res))
(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
;;;
(defun main ()
(declare #.OPT)
(let* ((pdata (make-prime-data 10001))
(n (read))
(as (make-array n :element-type 'uint31))
(pfactor-set (make-hash-table)))
(dotimes (i n)
(let ((a (read)))
(setf (aref as i) a)
(dolist (node (factorize a pdata))
(setf (gethash (car node) pfactor-set) t))))
(let* ((count (hash-table-count pfactor-set))
(ps (make-array count :element-type 'uint31))
(pos 0)
(res 0))
(declare (fixnum res))
(loop for pos from 0
for p being each hash-key of pfactor-set
do (setf (aref ps pos) p))
(sb-int:dohash ((p _) pfactor-set)
(setf (aref ps pos) p)
(incf pos))
(sb-int:named-let recur ((pos 0) (parity 0) (divisor 1))
(declare (uint31 pos parity)
(uint62 divisor))
(cond ((= pos count)
(let* ((num (loop for a across as
count (zerop (mod a divisor))
of-type uint31))
(value (- (ash 1 num) 1)))
(declare ((integer 0 50) num))
(if (oddp parity)
(decf res value)
(incf res value))))
((<= (the uint62 (* divisor (aref ps pos))) 100000000)
(recur (+ pos 1) (+ parity 1) (* divisor (aref ps pos)))
(recur (+ pos 1) parity divisor))
(t
(recur (+ pos 1) parity divisor))))
(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 "C:/msys64/usr/bin/cat.exe" '("/dev/clipboard") :output out)))
#+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)))
#+swank
(5am:test :sample
(5am:is (io-equal "3
1 2 3
"
"5
"))
(5am:is (io-equal "4
1 1 1 1
"
"15
"))
(5am:is (io-equal "4
2 4 8 16
"
"0
"))
(5am:is (io-equal "10
801754 703742 332182 68016 914814 8470 937255 293192 313080 501971
"
"763
")))