結果

問題 No.935 う　し　た　ぷ　に　き　あ く ん 笑　ビ　－　ム
ユーザー sansaquasansaqua
提出日時 2019-11-30 00:19:22
言語 Common Lisp
(sbcl 2.3.8)
結果
AC  
実行時間 51 ms / 2,000 ms
コード長 6,891 bytes
コンパイル時間 1,113 ms
コンパイル使用メモリ 42,120 KB
実行使用メモリ 29,324 KB
最終ジャッジ日時 2023-10-12 06:36:09
合計ジャッジ時間 3,807 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 11 ms
23,344 KB
testcase_01 AC 14 ms
25,380 KB
testcase_02 AC 11 ms
27,240 KB
testcase_03 AC 15 ms
23,308 KB
testcase_04 AC 17 ms
23,292 KB
testcase_05 AC 10 ms
23,284 KB
testcase_06 AC 25 ms
23,344 KB
testcase_07 AC 24 ms
25,804 KB
testcase_08 AC 47 ms
23,296 KB
testcase_09 AC 32 ms
26,408 KB
testcase_10 AC 36 ms
25,360 KB
testcase_11 AC 35 ms
23,300 KB
testcase_12 AC 10 ms
27,232 KB
testcase_13 AC 10 ms
27,228 KB
testcase_14 AC 9 ms
23,272 KB
testcase_15 AC 8 ms
23,272 KB
testcase_16 AC 9 ms
25,312 KB
testcase_17 AC 20 ms
23,296 KB
testcase_18 AC 18 ms
26,064 KB
testcase_19 AC 29 ms
25,388 KB
testcase_20 AC 26 ms
23,328 KB
testcase_21 AC 11 ms
25,776 KB
testcase_22 AC 9 ms
23,132 KB
testcase_23 AC 10 ms
27,312 KB
testcase_24 AC 10 ms
27,180 KB
testcase_25 AC 10 ms
29,324 KB
testcase_26 AC 9 ms
23,188 KB
testcase_27 AC 9 ms
23,168 KB
testcase_28 AC 9 ms
23,236 KB
testcase_29 AC 10 ms
27,240 KB
testcase_30 AC 9 ms
23,228 KB
testcase_31 AC 9 ms
27,296 KB
testcase_32 AC 9 ms
27,288 KB
testcase_33 AC 28 ms
23,300 KB
testcase_34 AC 45 ms
23,288 KB
testcase_35 AC 40 ms
23,328 KB
testcase_36 AC 16 ms
23,356 KB
testcase_37 AC 29 ms
25,884 KB
testcase_38 AC 30 ms
25,744 KB
testcase_39 AC 46 ms
23,340 KB
testcase_40 AC 51 ms
23,332 KB
testcase_41 AC 49 ms
23,340 KB
testcase_42 AC 40 ms
25,340 KB
testcase_43 AC 51 ms
23,308 KB
testcase_44 AC 21 ms
25,272 KB
testcase_45 AC 51 ms
27,212 KB
testcase_46 AC 11 ms
23,380 KB
testcase_47 AC 24 ms
23,316 KB
testcase_48 AC 21 ms
25,936 KB
testcase_49 AC 23 ms
25,940 KB
testcase_50 AC 26 ms
23,304 KB
testcase_51 AC 30 ms
23,300 KB
testcase_52 AC 30 ms
23,400 KB
testcase_53 AC 45 ms
23,400 KB
testcase_54 AC 16 ms
23,300 KB
testcase_55 AC 9 ms
23,316 KB
testcase_56 AC 38 ms
25,360 KB
testcase_57 AC 27 ms
23,348 KB
testcase_58 AC 10 ms
27,240 KB
testcase_59 AC 9 ms
23,240 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 12 OCT 2023 06:36:04 AM):
; processing (SB-INT:DEFCONSTANT-EQX OPT ...)
; processing (SET-DISPATCH-MACRO-CHARACTER #\# ...)
; processing (DISABLE-DEBUGGER)
; processing (DEF MINF ...)
; processing (DEF MAXF ...)
; processing (DEF MULF ...)
; processing (DEF DIVF ...)
; processing (DEF IORF ...)
; processing (DEF XORF ...)
; processing (DEF ANDF ...)
; processing (DEFMACRO WITH-BUFFERED-STDOUT ...)
; processing (DECLAIM (FTYPE # ...))
; processing (DEFUN READ-FIXNUM ...)
; processing (DEFMACRO DBG ...)
; processing (DEFMACRO DEFINE-INT-TYPES ...)
; processing (DEFINE-INT-TYPES 2 ...)
; processing (DECLAIM (INLINE PRINTLN))
; processing (DEFUN PRINTLN ...)
; processing (DEFCONSTANT +MOD+ ...)
; processing (DEFUN SOLVE ...)
; processing (DEFUN MAIN ...)
; file: /home/judge/data/code/Main.lisp
; in: DEFUN MAIN
;     (COERCE (READ-LINE) 'SIMPLE-BASE-STRING)
; 
; note: unable to
;   optimize
; due to type uncertainty:
;   The first argument is a (OR LIST (AND (NOT SIMPLE-BASE-STRING) VECTOR)
;                               SB-KERNEL:EXTENDED-SEQUENCE), not a VECTOR.
; 
; note: unable to
;   optimize
; due to type uncertainty:
;   The second argument is a (OR LIST (AND (NOT SIMPLE-BASE-STRING) VECTOR)
;                                SB-KERNEL:EXTENDED-SEQUENCE), not a (SIMPLE-ARRAY
;                                                                     * (*)).
; 
; note: unable to
;   optimize
; due to type uncertainty:
;   The second argument is a (OR LIST (AND (NOT SIMPLE-BASE-STRING) VECTOR)
;                                SB-KERNEL:EXTENDED-SEQUENCE), not a (SIMPLE-ARRAY
;                                                                     CHARACTER
;                                                                     (*)).

;     (DOTIMES (_ Q)
;       (LET ((K (READ-FIXNUM)))
;         (PRINTLN (SOLVE N S AS K))))
; --> DO BLOCK LET TAGBODY UNLESS IF 
; ==>
;   (>= _ #:G6)
; 
; note: forced to do GENERIC-< (

ソースコード

diff # 

;; -*- 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
           ;; enclose the form with VALUES to avoid being captured by LOOP macro
           #\# #\> (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 (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))

;; Should we do this with UNWIND-PROTECT?
(defmacro with-buffered-stdout (&body body)
  "Buffers all outputs to *STANDARD-OUTPUT* in BODY and flushes them to
*STANDARD-OUTPUT* after BODY has been done (without error). Note that only
BASE-CHAR is allowed."
  (let ((out (gensym)))
    `(let ((,out (make-string-output-stream :element-type 'base-char)))
       (let ((*standard-output* ,out))
         ,@body)
       (write-string (get-output-stream-string ,out)))))

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

(defun solve (n s as k)
  (declare #.OPT
           (uint31 n k)
           (simple-base-string s)
           ((simple-array uint31 (*)) as))
  (let ((res 0))
    (declare (uint62 res))
    (labels ((ng (deleted r num sum)
               (declare (uint62 deleted r num sum))
               (let ((sum (- sum (aref as deleted)))
                     (num (if (char= #\E (aref s deleted))
                              (- num 1)
                              num)))
                 (if (<= sum k)
                     (ok (+ deleted 1) r num sum)
                     (ng (+ deleted 1) r num sum))))
             (ok (l next num sum)
               (declare (uint62 l next num sum))
               (maxf res num)
               (unless (= next n)
                 (let ((sum (+ sum (aref as next)))
                       (num (if (char= #\E (aref s next))
                                (+ num 1)
                                num)))
                   (if (<= sum k)
                       (ok l (+ next 1) num sum)
                       (ng l (+ next 1) num sum))))))
      (ok 0 0 0 0)
      res)))

(defun main ()
  (declare #.OPT)
  (let* ((n (read))
         (s (coerce (read-line) 'simple-base-string))
         (as (make-array n :element-type 'uint31)))
    (declare (uint31 n))
    (dotimes (i n)
      (setf (aref as i) (read-fixnum)))
    (let* ((q (read)))
      (with-buffered-stdout
        (dotimes (_ q)
          (let ((k (read-fixnum)))
            (println (solve n s as k))))))))

#-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 "10
EEEEEEEEEE
1 2 3 4 5 6 7 8 9 10
10
1 2 3 4 5 6 7 8 9 10
"
                    "1
1
2
2
2
3
3
3
3
4
"))
  (5am:is (io-equal "10
EEWWEWEEEE
1 1 1 2 3 3 2 1 2 5
5
3 21 100 1 6
"
                    "2
7
7
1
3
")))
0