#470048 (Common Lisp) No.1036 Make One With GCD 2

提出ソース

結果

問題	No.1036 Make One With GCD 2
ユーザー	sansaqua
提出日時	2020-04-25 00:04:42
言語	Common Lisp (sbcl 2.3.8)
結果	RE
実行時間	-
コード長	9,072 bytes
コンパイル時間	401 ms
コンパイル使用メモリ	68,988 KB
実行使用メモリ	116,568 KB
最終ジャッジ日時	2024-11-07 03:16:12
合計ジャッジ時間	35,011 ms
ジャッジサーバーID （参考情報）	judge5 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	RE	-
testcase_01	AC	1,359 ms 107,416 KB
testcase_02	RE	-
testcase_03	AC	55 ms 56,152 KB
testcase_04	AC	93 ms 78,684 KB
testcase_05	AC	10 ms 26,796 KB
testcase_06	AC	10 ms 28,832 KB
testcase_07	AC	468 ms 64,196 KB
testcase_08	AC	384 ms 58,176 KB
testcase_09	RE	-
testcase_10	RE	-
testcase_11	RE	-
testcase_12	RE	-
testcase_13	RE	-
testcase_14	RE	-
testcase_15	RE	-
testcase_16	RE	-
testcase_17	RE	-
testcase_18	AC	13 ms 31,136 KB
testcase_19	AC	13 ms 31,272 KB
testcase_20	AC	15 ms 31,388 KB
testcase_21	AC	15 ms 29,388 KB
testcase_22	RE	-
testcase_23	RE	-
testcase_24	RE	-
testcase_25	RE	-
testcase_26	RE	-
testcase_27	AC	10 ms 26,668 KB
testcase_28	AC	11 ms 28,876 KB
testcase_29	RE	-
testcase_30	RE	-
testcase_31	AC	10 ms 26,920 KB
testcase_32	AC	11 ms 28,880 KB
testcase_33	AC	11 ms 28,876 KB
testcase_34	AC	11 ms 26,920 KB
testcase_35	AC	10 ms 28,872 KB
testcase_36	AC	10 ms 26,792 KB
testcase_37	RE	-
testcase_38	RE	-
testcase_39	RE	-
testcase_40	RE	-
testcase_41	RE	-
testcase_42	RE	-
testcase_43	RE	-
testcase_44	RE	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

; compiling file "/home/judge/data/code/Main.lisp" (written 07 NOV 2024 03:15:37 AM):

; file: /home/judge/data/code/Main.lisp
; in: DEFUN MAIN
;     (GCD VALUE A)
; 
; note: unable to
;   optimize
; due to type uncertainty:
;   The first argument is a (UNSIGNED-BYTE 62), not a (OR
;                                                      (INTEGER
;                                                       -4611686018427387904 -1)
;                                                      (INTEGER 1
;                                                       4611686018427387903)).
;   The second argument is a (UNSIGNED-BYTE 62), not a (OR
;                                                       (INTEGER
;                                                        -4611686018427387904 -1)
;                                                       (INTEGER 1
;                                                        4611686018427387903)).

; file: /home/judge/data/code/Main.lisp
; in: DEFUN MAIN
;     (DST-QUERY DTABLE L R 0)
; --> BLOCK IF LET 
; ==>
;   (UINT62-GCD (THE UINT62+ (AREF TABLE H LEFT))
;    (THE UINT62+ (AREF TABLE H RIGHT)))
; 
; caught STYLE-WARNING:
;   undefined function: COMMON-LISP-USER::UINT62-GCD

; in: DEFUN DST-QUERY
;     (UINT62-GCD (THE UINT62+ (AREF TABLE H LEFT))
;      (THE UINT62+ (AREF TABLE H RIGHT)))
; 
; caught STYLE-WARNING:
;   undefined function: COMMON-LISP-USER::UINT62-GCD
; 
; compilation unit finished
;   Undefined function:
;     UINT62-GCD
;   caught 2 STYLE-WARNING conditions
;   printed 1 note


; wrote /home/judge/data/code/Main.fasl
; compilation finished in 0:00:00.118

ソースコード

raw source code

