結果
| 問題 | No.1189 Sum is XOR |
| ユーザー |
 sansaqua
|
| 提出日時 | 2020-08-22 14:10:16 |
| 言語 | Common Lisp (sbcl 2.3.8) |
| 結果 |
AC
|
| 実行時間 | 309 ms / 2,000 ms |
| コード長 | 7,139 bytes |
| コンパイル時間 | 845 ms |
| コンパイル使用メモリ | 51,652 KB |
| 実行使用メモリ | 73,932 KB |
| 最終ジャッジ日時 | 2024-10-15 08:26:03 |
| 合計ジャッジ時間 | 4,816 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 242 ms
63,652 KB |
| testcase_01 | AC | 159 ms
49,356 KB |
| testcase_02 | AC | 129 ms
47,424 KB |
| testcase_03 | AC | 19 ms
26,920 KB |
| testcase_04 | AC | 18 ms
26,792 KB |
| testcase_05 | AC | 24 ms
29,008 KB |
| testcase_06 | AC | 29 ms
30,912 KB |
| testcase_07 | AC | 20 ms
26,920 KB |
| testcase_08 | AC | 15 ms
29,008 KB |
| testcase_09 | AC | 14 ms
26,920 KB |
| testcase_10 | AC | 14 ms
26,664 KB |
| testcase_11 | AC | 173 ms
51,496 KB |
| testcase_12 | AC | 129 ms
49,300 KB |
| testcase_13 | AC | 238 ms
59,812 KB |
| testcase_14 | AC | 237 ms
61,644 KB |
| testcase_15 | AC | 255 ms
67,752 KB |
| testcase_16 | AC | 309 ms
73,932 KB |
| testcase_17 | AC | 203 ms
55,592 KB |
| testcase_18 | AC | 147 ms
47,532 KB |
| testcase_19 | AC | 239 ms
61,896 KB |
| testcase_20 | AC | 290 ms
68,008 KB |
| testcase_21 | AC | 84 ms
39,084 KB |
| testcase_22 | AC | 85 ms
43,176 KB |
コンパイルメッセージ
; compiling file "/home/judge/data/code/Main.lisp" (written 15 OCT 2024 08:25:57 AM): ; wrote /home/judge/data/code/Main.fasl ; compilation finished in 0:00:00.091
ソースコード
(in-package :cl-user)
(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)
(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)
(defconstant +mod+ 998244353)
(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* 'double-float))
(prog1 (princ obj stream) (terpri stream))))
;; BEGIN_INSERTED_CONTENTS
(defpackage :cp/read-fixnum
(:use :cl)
(:export #:read-fixnum))
(in-package :cp/read-fixnum)
(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))))))))
;;;
;;; Arithmetic operations with static modulus
;;;
(defpackage :cp/mod-operations
(:use :cl)
(:export #:define-mod-operations))
(in-package :cp/mod-operations)
;; NOTE: Currently MOD* and MOD+ doesn't apply MOD when the number of
;; parameters is one. For simplicity I won't fix it for now.
(defmacro define-mod-operations (divisor)
(let ((mod* (intern "MOD*"))
(mod+ (intern "MOD+"))
(incfmod (intern "INCFMOD"))
(decfmod (intern "DECFMOD"))
(mulfmod (intern "MULFMOD")))
`(progn
(defun ,mod* (&rest args)
(reduce (lambda (x y) (mod (* x y) ,divisor)) args))
(defun ,mod+ (&rest args)
(reduce (lambda (x y) (mod (+ x y) ,divisor)) args))
#+sbcl
(eval-when (:compile-toplevel :load-toplevel :execute)
(locally (declare (sb-ext:muffle-conditions warning))
(sb-c:define-source-transform ,mod* (&rest args)
(if (null args)
1
(reduce (lambda (x y) `(mod (* ,x ,y) ,',divisor)) args)))
(sb-c:define-source-transform ,mod+ (&rest args)
(if (null args)
0
(reduce (lambda (x y) `(mod (+ ,x ,y) ,',divisor)) args)))))
(define-modify-macro ,incfmod (delta)
(lambda (x y) (mod (+ x y) ,divisor)))
(define-modify-macro ,decfmod (delta)
(lambda (x y) (mod (- x y) ,divisor)))
(define-modify-macro ,mulfmod (multiplier)
(lambda (x y) (mod (* x y) ,divisor))))))
;; BEGIN_USE_PACKAGE
(eval-when (:compile-toplevel :load-toplevel :execute)
(use-package :cp/mod-operations :cl-user))
(eval-when (:compile-toplevel :load-toplevel :execute)
(use-package :cp/read-fixnum :cl-user))
(in-package :cl-user)
;;;
;;; Body
;;;
(define-mod-operations +mod+)
(defconstant +smax+ (ash 1 10))
(defun main ()
(let* ((n (read))
(k (read))
(acounter (make-array +smax+ :element-type 'uint31 :initial-element 0)))
(declare (uint31 n k))
(dotimes (i n)
(incf (aref acounter (read-fixnum))))
(when (> k 10)
(println 0)
(return-from main))
(let ((dp (make-array (list (+ 1 +smax+) (+ k 1) +smax+)
:element-type 'uint31
:initial-element 0)))
#>acounter
(setf (aref dp 0 0 0) 1)
(dotimes (a +smax+)
(let ((acount (aref acounter a)))
(dotimes (s +smax+)
(dotimes (y (+ k 1))
(when (and (< y k) (zerop (logand a s)))
(incfmod (aref dp (+ a 1) (+ y 1) (logior a s))
(mod* (aref dp a y s) acount)))
(incfmod (aref dp (+ a 1) y s) (aref dp a y s))))))
(let ((res 0))
(dotimes (s +smax+)
(incfmod res (aref dp (- +smax+ 1) k s)))
(println res)))))
#-swank (main)
;;;
;;; Test and benchmark
;;;
#+swank
(defun get-clipbrd ()
(with-output-to-string (out)
#+os-windows (run-program "powershell.exe" '("-Command" "Get-Clipboard") :output out :search t)
#+os-unix (run-program "xsel" '("-b" "-o") :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* (or out (make-string-output-stream)))
(res (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))))))
(if out res (get-output-stream-string *standard-output*))))
#+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
(equal "2
"
(run "3 2
1 2 5
" nil)))
(it.bese.fiveam:is
(equal "1
"
(run "2 2
1 2
" nil))))