Submission #8305494


Source Code Expand

;; -*- 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 (inline power-mod))
(defun power-mod (base power modulus)
  (declare ((integer 0 #.most-positive-fixnum) power)
           ((unsigned-byte 31) base modulus))
  (do ((nextn (ash power -1) (ash power -1))
       (total (if (oddp power) base 1)
              (if (oddp power) (mod (* base total) modulus) total)))
      ((zerop nextn) total)
    (declare ((unsigned-byte 31) total))
    (setq base (mod (* base base) modulus))
    (setq power nextn)))

;;;
;;; Arithmetic operations with static modulus
;;;

(defmacro define-mod-operations (divisor)
  `(progn
     (defun mod* (&rest args)
       (reduce (lambda (x y) (mod (* x y) ,divisor)) args))

     (sb-c:define-source-transform mod* (&rest args)
       (if (null args)
           1
           (reduce (lambda (x y) `(mod (* ,x ,y) ,',divisor)) args)))

     (defun mod+ (&rest args)
       (reduce (lambda (x y) (mod (+ x y) ,divisor)) args))

     (sb-c:define-source-transform mod+ (&rest args)
       (if (null args)
           0
           (reduce (lambda (x y) `(mod (+ ,x ,y) ,',divisor)) args)))

     (define-modify-macro incfmod (delta)
       (lambda (x y) (mod (+ x y) ,divisor)))

     (define-modify-macro decfmod (delta)
       (lambda (x y) (mod (- x y) ,divisor)))

     (define-modify-macro mulfmod (multiplier)
       (lambda (x y) (mod (* x y) ,divisor)))))

(defun map-run-length (function seq &key (test #'eql))
  "Applies FUNCTION to each equal successive element of SEQ. FUNCTION must take
two arguments: the first one receives an element in SEQ and the second one
receives the number of the successive elements equal to the first.

Example: (map-run-length (lambda (x c) (format t \"~D ~D~%\" x c)) #(1 1 1 2 2 1 3))
1 3
2 2
1 1
3 1
"
  (declare (sequence seq)
           (function test function))
  (etypecase seq
    (vector
     (unless (zerop (length seq))
       (let ((prev (aref seq 0))
             (start 0))
         (loop for pos from 1 below (length seq)
               unless (funcall test prev (aref seq pos))
               do (funcall function prev (- pos start))
                  (setf prev (aref seq pos)
                        start pos)
               finally (funcall function prev (- pos start))))))
    (list
     (when (cdr seq)
       (labels ((recur (lst prev count)
                  (declare ((integer 0 #.most-positive-fixnum) count))
                  (cond ((null lst)
                         (funcall function prev count))
                        ((funcall test prev (car lst))
                         (recur (cdr lst) prev (+ 1 count)))
                        (t (funcall function prev count)
                           (recur (cdr lst) (car lst) 1)))))
         (recur (cdr seq) (car seq) 1))))))

(declaim (ftype (function * (values fixnum &optional)) read-fixnum))
(defun read-fixnum (&optional (in *standard-input*))
  (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 #\-))
                                  (setf 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))))))))

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

(define-mod-operations +mod+)
(defun main ()
  (declare #.OPT)
  (let* ((n (read))
         (as (make-array n :element-type 'uint31))
         (prev-dist 0)
         (prev-num 0)
         (res 1))
    (declare (uint31 n prev-num res))
    (dotimes (i n)
      (setf (aref as i) (read-fixnum)))
    (unless (zerop (aref as 0))
      (setq res 0))
    (setq as (sort as #'<))
    (unless (= 1 (count 0 as))
      (setq res 0))
    (map-run-length
     (lambda (dist num)
       (declare (uint31 dist num))
       (unless (zerop dist)
         (unless (= (+ 1 prev-dist) dist)
           (setq res 0))
         (mulfmod res (power-mod 2 (floor (* num (- num 1)) 2) +mod+))
         (mulfmod res (power-mod (the uint31 (- (power-mod 2 prev-num +mod+) 1))
                                 num
                                 +mod+)))
       (setq prev-num num
             prev-dist dist))
     as)
    (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)))

;; To run: (5am:run! :sample)
#+swank
(it.bese.fiveam:test :sample
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "4
0 1 1 2
"
    "6
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "4
0 1 2 0
"
    "0
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "3
1 1 2
"
    "0
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "17
0 1 1 2 2 4 3 2 4 5 3 3 2 1 5 4 2
"
    "855391686
")))

Submission Info

Submission Time
Task B - 最短路問題
User sansaqua
Language Common Lisp (SBCL 1.1.14)
Score 100
Code Size 8651 Byte
Status AC
Exec Time 254 ms
Memory 35300 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 46
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt
Case Name Status Exec Time Memory
sample_01.txt AC 254 ms 35300 KiB
sample_02.txt AC 111 ms 23008 KiB
sample_03.txt AC 111 ms 23012 KiB
sample_04.txt AC 111 ms 23012 KiB
test_01.txt AC 111 ms 23012 KiB
test_02.txt AC 111 ms 23012 KiB
test_03.txt AC 111 ms 23008 KiB
test_04.txt AC 111 ms 23008 KiB
test_05.txt AC 111 ms 23012 KiB
test_06.txt AC 111 ms 23008 KiB
test_07.txt AC 111 ms 23016 KiB
test_08.txt AC 112 ms 23012 KiB
test_09.txt AC 112 ms 23016 KiB
test_10.txt AC 111 ms 23012 KiB
test_11.txt AC 125 ms 23012 KiB
test_12.txt AC 158 ms 23016 KiB
test_13.txt AC 158 ms 23012 KiB
test_14.txt AC 172 ms 23008 KiB
test_15.txt AC 179 ms 23012 KiB
test_16.txt AC 183 ms 23016 KiB
test_17.txt AC 185 ms 23016 KiB
test_18.txt AC 188 ms 23012 KiB
test_19.txt AC 191 ms 23012 KiB
test_20.txt AC 196 ms 23016 KiB
test_21.txt AC 198 ms 23012 KiB
test_22.txt AC 199 ms 23012 KiB
test_23.txt AC 202 ms 23012 KiB
test_24.txt AC 203 ms 23012 KiB
test_25.txt AC 209 ms 23012 KiB
test_26.txt AC 209 ms 23012 KiB
test_27.txt AC 210 ms 23012 KiB
test_28.txt AC 209 ms 23008 KiB
test_29.txt AC 210 ms 23012 KiB
test_30.txt AC 203 ms 23008 KiB
test_31.txt AC 111 ms 23016 KiB
test_32.txt AC 111 ms 23012 KiB
test_33.txt AC 111 ms 23012 KiB
test_34.txt AC 111 ms 23008 KiB
test_35.txt AC 111 ms 23012 KiB
test_36.txt AC 111 ms 23012 KiB
test_37.txt AC 111 ms 23012 KiB
test_38.txt AC 111 ms 23012 KiB
test_39.txt AC 111 ms 23016 KiB
test_40.txt AC 111 ms 23008 KiB
test_41.txt AC 111 ms 23008 KiB
test_42.txt AC 111 ms 23008 KiB