結果
| 問題 | No.922 東北きりきざむたん |
| ユーザー |
 sansaqua
|
| 提出日時 | 2019-11-08 23:06:42 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 13,623 bytes |
| コンパイル時間 | 846 ms |
| コンパイル使用メモリ | 94,880 KB |
| 実行使用メモリ | 820,344 KB |
| 最終ジャッジ日時 | 2024-09-15 02:14:49 |
| 合計ジャッジ時間 | 30,280 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 26 ms
32,276 KB |
| testcase_01 | AC | 26 ms
31,436 KB |
| testcase_02 | AC | 24 ms
29,604 KB |
| testcase_03 | AC | 25 ms
29,600 KB |
| testcase_04 | AC | 62 ms
64,076 KB |
| testcase_05 | AC | 29 ms
32,400 KB |
| testcase_06 | AC | 84 ms
93,476 KB |
| testcase_07 | AC | 101 ms
125,140 KB |
| testcase_08 | AC | 111 ms
110,712 KB |
| testcase_09 | TLE | - |
| testcase_10 | TLE | - |
| testcase_11 | TLE | - |
| testcase_12 | TLE | - |
| testcase_13 | TLE | - |
| testcase_14 | TLE | - |
| testcase_15 | TLE | - |
| testcase_16 | TLE | - |
| testcase_17 | TLE | - |
| testcase_18 | TLE | - |
| testcase_19 | MLE | - |
| testcase_20 | TLE | - |
| testcase_21 | MLE | - |
| testcase_22 | MLE | - |
| testcase_23 | MLE | - |
| testcase_24 | MLE | - |
| testcase_25 | MLE | - |
| testcase_26 | AC | 1,145 ms
428,812 KB |
| testcase_27 | MLE | - |
| testcase_28 | TLE | - |
| testcase_29 | AC | 712 ms
58,456 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 15 SEP 2024 02:13:58 AM): ; file: /home/judge/data/code/Main.lisp ; in: DEFUN BUILD-LCA-TABLE ; (AREF GRAPH V) ; ; note: unable to ; optimize ; due to type uncertainty: ; The first argument is a VECTOR, not a SIMPLE-STRING. ; ; note: unable to ; avoid runtime dispatch on array element type ; due to type uncertainty: ; The first argument is a VECTOR, not a SIMPLE-ARRAY. ; in: DEFUN MAIN ; (AS (MAKE-ARRAY Q :ELEMENT-TYPE 'UINT31)) ; ; caught STYLE-WARNING: ; The variable AS is defined but never used. ; (BS (MAKE-ARRAY Q :ELEMENT-TYPE 'UINT31)) ; ; caught STYLE-WARNING: ; The variable BS is defined but never used. ; (= CHILD PARENT) ; ; note: unable to ; open-code FLOAT to RATIONAL comparison ; due to type uncertainty: ; The first argument is a NUMBER, not a SINGLE-FLOAT. ; ; note: unable to ; open-code FLOAT to RATIONAL comparison ; due to type uncertainty: ; The first argument is a NUMBER, not a DOUBLE-FLOAT. ; ; note: unable to ; open-code FLOAT to RATIONAL comparison ; due to type uncertainty: ; The first argument is a NUMBER, not a (COMPLEX SINGLE-FLOAT). ; ; note: unable to ; open-code FLOAT to RATIONAL comparison ; due to type uncertainty: ; The first argument is a NUMBER, not a (COMPLEX DOUBLE-FLOAT). ; ; note: unable to open code because: The operands might not be the same type. ; ; note: unable to ; open-code FLOAT to RATIONAL comparison ; due to type uncertainty: ; The first argument is a NUMBER, not a SINGLE-FLOAT. ; ; note: unable to ; open-code FLOAT to RATIONAL comparison ; due to type uncertainty: ; The first argument is a NUMBER, not a DOUBLE-FLOAT. ; ; note: unable to ; open-code FLOAT to RATIONAL comparison ; due to type uncertainty: ; The first argument is a NUMBER, not a (COMPLEX SINGLE-FLOAT). ; ; note: unable to ; open-code FLOAT to RATIONAL comparison ; due to type uncertainty: ; The first argument is a NUMBER,
ソースコード
#-swank
(unless (member :child-sbcl *features*)
(quit
:unix-status
(process-exit-code
(run-program *runtime-pathname*
`("--control-stack-size" "128MB"
"--noinform" "--disable-ldb" "--lose-on-corruption" "--end-runtime-options"
"--eval" "(push :child-sbcl *features*)"
"--script" ,(namestring *load-pathname*))
:output t :error t :input t))))
;; -*- 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
;;;
;;; Disjoint set by Union-Find algorithm
;;;
(defstruct (disjoint-set
(:constructor make-disjoint-set
(size &aux (data (make-array size :element-type 'fixnum :initial-element -1))))
(:conc-name ds-))
(data nil :type (simple-array fixnum (*))))
(declaim (ftype (function * (values (mod #.array-total-size-limit) &optional)) ds-root))
(defun ds-root (disjoint-set x)
"Returns the root of X."
(declare (optimize (speed 3))
((mod #.array-total-size-limit) x))
(let ((data (ds-data disjoint-set)))
(if (< (aref data x) 0)
x
(setf (aref data x)
(ds-root disjoint-set (aref data x))))))
(declaim (inline ds-unite!))
(defun ds-unite! (disjoint-set x1 x2)
"Destructively unites X1 and X2 and returns true iff X1 and X2 become
connected for the first time."
(let ((root1 (ds-root disjoint-set x1))
(root2 (ds-root disjoint-set x2)))
(unless (= root1 root2)
(let ((data (ds-data disjoint-set)))
;; ensure the size of root1 >= the size of root2
(when (> (aref data root1) (aref data root2))
(rotatef root1 root2))
(incf (aref data root1) (aref data root2))
(setf (aref data root2) root1)))))
(declaim (inline ds-connected-p))
(defun ds-connected-p (disjoint-set x1 x2)
"Returns true iff X1 and X2 have the same root."
(= (ds-root disjoint-set x1) (ds-root disjoint-set x2)))
(declaim (inline ds-size))
(defun ds-size (disjoint-set x)
"Returns the size of the connected component to which X belongs."
(- (aref (ds-data disjoint-set)
(ds-root disjoint-set x))))
(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)
;;;
;;; Lowest common ancestor of tree by binary lifting
;;; build: O(nlog(n))
;;; query: O(log(n))
;;;
;; PAY ATTENTION TO THE STACK SIZE! BUILD-LCA-TABLE does DFS.
(deftype lca-vertex-number () '(signed-byte 32))
(defstruct (lca-table
(:constructor make-lca-table
(size
&aux
;; requires 1 + log_2{size-1}
(max-level (+ 1 (integer-length (- size 2))))
(depths (make-array size :element-type 'lca-vertex-number))
(parents (make-array (list size max-level)
:element-type 'lca-vertex-number))))
(:conc-name lca-))
(max-level nil :type (integer 0 #.most-positive-fixnum))
(depths nil :type (simple-array lca-vertex-number (*)))
(parents nil :type (simple-array lca-vertex-number (* *))))
(defun build-lca-table (root graph &key (key #'identity))
"GRAPH := vector of adjacency lists"
(declare #.OPT
(vector graph)
(function key))
(let* ((size (length graph))
(lca-table (make-lca-table size))
(depths (lca-depths lca-table))
(parents (lca-parents lca-table))
(max-level (lca-max-level lca-table)))
(labels ((dfs (v prev-v depth)
(declare (lca-vertex-number v prev-v))
(setf (aref depths v) depth)
(setf (aref parents v 0) prev-v)
(dolist (node (aref graph v))
(let ((dest (funcall key node)))
(declare (lca-vertex-number dest))
(unless (= dest prev-v)
(dfs dest v (+ 1 depth)))))))
(dfs root -1 0)
(dotimes (k (- max-level 1))
(dotimes (v size)
(if (= -1 (aref parents v k))
(setf (aref parents v (+ k 1)) -1)
(setf (aref parents v (+ k 1)) (aref parents (aref parents v k) k)))))
lca-table)))
(defun get-lca (u v lca-table)
"Returns the lowest common ancestor of the vertices U and V."
(declare #.OPT
(lca-vertex-number u v))
(let* ((depths (lca-depths lca-table))
(parents (lca-parents lca-table))
(max-level (lca-max-level lca-table)))
;; Ensures depth[u] <= depth[v]
(when (> (aref depths u) (aref depths v)) (rotatef u v))
(dotimes (k max-level)
(when (logbitp k (- (aref depths v) (aref depths u)))
(setf v (aref parents v k))))
(if (= u v)
u
(loop for k from (- max-level 1) downto 0
unless (= (aref parents u k) (aref parents v k))
do (setf u (aref parents u k)
v (aref parents v k))
finally (return (aref parents u 0))))))
(declaim (inline distance-on-tree))
(defun distance-on-tree (u v lca-table)
"Returns the distance of U and V."
(declare (optimize (speed 3)))
(let ((depths (lca-depths lca-table))
(lca (get-lca u v lca-table)))
(+ (- (aref depths u) (aref depths lca))
(- (aref depths v) (aref depths lca)))))
;;;
;;; Body
;;;
(defconstant +inf+ #xffffffff)
(define-modify-macro minf (new-value) min)
(defun main ()
(declare #.OPT)
(let* ((n (read))
(m (read))
(q (read))
(graph (make-array n :element-type 'list :initial-element nil))
(as (make-array q :element-type 'uint31))
(bs (make-array q :element-type 'uint31))
(dset (make-disjoint-set n))
(lcas (make-array n :element-type t :initial-element nil))
(weights (make-array n :element-type 'uint31 :initial-element 0))
(sums (make-array n :element-type 'uint32 :initial-element 0))
(flows (make-array n :element-type 'uint32 :initial-element 0))
(result (make-array n :element-type 'uint32 :initial-element 0))
(base-distance 0))
(declare (uint31 n m q))
(dotimes (i m)
(let ((u (- (read-fixnum) 1))
(v (- (read-fixnum) 1)))
(push u (aref graph v))
(push v (aref graph u))
(ds-unite! dset u v)))
(dotimes (i n)
(let ((root (ds-root dset i)))
(unless (aref lcas root)
(setf (aref lcas root)
(build-lca-table root graph)))))
(dotimes (i q)
(let ((a (- (read-fixnum) 1))
(b (- (read-fixnum) 1)))
(if (ds-connected-p dset a b)
(let ((root (ds-root dset a)))
(incf base-distance (distance-on-tree a b (aref lcas root))))
(progn (incf (aref weights a))
(incf (aref weights b))))))
(gc :full t)
(labels ((dfs (v parent)
(declare (int32 v parent))
(let ((value 0)
(flow 0))
(declare (uint31 value flow))
(dolist (child (aref graph v))
(unless (= child parent)
(dfs child v)
(incf flow (+ (aref weights child)
(aref flows child)))
(incf value (+ (aref weights child)
(aref sums child)
(aref flows child)))))
(setf (aref sums v) value
(aref flows v) flow)))
(dfs2 (v parent)
(declare (int32 v parent))
(let ((value 0)
(flow 0))
(declare (uint31 value flow))
(dolist (child (aref graph v))
(incf value (+ (aref weights child)
(aref sums child)
(aref flows child)))
(incf flow (+ (aref weights child)
(aref flows child))))
(setf (aref result v) value)
(setf (aref sums v) value)
(setf (aref flows v) flow))
(dolist (child (aref graph v))
(unless (= child parent)
(let ((current-sum (aref sums v))
(current-flow (aref flows v)))
(decf (aref sums v) (+ (aref weights child)
(aref flows child)
(aref sums child)))
(decf (aref flows v) (+ (aref weights child)
(aref flows child)))
(dfs2 child v)
(setf (aref sums v) current-sum)
(setf (aref flows v) current-flow))))))
(dotimes (v n)
(when (= (ds-root dset v) v)
(dfs v -1)))
(dbg sums flows)
(dotimes (v n)
(when (= (ds-root dset v) v)
(dfs2 v -1)))
(let ((processed (make-hash-table)))
(dotimes (v n)
(let* ((root (ds-root dset v))
(value (aref result v)))
(if (gethash root processed)
(minf (gethash root processed) value)
(setf (gethash root processed) value))))
#>result
(println (+ base-distance
(loop for x being each hash-value of processed
sum x)))
processed))))
#-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)))