結果
| 問題 | No.1051 PQ Permutation |
| ユーザー |
 sansaqua
|
| 提出日時 | 2020-05-08 22:57:22 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 12,595 bytes |
| コンパイル時間 | 751 ms |
| コンパイル使用メモリ | 50,048 KB |
| 実行使用メモリ | 40,832 KB |
| 最終ジャッジ日時 | 2024-07-05 19:55:55 |
| 合計ジャッジ時間 | 4,814 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 9 ms
23,424 KB |
| testcase_01 | AC | 9 ms
23,424 KB |
| testcase_02 | AC | 10 ms
23,424 KB |
| testcase_03 | AC | 10 ms
23,424 KB |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | RE | - |
| testcase_08 | WA | - |
| testcase_09 | AC | 10 ms
23,424 KB |
| testcase_10 | WA | - |
| testcase_11 | AC | 10 ms
23,552 KB |
| testcase_12 | WA | - |
| testcase_13 | RE | - |
| testcase_14 | RE | - |
| testcase_15 | WA | - |
| testcase_16 | WA | - |
| testcase_17 | WA | - |
| testcase_18 | WA | - |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | WA | - |
| testcase_22 | WA | - |
| testcase_23 | WA | - |
| testcase_24 | WA | - |
| testcase_25 | WA | - |
| testcase_26 | WA | - |
| testcase_27 | WA | - |
| testcase_28 | WA | - |
| testcase_29 | WA | - |
| testcase_30 | WA | - |
| testcase_31 | WA | - |
| testcase_32 | WA | - |
| testcase_33 | WA | - |
| testcase_34 | WA | - |
| testcase_35 | RE | - |
| testcase_36 | AC | 49 ms
28,288 KB |
| testcase_37 | RE | - |
| testcase_38 | AC | 103 ms
33,152 KB |
| testcase_39 | RE | - |
| testcase_40 | WA | - |
| testcase_41 | WA | - |
| testcase_42 | RE | - |
| testcase_43 | RE | - |
| testcase_44 | RE | - |
| testcase_45 | RE | - |
| testcase_46 | RE | - |
| testcase_47 | RE | - |
| testcase_48 | RE | - |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 05 JUL 2024 07:55:49 PM): ; wrote /home/judge/data/code/Main.fasl ; compilation finished in 0:00:00.112
ソースコード
(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 ()
(let* ((n (read))
(p (- (read) 1))
(q (- (read) 1))
(as (make-array n :element-type 'uint31 :initial-element 0 :adjustable t :fill-pointer n)))
(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)))
(setq as (next-permutation! as))
(when (< (position p as) (position q as))
(%write as))
#>as
(let* ((pos (position q as))
(rights (coerce (subseq as pos n) 'list))
(right-max (reduce #'max rights)))
(setq as (coerce (subseq as 0 pos) '(and vector (not simple-vector))))
#>as
(loop while (= q right-max)
when (zerop (length as))
do (println -1)
(return-from main)
do (let ((new (vector-pop as)))
#>as
(push new rights)
(when (> new right-max)
(maxf right-max new)
(return))))
(setq rights (sort rights #'<))
#>as
#>rights
(let ((q-next (bisect-right (coerce rights 'vector) q))
(res (make-array n :element-type 'uint31 :fill-pointer 0)))
(loop for a across as
do (vector-push a res))
#>res
(cond ((= q-next p)
(vector-push q-next res)
(setq rights (delete q-next rights))
(loop for x in rights
do (vector-push x res)))
((< p q)
(vector-push q-next res)
(setq rights (delete q-next rights))
(loop for x in rights
do (vector-push x res)))
((> p q)
(vector-push q-next res)
(setq rights (delete q-next rights))
(setq rights (delete q rights))
(loop for x in rights
do (vector-push x res)
when (= x p)
do (vector-push q res)))
(t (error "Huh?")))
(%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
")))