結果

問題 No.1157 Many Quotients easy
ユーザー sansaquasansaqua
提出日時 2020-11-23 18:37:06
言語 Common Lisp
(sbcl 2.3.8)
結果
AC  
実行時間 12 ms / 2,000 ms
コード長 3,831 bytes
コンパイル時間 131 ms
コンパイル使用メモリ 38,156 KB
実行使用メモリ 30,908 KB
最終ジャッジ日時 2024-07-23 17:38:32
合計ジャッジ時間 1,366 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
30,888 KB
testcase_01 AC 10 ms
26,664 KB
testcase_02 AC 11 ms
26,796 KB
testcase_03 AC 10 ms
26,668 KB
testcase_04 AC 10 ms
26,920 KB
testcase_05 AC 12 ms
30,904 KB
testcase_06 AC 12 ms
28,620 KB
testcase_07 AC 12 ms
26,536 KB
testcase_08 AC 11 ms
26,796 KB
testcase_09 AC 11 ms
26,664 KB
testcase_10 AC 11 ms
30,780 KB
testcase_11 AC 11 ms
26,664 KB
testcase_12 AC 10 ms
26,668 KB
testcase_13 AC 10 ms
26,796 KB
testcase_14 AC 11 ms
30,780 KB
testcase_15 AC 10 ms
26,664 KB
testcase_16 AC 11 ms
30,908 KB
testcase_17 AC 10 ms
26,792 KB
testcase_18 AC 11 ms
28,744 KB
testcase_19 AC 11 ms
28,880 KB
testcase_20 AC 11 ms
28,876 KB
testcase_21 AC 10 ms
26,660 KB
testcase_22 AC 10 ms
30,776 KB
testcase_23 AC 11 ms
26,792 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 23 JUL 2024 05:38:31 PM):

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

ソースコード

diff # 

(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)))))
#+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/enum-quotients
  (:use :cl)
  (:export #:enum-quotients))
(in-package :cp/enum-quotients)

(declaim (ftype (function * (values (array (integer 0 #.most-positive-fixnum) (*)) &optional))
                enum-quotients))
(defun enum-quotients (n)
  "Given a positive integer N, floor(N/k) takes at most O(sqrt(N)) values for k
in {1, ..., N}. ENUM-QUOTIENTS returns the ascending vector of minimal integers
k that take `new' values compared to floor(N/(k-1)). Note that this vector
contains 1 and N+1.

Tips: Let A be the returned vector of length M+1 and an index i in {0, ..., M}
be given; then A[i]A[j] <= N iff j < M-i."
  (declare ((integer 0 #.most-positive-fixnum) n))
  (let ((k 1)
        (result (make-array (* 2 (isqrt n))
                            :element-type '(integer 0 #.most-positive-fixnum)
                            :adjustable t
                            :fill-pointer 0)))
    (loop (vector-push-extend k result)
          (when (> k n)
            (return result))
          (setq k (+ 1 (floor n (floor n k)))))))

;; BEGIN_USE_PACKAGE
(eval-when (:compile-toplevel :load-toplevel :execute)
  (use-package :cp/enum-quotients :cl-user))
(in-package :cl-user)

;;;
;;; Body
;;;

(defun main ()
  (let* ((n (read)))
    (println (- (length (enum-quotients n)) 1))))

#-swank (main)

;;;
;;; Test and benchmark
;;;

#+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/1157"))

#+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 "2
"
          (run "3
" nil)))
  (5am:is
   (equal "34
"
          (run "319
" nil))))
0