(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

(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)

;; BEGIN_INSERTED_CONTENTS
(declaim (inline tzcount))
(defun tzcount (x)
  "Is equivalent to TZCNT operation: it returns the number of trailing zero
bits. Note that (TZCOUNT 0) = -1."
  (- (integer-length (logand x (- x))) 1))

;; The following code also works though it is slower on AtCoder as LOGCOUNT is
;; not transformed to POPCNT on SBCL 1.1.14.

;; (declaim (inline tzcount2))
;; (defun tzcount2 (x)
;;   (logcount (- (logand x (- x)) 1)))

(macrolet ((def (name fname)
             `(define-modify-macro ,name (new-value) ,fname)))
  (def minf min)
  (def maxf max)
  (def mulf *)
  (def divf /)
  (def iorf logior)
  (def xorf logxor)
  (def andf logand))

(declaim (ftype (function * (values fixnum &optional)) read-fixnum))
(defun read-fixnum (&optional (in *standard-input*))
  "NOTE: cannot read -2^62"
  (declare #.OPT)
  (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 ((integer 0 #.most-positive-fixnum) result))
      (loop
        (let* ((byte (%read-byte)))
          (if (<= 48 byte 57)
              (setq result (+ (- byte 48)
                              (* 10 (the (integer 0 #.(floor most-positive-fixnum 10))
                                         result))))
              (return (if minus (- result) result))))))))

(deftype uint62+ () '(integer 1 #.most-positive-fixnum))

(declaim (inline fast-gcd)
         (ftype (function * (values (integer 0 #.most-positive-fixnum) &optional)) fast-gcd))
(defun fast-gcd (u v)
  (declare ((integer 0 #.most-positive-fixnum) u v))
  (cond ((zerop u) v)
        ((zerop v) u)
        (t
         (let ((shift (tzcount (logior u v))))
           (setq u (ash u (- (tzcount u))))
           (loop (setq v (ash v (- (tzcount v))))
                 (when (> u v)
                   (rotatef u v))
                 (decf v u)
                 (when (zerop v)
                   (return (the (integer 0 #.most-positive-fixnum)
                                (ash u shift)))))))))

(defun make-disjoint-sparse-table (vector)
  "BINOP := binary operator (comprising a semigroup)"
  (declare #.OPT
           ((simple-array uint62 (*)) vector))
  (let* ((n (length vector))
         (height (max 1 (integer-length (- n 1))))
         (table (make-array (list height n) :element-type 'uint62)))
    (dotimes (j n)
      (setf (aref table 0 j) (aref vector j)))
    (do ((i 1 (+ i 1)))
        ((>= i height))
      (let* ((width/2 (ash 1 i))
             (width (* width/2 2)))
        (do ((j 0 (+ j width)))
            ((>= j n))
          (let ((mid (min (+ j width/2) n)))
            ;; fill the first half
            (setf (aref table i (- mid 1))
                  (aref vector (- mid 1)))
            (do ((k (- mid 2) (- k 1)))
                ((< k j))
              (setf (aref table i k)
                    (fast-gcd (aref vector k) (aref table i (+ k 1)))))
            (when (>= mid n)
              (return))
            ;; fill the second half
            (setf (aref table i mid)
                  (aref vector mid))
            (let ((end (min n (+ mid width/2))))
              (do ((k (+ mid 1) (+ k 1)))
                  ((>= k end))
                (setf (aref table i k)
                      (fast-gcd (aref table i (- k 1)) (aref vector k)))))))))
    table))

(declaim (inline dst-query))
(defun dst-query (table left right &optional identity)
  "Queries the interval [LEFT, RIGHT). Returns IDENTITY for a null interval [x,
x)."
  (declare ((integer 0 #.most-positive-fixnum) left right)
           ((simple-array uint62 (* *)) table))
  (when (>= left right)
    (assert (= left right))
    (return-from dst-query identity))
  (setq right (- right 1)) ;; change to closed interval
  (if (= left right)
      (aref table 0 left)
      (let ((h (- (integer-length (logxor left right)) 1)))
        (uint62-gcd (the uint62+ (aref table h left))
                    (the uint62+ (aref table h right))))))

(in-package :cl-user)

(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* 'double-float))
    (prog1 (princ obj stream) (terpri stream))))

(defconstant +mod+ 1000000007)

;;;
;;; Body
;;;

(defun main ()
  (declare #.OPT)
  (let* ((n (read))
         (as (make-array n :element-type 'uint62 :initial-element 0)))
    (declare (uint31 n))
    (dotimes (i n)
      (setf (aref as i) (read-fixnum)))
    (let ((r 0)
          (dtable (make-disjoint-sparse-table as))
          (res 0))
      (declare (uint62 r res))
      (dotimes (l n)
        (maxf r l)
        (let ((value (dst-query dtable l r 0)))
          (declare (uint62 value))
          (loop (when (= r n)
                  (return))
                (let* ((a (aref as r))
                       (new-value (gcd value a)))
                  (when (= 1 new-value)
                    (return))
                  (setq value new-value)
                  (incf r)))
          (incf res (- r l))))
      (println (- (ash (* n (+ n 1)) -1)
                  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 "500000~%")
    (dotimes (_ 500000)
      (println (+ 1 (random #.(expt 10 18))) 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 "3
1 2 3
"
    "4
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "4
1 1 1 1
"
    "10
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "4
2 4 8 16
"
    "0
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "10
801754 703742 332182 68016 914814 8470 937255 293192 313080 501971
"
    "28
")))

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード