結果

問題 No.1051 PQ Permutation
ユーザー sansaquasansaqua
提出日時 2020-05-08 23:27:30
言語 Common Lisp
(sbcl 2.3.8)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 12,464 bytes
コンパイル時間 316 ms
コンパイル使用メモリ 57,936 KB
実行使用メモリ 35,108 KB
最終ジャッジ日時 2023-09-19 08:11:51
合計ジャッジ時間 6,151 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 10 ms
24,540 KB
testcase_01 AC 9 ms
24,436 KB
testcase_02 AC 10 ms
24,608 KB
testcase_03 AC 9 ms
24,540 KB
testcase_04 AC 10 ms
24,572 KB
testcase_05 AC 9 ms
24,564 KB
testcase_06 AC 9 ms
24,500 KB
testcase_07 AC 9 ms
24,444 KB
testcase_08 AC 9 ms
24,480 KB
testcase_09 AC 11 ms
24,596 KB
testcase_10 AC 10 ms
24,608 KB
testcase_11 AC 10 ms
24,672 KB
testcase_12 AC 10 ms
24,536 KB
testcase_13 AC 9 ms
24,432 KB
testcase_14 AC 10 ms
24,508 KB
testcase_15 AC 260 ms
29,512 KB
testcase_16 AC 244 ms
29,384 KB
testcase_17 AC 75 ms
27,920 KB
testcase_18 AC 77 ms
27,944 KB
testcase_19 AC 77 ms
27,940 KB
testcase_20 AC 187 ms
29,124 KB
testcase_21 AC 192 ms
29,224 KB
testcase_22 AC 77 ms
27,912 KB
testcase_23 AC 185 ms
29,188 KB
testcase_24 AC 180 ms
29,168 KB
testcase_25 AC 22 ms
24,896 KB
testcase_26 AC 13 ms
24,720 KB
testcase_27 AC 11 ms
24,644 KB
testcase_28 AC 18 ms
25,108 KB
testcase_29 AC 12 ms
24,684 KB
testcase_30 AC 24 ms
24,984 KB
testcase_31 AC 13 ms
24,672 KB
testcase_32 AC 24 ms
24,912 KB
testcase_33 AC 11 ms
24,660 KB
testcase_34 AC 11 ms
24,656 KB
testcase_35 AC 125 ms
27,048 KB
testcase_36 AC 125 ms
26,948 KB
testcase_37 AC 39 ms
29,352 KB
testcase_38 AC 261 ms
35,096 KB
testcase_39 AC 42 ms
31,004 KB
testcase_40 AC 75 ms
29,304 KB
testcase_41 AC 160 ms
33,408 KB
testcase_42 WA -
testcase_43 AC 9 ms
24,480 KB
testcase_44 AC 10 ms
24,540 KB
testcase_45 AC 9 ms
24,504 KB
testcase_46 AC 9 ms
24,496 KB
testcase_47 WA -
testcase_48 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 19 SEP 2023 08:11:44 AM):
; processing (SB-INT:DEFCONSTANT-EQX OPT ...)
; processing (SET-DISPATCH-MACRO-CHARACTER #\# ...)
; processing (DISABLE-DEBUGGER)
; processing (DECLAIM (INLINE BISECT-LEFT))
; processing (DEFUN BISECT-LEFT ...)
; processing (DECLAIM (INLINE BISECT-RIGHT))
; processing (DEFUN BISECT-RIGHT ...)
; processing (DEF MINF ...)
; processing (DEF MAXF ...)
; processing (DEF MULF ...)
; processing (DEF DIVF ...)
; processing (DEF IORF ...)
; processing (DEF XORF ...)
; processing (DEF ANDF ...)
; processing (DEFINE-CONDITION NO-PERMUTATION-ERROR ...)
; processing (DEFUN NEXT-PERMUTATION! ...)
; processing (DECLAIM (FTYPE # ...))
; processing (DEFUN READ-FIXNUM ...)
; processing (IN-PACKAGE :CL-USER)
; 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 MAIN ...)
; file: /home/judge/data/code/Main.lisp
; in: DEFUN MAIN
;     (- (READ) 1)
; 
; note: unable to
;   open-code float conversion in mixed numeric operation
; due to type uncertainty:
;   The first argument is a NUMBER, not a FLOAT.
; 
; note: unable to
;   open-code float conversion in mixed numeric operation
; due to type uncertainty:
;   The first argument is a NUMBER, not a (OR (COMPLEX SINGLE-FLOAT)
;                                             (COMPLEX DOUBLE-FLOAT)).
; 
; note: unable to
;   open-code float conversion in mixed numeric operation
; due to type uncertainty:
;   The first argument is a NUMBER, not a FLOAT.
; 
; note: unable to
;   open-code float conversion in mixed numeric operation
; due to type uncertainty:
;   The first argument is a NUMBER, not a (OR (COMPLEX SINGLE-FLOAT)
;                                             (COMPLEX DOUBLE-FLOAT)).

;     (> RIGHT-MAX STD)
; 
; note: unable to
;   open-code FLOAT to RATIONAL comp

ソースコード

diff # 

(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

;; BEGIN_INSERTED_CONTENTS
(declaim (inline bisect-left))
(defun bisect-left (target value &key (start 0) end (order #'<) (key #'identity))
  "TARGET := vector | function (taking an integer argument)
ORDER := strict order

Analogue of lower_bound() of C++ or bisect_left() of Python: Returns the
smallest index (or input) i that fulfills TARGET[i] >= VALUE, where '>=' is the
complement of ORDER. In other words, this function returns the leftmost index at
which VALUE can be inserted with keeping the order. Therefore, TARGET must be
monotonically non-decreasing with respect to ORDER.

- This function returns END if VALUE exceeds TARGET[END-1]. 
- The range [START, END) is half-open.
- END must be explicitly specified if TARGET is function.
- KEY is applied to each element of TARGET before comparison."
  (declare (function key order)
           (integer start)
           ((or null integer) end))
  (macrolet
      ((frob (accessor &optional declaration)
         `(labels
              ((%bisect-left (ng ok)
                 ;; TARGET[OK] >= VALUE always holds (assuming
                 ;; TARGET[END] = +infinity)
                 ,@(when declaration (list declaration))
                 (if (<= (- ok ng) 1)
                     ok
                     (let ((mid (ash (+ ng ok) -1)))
                       (if (funcall order (funcall key (,accessor target mid)) value)
                           (%bisect-left mid ok)
                           (%bisect-left ng mid))))))
            (assert (<= start end))
            (%bisect-left (- start 1) end))))
    (etypecase target
      (vector
       (let ((end (or end (length target))))
         (frob aref (declare ((integer -1 (#.most-positive-fixnum)) ng ok)))))
      (function
       (assert end () "Requires END argument if TARGET is a function.")
       (frob funcall)))))

(declaim (inline bisect-right))
(defun bisect-right (target value &key (start 0) end (order #'<) (key #'identity))
  "TARGET := vector | function (taking an integer argument)
ORDER := strict order

Analogue of upper_bound() of C++ or bisect_right() of Python: Returns the
smallest index (or input) i that fulfills TARGET[i] > VALUE. In other words,
this function returns the rightmost index at which VALUE can be inserted with
keeping the order. Therefore, TARGET must be monotonically non-decreasing with
respect to ORDER.

- This function returns END if VALUE >= TARGET[END-1].
- The range [START, END) is half-open.
- END must be explicitly specified if TARGET is function.
- KEY is applied to each element of TARGET before comparison."
  (declare (function key order)
           (integer start)
           ((or null integer) end))
  (macrolet
      ((frob (accessor &optional declaration)
         `(labels
              ((%bisect-right (ng ok)
                 ;; TARGET[OK] > VALUE always holds (assuming
                 ;; TARGET[END] = +infinity)
                 ,@(when declaration (list declaration))
                 (if (<= (- ok ng) 1)
                     ok
                     (let ((mid (ash (+ ng ok) -1)))
                       (if (funcall order value (funcall key (,accessor target mid)))
                           (%bisect-right ng mid)
                           (%bisect-right mid ok))))))
            (assert (<= start end))
            (%bisect-right (- start 1) end))))
    (etypecase target
      (vector
       (let ((end (or end (length target))))
         (frob aref (declare ((integer -1 (#.array-total-size-limit)) ng ok)))))
      (function
       (assert end () "Requires END argument if TARGET is a function.")
       (frob funcall)))))

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

;;;
;;; Next permutation (O(n))
;;; Reference:
;;; https://www.geeksforgeeks.org/find-the-next-lexicographically-greater-word-than-a-given-word/
;;;

(define-condition no-permutation-error (error)
  ((permutation :initarg :permutation :reader no-permutation-error-permutation))
  (:report
   (lambda (condition stream)
     (format stream "~W is an extreme permutation"
             (no-permutation-error-permutation condition)))))

(defun next-permutation! (perm &key (order #'<))
  "Destructively changes PERM to the next permutation w.r.t. ORDER. ORDER must
be a strict total order on PERM."
  (declare (vector perm))
  (let* ((n (length perm))
         (left (- n 2)))
    (declare (fixnum left))
    (loop (when (< left 0)
            (error 'no-permutation-error))
          (when (funcall order (aref perm left) (aref perm (+ left 1)))
            (return))
          (decf left))
    (labels ((bisect (ok ng)
               (declare ((integer 0 #.most-positive-fixnum) ok ng))
               (if (<= (- ng ok) 1)
                   ok
                   (let ((mid (ash (+ ok ng) -1)))
                     (if (funcall order (aref perm left) (aref perm mid))
                         (bisect mid ng)
                         (bisect ok mid))))))
      (rotatef (aref perm left)
               (aref perm (bisect left n)))
      (loop for i from 1 below (ceiling (- n left) 2)
            do (rotatef (aref perm (+ left i))
                        (aref perm (- n i))))
      perm)))

(declaim (ftype (function * (values fixnum &optional)) read-fixnum))
(defun read-fixnum (&optional (in *standard-input*))
  "NOTE: cannot read -2^62"
  (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))))))))

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

(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 main ()
  (declare #.OPT)
  (let* ((n (read))
         (p (- (read) 1))
         (q (- (read) 1))
         (as (make-array n :element-type 'uint31 :fill-pointer n)))
    (declare (uint31 n p q)
             ((array uint31 (*)) as))
    (labels ((%write (as)
               (write-string
                (with-output-to-string (*standard-output* nil :element-type 'base-char)
                  (let ((init t))
                    (loop for a across as
                          do (if init
                                 (setq init nil)
                                 (write-char #\ ))
                             (write (+ a 1)))
                    (terpri))))))
      (dotimes (i n)
        (setf (aref as i) (- (read-fixnum) 1)))
      (handler-bind ((no-permutation-error (lambda (c)
                                             (println -1)
                                             (return-from main))))
        (setq as (next-permutation! as)))
      (when (< (position p as) (position q as))
        (%write as)
        (return-from main))
      (let* ((pos (position q as))
             (rights (make-array n :element-type 'uint31 :fill-pointer 0)))
        (loop for i from pos below n
              do (vector-push (vector-pop as) rights))
        (let ((right-max (reduce #'max rights))
              (std q))
          (loop (when (> right-max std)
                  (return))
                (when (zerop (length as))
                  (println -1)
                  (return-from main))
                (let ((new (aref as (- (length as) 1))))
                  (setq std new)
                  (vector-push (vector-pop as) rights)
                  (maxf right-max new)))
          (setq rights (sort rights #'<))
          (let* ((std-next (aref rights (bisect-right rights std)))
                 (res (make-array n :element-type 'uint31 :fill-pointer 0)))
            (loop for a across as
                  do (vector-push a res))
            (vector-push std-next res)
            (setq rights (delete std-next rights))
            (if (or (= std-next p) (< p q))
                (loop for x across rights
                      do (vector-push x res))
                (loop for x across (delete q rights)
                      do (vector-push x res)
                      when (= x p)
                      do (vector-push q res)))
            (%write 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 "")))

#+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 "5 1 2
2 1 5 3 4
"
    "3 1 2 4 5
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "8 5 2
2 5 8 6 4 3 1 7
"
    "3 1 4 5 2 6 7 8
"))
  (it.bese.fiveam:is
   (common-lisp-user::io-equal "4 3 4
4 1 2 3
"
    "-1
")))
0