結果
| 問題 | No.6 使いものにならないハッシュ |
| ユーザー |
 sansaqua
|
| 提出日時 | 2019-11-10 04:06:17 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
AC
|
| 実行時間 | 14 ms / 5,000 ms |
| コード長 | 9,915 bytes |
| コンパイル時間 | 215 ms |
| コンパイル使用メモリ | 63,004 KB |
| 実行使用メモリ | 23,680 KB |
| 最終ジャッジ日時 | 2024-09-16 16:53:01 |
| 合計ジャッジ時間 | 1,442 ms |
|
ジャッジサーバーID （参考情報） |
judge6 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 8 ms
22,912 KB |
| testcase_01 | AC | 8 ms
22,912 KB |
| testcase_02 | AC | 12 ms
23,680 KB |
| testcase_03 | AC | 9 ms
23,040 KB |
| testcase_04 | AC | 9 ms
23,040 KB |
| testcase_05 | AC | 9 ms
23,168 KB |
| testcase_06 | AC | 9 ms
23,424 KB |
| testcase_07 | AC | 9 ms
23,296 KB |
| testcase_08 | AC | 10 ms
23,424 KB |
| testcase_09 | AC | 10 ms
23,296 KB |
| testcase_10 | AC | 8 ms
22,912 KB |
| testcase_11 | AC | 9 ms
23,168 KB |
| testcase_12 | AC | 11 ms
23,424 KB |
| testcase_13 | AC | 9 ms
23,168 KB |
| testcase_14 | AC | 11 ms
23,296 KB |
| testcase_15 | AC | 12 ms
23,424 KB |
| testcase_16 | AC | 11 ms
23,296 KB |
| testcase_17 | AC | 13 ms
23,552 KB |
| testcase_18 | AC | 14 ms
23,552 KB |
| testcase_19 | AC | 12 ms
23,296 KB |
| testcase_20 | AC | 11 ms
23,424 KB |
| testcase_21 | AC | 8 ms
23,040 KB |
| testcase_22 | AC | 11 ms
23,296 KB |
| testcase_23 | AC | 11 ms
23,424 KB |
| testcase_24 | AC | 11 ms
23,296 KB |
| testcase_25 | AC | 10 ms
23,296 KB |
| testcase_26 | AC | 12 ms
23,552 KB |
| testcase_27 | AC | 11 ms
23,296 KB |
| testcase_28 | AC | 10 ms
23,296 KB |
| testcase_29 | AC | 12 ms
23,424 KB |
| testcase_30 | AC | 10 ms
23,424 KB |
| testcase_31 | AC | 11 ms
23,424 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 16 SEP 2024 04:52:58 PM): ; wrote /home/judge/data/code/Main.fasl ; compilation finished in 0:00:00.102
ソースコード
;; -*- 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)) `(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
(macrolet ((def-mmacro (name fname)
`(define-modify-macro ,name (new-value) ,fname)))
(def-mmacro minf min)
(def-mmacro maxf max)
(def-mmacro mulf *)
(def-mmacro divf /)
(def-mmacro orf logior)
(def-mmacro xorf logxor)
(def-mmacro andf logand))
(declaim (inline integer-length*))
(defun integer-length* (x &optional (radix 10))
"Returns the length of the integer X when displayed in RADIX. (Returns 0 when
X = 0. Ignores the negative sign.)"
(declare (integer x)
((integer 2 #.most-positive-fixnum) radix))
(loop for length of-type (integer 0 #.most-positive-fixnum) from 0
for y = (abs x) then (floor y radix)
until (zerop y)
finally (return length)))
(declaim (inline digit-sum))
(defun digit-sum (x &optional (radix 10))
"Returns the sum of the each digit of X w.r.t. RADIX. (Returns 0 when X =
0. Ignores the negative sign.)"
(declare (integer x)
((integer 2 #.most-positive-fixnum) radix))
(let ((sum 0)
(x (abs x)))
(declare (unsigned-byte x)
((integer 0 #.most-positive-fixnum) sum))
(loop
(when (zerop x)
(return sum))
(multiple-value-bind (quot rem) (floor x radix)
(incf sum rem)
(setq x quot)))))
(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 calc-hash (num)
(loop for x = num then (digit-sum x)
when (<= x 9)
do (return x)))
(defun main ()
(let* ((k (read))
(n (read))
(pseq (let* ((tmp (make-prime-sequence (+ n 1)))
(start (position-if (lambda (x) (>= x k)) tmp)))
(subseq tmp start)))
(hashes (coerce (loop for p across pseq
collect (calc-hash p))
'(simple-array uint8 (*))))
(table (make-array 10 :element-type 'bit :initial-element 0))
(maxlen 0)
(res 0)
(prev-pos 0))
#>hashes
(loop for pos below (length hashes)
for v = (aref hashes pos)
do #>table
(when (= 1 (aref table v))
(when (>= (- pos prev-pos) maxlen)
(setq maxlen (- pos prev-pos)
res (aref pseq prev-pos)))
(loop until (= 0 (aref table v))
do (setf (aref table (aref hashes prev-pos)) 0)
(incf prev-pos)))
(setf (aref table v) 1)
finally (when (>= (- pos prev-pos) maxlen)
(setq maxlen (- pos prev-pos)
res (aref pseq prev-pos))))
(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)))