結果

問題 No.536 人工知能
ユーザー sansaqua
提出日時 2020-11-21 10:01:25
言語 Common Lisp
(sbcl 2.5.0)
結果
AC  
実行時間 11 ms / 1,000 ms
コード長 3,492 bytes
コンパイル時間 912 ms
コンパイル使用メモリ 37,728 KB
実行使用メモリ 28,872 KB
最終ジャッジ日時 2024-07-23 15:26:54
合計ジャッジ時間 1,781 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 11
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 23 JUL 2024 03:26:51 PM):

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

ソースコード

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/prefix-p
  (:use :cl)
  (:export #:prefix-p #:suffix-p))
(in-package :cp/prefix-p)
(declaim (inline prefix-p))
(defun prefix-p (prefix sequence &key (test #'eql))
  "Returns true iff PREFIX is a prefix of SEQUENCE."
  (let ((pos (mismatch prefix sequence :test test)))
    (or (null pos) (= pos (length prefix)))))
(declaim (inline suffix-p))
(defun suffix-p (suffix sequence &key (test #'eql))
  "Returns true iff SUFFIX is a suffix of SEQUENCE."
  (let ((pos (mismatch suffix sequence :test test :from-end t)))
    (or (null pos) (zerop pos))))
;; BEGIN_USE_PACKAGE
(eval-when (:compile-toplevel :load-toplevel :execute)
  (use-package :cp/prefix-p :cl-user))
(in-package :cl-user)
;;;
;;; Body
;;;
(defun main ()
  (let* ((s (read-line)))
    (if (suffix-p "ai" s)
        (format t "~AAI~%" (subseq s 0 (- (length s) 2)) )
        (format t "~A-AI~%" s))))
#-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/536"))
#+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 "samurAI
"
          (run "samurai
" nil)))
  (5am:is
   (equal "yuki-AI
"
          (run "yuki
" nil)))
  (5am:is
   (equal "maibuyoh-AI
"
          (run "maibuyoh
" nil))))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0