Submission #5192168
Source Code Expand
;; -*- coding: utf-8 -*-
(eval-when (:compile-toplevel :load-toplevel :execute)
(defparameter OPT
#+swank '(optimize (speed 3) (safety 2))
#-swank '(optimize (speed 3) (safety 0) (debug 0)))
#+swank (progn (ql:quickload '(:cl-debug-print :fiveam))
(shadow :run)
(use-package :fiveam)))
#+swank (cl-syntax:use-syntax cl-debug-print:debug-print-syntax)
;; BEGIN_INSERTED_CONTENTS
(defmacro nlet (name args &body body)
(labels ((ensure-list (x) (if (listp x) x (list x))))
(let ((args (mapcar #'ensure-list args)))
`(labels ((,name ,(mapcar #'car args) ,@body))
(,name ,@(mapcar #'cadr args))))))
;; (with-memoizing (:hash-table :test #'equal :key #'cons)
;; (defun ...))
;; (with-memoizing (:array (10 10 * 10) :initial-element -1 :element-type 'fixnum)
;; (defun foo (a b c d) ...) ; C is ignored.
(declaim (type (integer 0 #.most-positive-fixnum) *recursion-depth*))
(defparameter *recursion-depth* 0)
(defmacro with-memoizing (cache-attribs def-form)
(let* ((cache-attribs (if (atom cache-attribs) (list cache-attribs) cache-attribs))
(cache-type (first cache-attribs))
(dimensions-with-* (when (eql cache-type :array) (second cache-attribs)))
(dimensions (remove '* dimensions-with-*))
(rank (length dimensions))
(rest-attribs (ecase cache-type
(:hash-table (cdr cache-attribs))
(:array (cddr cache-attribs))))
(key (prog1 (getf rest-attribs :key) (remf rest-attribs :key)))
(debug (prog1 (getf rest-attribs :debug) (remf rest-attribs :debug)))
(cache-form (case cache-type
(:hash-table `(make-hash-table ,@rest-attribs))
(:array `(make-array (list ,@dimensions) ,@rest-attribs))))
(initial-element (when (eql cache-type :array)
(assert (member :initial-element rest-attribs))
(getf rest-attribs :initial-element))))
(let ((cache (gensym))
(value (gensym))
(present-p (gensym))
(name-alias (gensym))
(args-lst (gensym))
(indices (loop repeat rank collect (gensym))))
(labels ((debug (name args obj)
(let ((value (gensym)))
(if debug
`(progn
(format t "~A~A: (~A ~{~A~^ ~}) =>~%"
(make-string *recursion-depth*
:element-type 'base-char
:initial-element #\ )
*recursion-depth*
',name
(list ,@args))
(let ((,value (let ((*recursion-depth* (1+ *recursion-depth*)))
,obj)))
(format t "~A~A: (~A ~{~A~^ ~}) => ~A~%"
(make-string *recursion-depth*
:element-type 'base-char
:initial-element #\ )
*recursion-depth*
',name
(list ,@args)
,value)
,value))
obj)))
(make-cache-check-form (cache-type name args)
(debug name
args
(case cache-type
(:hash-table
`(let ((,args-lst (funcall ,(or key #'list) ,@args)))
(multiple-value-bind (,value ,present-p)
(gethash ,args-lst ,cache)
(if ,present-p
,value
(setf (gethash ,args-lst ,cache)
(,name-alias ,@args))))))
(:array
(let ((memoized-args (loop for dimension in dimensions-with-*
for arg in args
unless (eql dimension '*)
collect arg)))
(if key
`(multiple-value-bind ,indices
(funcall ,key ,@memoized-args)
(let ((,value (aref ,cache ,@indices)))
(if (eql ,initial-element ,value)
(setf (aref ,cache ,@indices)
(,name-alias ,@args))
,value)))
`(let ((,value (aref ,cache ,@memoized-args)))
(if (eql ,initial-element ,value)
(setf (aref ,cache ,@memoized-args)
(,name-alias ,@args))
,value))))))))
(make-reset-form (cache-type)
(case cache-type
(:hash-table `(setf ,cache (make-hash-table ,@rest-attribs)))
(:array `(prog1 nil
(fill (array-storage-vector ,cache) ,initial-element)))))
(make-reset-name (name)
(intern (format nil "RESET-~A" (symbol-name name))))
(extract-declarations (body)
(remove-if-not (lambda (form) (eql 'declare (car form))) body)))
(ecase (car def-form)
((defun)
(destructuring-bind (_ name args &body body) def-form
(declare (ignore _))
`(let ((,cache ,cache-form))
(defun ,(make-reset-name name) () ,(make-reset-form cache-type))
(defun ,name ,args
,@(extract-declarations body)
(labels ((,name-alias ,args ,@body))
(declare (inline ,name-alias))
,(make-cache-check-form cache-type name args))))))
((nlet)
(destructuring-bind (_ name bindings &body body) def-form
(declare (ignore _))
`(let ((,cache ,cache-form))
(nlet ,name ,bindings
,@(extract-declarations body)
,(let ((args (mapcar (lambda (x) (if (atom x) x (car x))) bindings)))
`(labels ((,name-alias ,args ,@body))
(declare (inline ,name-alias))
,(make-cache-check-form cache-type name args)))))))
((labels flet)
(destructuring-bind (_ definitions &body labels-body) def-form
(declare (ignore _))
(destructuring-bind (name args &body body) (car definitions)
`(let ((,cache ,cache-form))
(,(car def-form)
((,(make-reset-name name) () ,(make-reset-form cache-type))
(,name ,args
,@(extract-declarations body)
(labels ((,name-alias ,args ,@body))
(declare (inline ,name-alias))
,(make-cache-check-form cache-type name args)))
,@(cdr definitions))
(declare (ignorable #',(make-reset-name name)))
,@labels-body))))))))))
;; (test with-memoizing
;; (finishes (macroexpand `(with-memoizing (:hash-table :test #'equal)
;; (defun add (x y) (+ x y)))))
;; (finishes (macroexpand `(with-memoizing (:array '(10 10)
;; :element-type 'fixnum
;; :initial-element -1)
;; (defun add (x y) (+ x y)))))
;; (finishes (macroexpand `(with-memoizing (:array '(10 10)
;; :element-type 'fixnum
;; :initial-element -1)
;; (labels ((add (x y) (+ x y))
;; (my-print (x) (print x)))
;; (add 1 2))))))
;; -*- coding:utf-8 -*-
(defstruct (queue (:constructor make-queue
(&optional list &aux (tail (last list)))))
(list nil :type list)
(tail nil :type (or null (cons t null))))
(declaim (inline enqueue))
(defun enqueue (obj queue)
(symbol-macrolet ((list (queue-list queue))
(tail (queue-tail queue)))
(if (null list)
(setf tail (list obj)
list tail)
(setf (cdr tail) (list obj)
tail (cdr tail))))
queue)
(declaim (inline dequeue))
(defun dequeue (queue)
(pop (queue-list queue)))
(declaim (inline queue-empty-p))
(defun queue-empty-p (queue)
(null (queue-list queue)))
(declaim (inline enqueue-front))
(defun enqueue-front (obj queue)
(symbol-macrolet ((list (queue-list queue))
(tail (queue-tail queue)))
(if (null list)
(setf tail (list obj)
list tail)
(push obj list))
queue))
(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))
(a (- (read) 1))
(b (- (read) 1))
(m (read))
(graph (make-array n :element-type 'list :initial-element nil))
;; dist . city
(q (make-queue))
(dists (make-array n :element-type 'uint8 :initial-element #xff))
(dag (make-array n :element-type 'list :initial-element nil)))
(declare (uint8 n a b m))
(dotimes (_ m)
(let ((x (- (read) 1))
(y (- (read) 1)))
(push y (aref graph x))
(push x (aref graph y))))
(enqueue (cons 0 a) q)
(setf (aref dists a) 0)
(loop until (queue-empty-p q)
for (dist . city) of-type (uint8 . uint8) = (dequeue q)
do (dolist (neighbor (aref graph city))
(when (= #xff (aref dists neighbor))
(setf (aref dists neighbor) (+ 1 dist))
(enqueue (cons (+ 1 dist) neighbor) q))))
(dotimes (i n)
(dolist (neighbor (aref graph i))
(when (= (+ 1 (aref dists i)) (aref dists neighbor))
(push neighbor (aref dag i)))))
(println
(with-memoizing (:array (100) :element-type 'uint32 :initial-element #xffffffff)
(nlet recur ((x a))
(if (= x b)
1
(loop with res of-type uint32 = 0
for neighbor in (aref dag x)
do (setf res (mod (+ res (recur neighbor)) +mod+))
finally (return res))))))))
#-swank(main)
Submission Info
Submission Time |
|
Task |
C - 正直者の高橋くん |
User |
sansaqua |
Language |
Common Lisp (SBCL 1.1.14) |
Score |
100 |
Code Size |
11886 Byte |
Status |
AC |
Exec Time |
359 ms |
Memory |
42840 KiB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
359 ms |
42840 KiB |
subtask0_sample_02.txt |
AC |
109 ms |
23012 KiB |
subtask1_01.txt |
AC |
108 ms |
23008 KiB |
subtask1_02.txt |
AC |
109 ms |
23012 KiB |
subtask1_03.txt |
AC |
108 ms |
23012 KiB |
subtask1_04.txt |
AC |
109 ms |
23008 KiB |
subtask1_05.txt |
AC |
109 ms |
23012 KiB |
subtask1_06.txt |
AC |
109 ms |
23012 KiB |
subtask1_07.txt |
AC |
109 ms |
23016 KiB |
subtask1_08.txt |
AC |
108 ms |
23012 KiB |
subtask1_09.txt |
AC |
109 ms |
23008 KiB |
subtask1_10.txt |
AC |
108 ms |
23016 KiB |
subtask1_11.txt |
AC |
109 ms |
23008 KiB |
subtask1_12.txt |
AC |
109 ms |
23012 KiB |
subtask1_13.txt |
AC |
109 ms |
23012 KiB |
subtask1_14.txt |
AC |
109 ms |
23012 KiB |
subtask1_15.txt |
AC |
109 ms |
23012 KiB |
subtask1_16.txt |
AC |
109 ms |
23008 KiB |
subtask1_17.txt |
AC |
109 ms |
23016 KiB |
subtask1_18.txt |
AC |
111 ms |
23012 KiB |
subtask1_19.txt |
AC |
109 ms |
23012 KiB |
subtask1_20.txt |
AC |
109 ms |
23012 KiB |
subtask1_21.txt |
AC |
109 ms |
23012 KiB |
subtask1_22.txt |
AC |
109 ms |
23008 KiB |
subtask1_23.txt |
AC |
108 ms |
23008 KiB |
subtask1_24.txt |
AC |
108 ms |
23012 KiB |
subtask1_25.txt |
AC |
109 ms |
23008 KiB |
subtask1_26.txt |
AC |
109 ms |
23012 KiB |
subtask1_27.txt |
AC |
109 ms |
23012 KiB |
subtask1_28.txt |
AC |
109 ms |
23008 KiB |
subtask1_29.txt |
AC |
108 ms |
23008 KiB |
subtask1_30.txt |
AC |
108 ms |
23012 KiB |