結果
問題 |
No.987 N×Mマス計算(基本)
|
ユーザー |
![]() |
提出日時 | 2025-06-27 02:07:15 |
言語 | Scheme (Gauche-0.9.15) |
結果 |
AC
|
実行時間 | 144 ms / 2,000 ms |
コード長 | 2,505 bytes |
コンパイル時間 | 261 ms |
コンパイル使用メモリ | 8,228 KB |
実行使用メモリ | 26,124 KB |
最終ジャッジ日時 | 2025-06-27 02:07:20 |
合計ジャッジ時間 | 4,698 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 18 |
ソースコード
(use scheme.list) (use util.match) (use srfi.13) ; string (use srfi.42) ; list-ec (use srfi.197) ; chain (use gauche.collection) (use gauche.generator) (define input read-line) (define (ii) (string->number (read-line))) (define (li) (let ((s (read-line))) (map string->number (string-split s " ")))) (define (prn . args) (for-each (lambda (i x) (when (> i 0) (display " ")) (display x)) (iota (length args)) args) (newline)) (define int string->number) (define str x->string) (define-method min ((xs <sequence>)) (apply min xs)) (define-method max ((xs <sequence>)) (apply max xs)) (define (minmax . xs) (values->list (apply min&max xs))) (define-method minmax ((xs <sequence>)) (values->list (apply min&max xs))) (define (sum xs) (apply + xs)) (define (divmod a b) (values->list (div-and-mod a b))) (define (1+ n) (+ n 1)) (define (1- n) (- n 1)) (define (!= a b) (not (= a b))) (define pow (case-lambda ((a b) (expt a b)) ((a b m) (expt-mod a b m)))) (define isqrt exact-integer-sqrt) (define ++ string-append) (define-method frequencies ((xs <sequence>)) (rlet1 ht (make-hash-table) (for-each (^x (hash-table-update! ht x 1+ 0)) xs))) (define (pairwise xs) (zip xs (cdr xs))) (define (yn b) (prn (if b "Yes" "No"))) (define-macro (input! bindings . body) (let loop ((bs (reverse bindings)) (res '())) (if (null? bs) `(let*-values ,res ,@body) (cond ((symbol? (car bs)) (loop (cdr bs) (cons `((,(car bs)) (values (ii))) res))) ((list? (car bs)) (loop (cdr bs) (cons `(,(car bs) (apply values (li))) res))) (else 'error))))) (define mlet1 match-let1) (define (slide xs k :key step) (let* ((n (length xs)) (step (if (undefined? step) k step))) (let loop ((xs xs) (res '())) (if (null? xs) (reverse res) (loop (drop* xs step) (cons (take* xs k) res)))))) (define-macro (mfn pat . body) (let ((arg (gensym))) `(lambda (,arg) (mlet1 ,pat ,arg ,@body)))) (mlet1 (N M) (li) (let* ((ss (string-split (input) " ")) (op (if (string=? (car ss) "+") + *)) (B (map int (cdr ss))) (A (list-ec (: _ N) (ii)))) (dolist (a A) (apply prn (map (^b (op a b)) B)))))