結果

問題 No.1722 [Cherry 3rd Tune C] In my way
ユーザー norioc
提出日時 2025-07-21 15:12:08
言語 Scheme
(Gauche-0.9.15)
結果
AC  
実行時間 353 ms / 2,000 ms
コード長 7,167 bytes
コンパイル時間 300 ms
コンパイル使用メモリ 8,096 KB
実行使用メモリ 38,280 KB
最終ジャッジ日時 2025-07-21 15:12:18
合計ジャッジ時間 9,475 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

(use srfi.13)  ; string
(use srfi.42)  ; list-ec
(use srfi.197) ; chain
(use gauche.array)
(use gauche.collection)
(use gauche.dictionary)
(use gauche.generator)
(use gauche.sequence)
(use scheme.ideque)
(use scheme.list)
(use scheme.set)
(use scheme.sort)
(use util.combinations)
(use util.match)
(use data.queue)

(define (input)
  (string-trim-both (read-line)))

(define (ii)
  (string->number (input)))

(define (li)
  (let ((s (input)))
    (map string->number (string-split s " "))))

(define (prn . args)
  (prn* args))

(define-method prn* ((seq <sequence>))
  (for-each-with-index (^(i x)
                         (when (> i 0)
                           (display " "))
                         (display x))
                       seq)
  (newline))

(define (prn-yn b)
  (prn (if b "Yes" "No")))

(define-syntax ->/prn
  (syntax-rules ()
    ((_ x fns ...)
     (-> x fns ... prn))))

(define-syntax prn/d
  (syntax-rules ()
    ((_ expr ...)
     (with-output-to-port (current-error-port)
       (^()
         (prn expr ...))))))

(define int string->number)
(define str x->string)
(define string* (apply$ string))

(define-method min ((xs <sequence>))
  (fold min (~ xs 0) xs))
(define-method max ((xs <sequence>))
  (fold max (~ xs 0) xs))

(define (minmax . xs)
  (values->list (apply min&max xs)))
(define-method minmax ((xs <sequence>))
  (values->list (apply min&max xs)))

(define (sum xs)
  (fold + 0 xs))

(define (divmod a b)
  (values->list (div-and-mod a b)))

(define (ceildiv a b)
  (div (+ a (1- b)) b))

(define (1+ n) (+ n 1))
(define (1- n) (- n 1))
(define (!= a b) (not (= a b)))
(define (midpoint a b) (div (+ a b) 2))

(define pow
  (case-lambda
   ((a b) (expt a b))
   ((a b m) (expt-mod a b m))))

(define gcd* (apply$ gcd))
(define isqrt exact-integer-sqrt)

(define ++ string-append)

(define zip (map$ list))
(define all every)
(define any-ec any?-ec)
(define all-ec every?-ec)
(define concat concatenate)

(define (pairwise xs)
  (zip xs (cdr xs)))

(define (comb n k)
  (if (or (< k 0) (> k n))
      0
      (let loop ((i 0)
                 (x 1))
        (if (= i k)
            x
            (loop (1+ i) (div (* x (- n i)) (1+ i)))))))

#;
(define-method frequencies ((xs <sequence>))
  (rlet1 dict (make-dict)
    (for-each (^x (dict-update! dict x 1+ 0))
              xs)))

(define-method frequencies ((xs <sequence>))
  (let1 ht (make-hash-table equal-comparator)
    (for-each (^x (dict-update! ht x 1+ 0)) xs)

    (match-lambda*
     (('get key)
      (hash-table-get ht key 0))
     (('get key default)
      (hash-table-get ht key default))
     (('keys)
      (hash-table-keys ht))
     (('values)
      (hash-table-values ht))
     (('contains? key)
      (hash-table-contains? ht key))
     (('items)
      (hash-table->alist ht)))))

(define-macro (input! vars . body)
  (let ((binds (map (^x
                     (cond
                      ((symbol? x)
                       `((,x) (values (ii))))
                      ((list? x)
                       (if (= 1 (length x))
                           `(,x (values (li)))
                           `(,x (apply values (li)))))
                      (else
                       (error "symbol or list required, but got:" x))))
                    vars)))
    `(let*-values ,binds
       ,@body)))

(define-macro (! self quoted-name . args)
  (let ((name (cadr quoted-name)))
    `(,name ,self ,@args)))

(define-macro (d/ . args)
  (let ((ss (map (^(expr)
                   `(list ,(x->string expr) ,expr))
                 args)))
    `(prn/d (list ,@ss))))

(define mlet match-let)
(define mlet* match-let*)
(define mlet1 match-let1)

(define-macro (mfn pat . body)
  (let ((arg (gensym)))
    `(lambda (,arg)
       (mlet1 ,pat ,arg
         ,@body))))

(define-syntax count-ec
  (syntax-rules ()
    ((_ qualifiers ...)
     (sum-ec qualifiers ... 1))))

(define-method len ((coll <collection>))
  (size-of coll))

(define (accum xs)
  (define (proc a b)
    (let1 t (+ a b)
      (values t t)))
  (map-accum proc 0 xs))

(define (digits n)
  (map digit->integer (str n)))

(define (digits->int ds)
  (fold-left (^(a b) (+ (* 10 a) b)) 0 ds))

(define (-> x . fns)
  (call-with-values (^() (values x))
    (apply compose (reverse fns))))

(define (rep n thunk)
  (list-ec (: _ n)
           (thunk)))

(define (memoize fn)
  (let ((cache (make-hash-table 'equal?)))
    (lambda args
      (if (hash-table-exists? cache args)
          (hash-table-get cache args)
          (let ((val (apply fn args)))
            (hash-table-put! cache args val)
            val)))))

(define (zip-longest . args)
  (let* ((n (apply max (map length args)))
         (xxs (map (^(xs)
                     (append xs (make-list (- n (length xs)) #f)))
                   args)))
    (map (pa$ delete #f)
         (apply zip xxs))))

(define (set-from xs)
  (apply set eqv-comparator xs))

(define (difference xs ys)
  (let ((excludes (set-from ys)))
    (filter (^x (not (set-contains? excludes x))) xs)))

;; <hash-table>

(define (make-dict)
  (make-hash-table eqv-comparator))

(define-method get ((ht <hash-table>) key :optional (default 0))
  (hash-table-get ht key default))

(define-method put! ((ht <hash-table>) key value)
  (hash-table-put! ht key value))

(define-method keys ((ht <hash-table>))
  (hash-table-keys ht))

(define-method values ((ht <hash-table>))
  (hash-table-values ht))

;; <ideque>

(define-method back ((deq <ideque>))
  (ideque-back deq))

(define-method append ((deq <ideque>) x)
  (ideque-add-back deq x))

(define-method pop ((deq <ideque>))
  (ideque-remove-back deq))

(define-method len ((deq <ideque>))
  (ideque-length deq))

(define-class <sorted-set> ()
  ((tree-map :getter get-tree-map :init-keyword :tree-map)))

(define (make-sorted-set :optional (comparator default-comparator))
  (make <sorted-set>
    :tree-map (make-tree-map comparator)))

(define-method empty? ((ss <sorted-set>))
  (tree-map-empty? (get-tree-map ss)))

(define-method len ((ss <sorted-set>))
  (size-of (get-tree-map ss)))

(define-method contains? ((ss <sorted-set>) val)
  (tree-map-contains? (get-tree-map ss) val))

(define-method add! ((ss <sorted-set>) val)
  (tree-map-put! (get-tree-map ss) val #t))

(define-method < ((ss <sorted-set>) val)
  (tree-map-predecessor-key (get-tree-map ss) val))

(define-method <= ((ss <sorted-set>) val)
  (tree-map-floor-key (get-tree-map ss) val))

(define-method > ((ss <sorted-set>) val)
  (tree-map-successor-key (get-tree-map ss) val))

(define-method >= ((ss <sorted-set>) val)
  (tree-map-ceiling-key (get-tree-map ss) val))

(define-method find-nearest ((ss <sorted-set>) (val <integer>))
  (let ((a (! ss'<= val))
        (b (! ss'> val)))
    (cond
     ((and a b)
      (if (<= (- val a) (- b val)) a b))
     (a a)
     (b b)
     (else #f))))

(define (list->sorted-set xs :key (comparator default-comparator))
  (let* ((ss (make-sorted-set)))
    (for-each (^x
               (d/ ss x)
               (add! ss x)) xs)
    ss))

(input! ((N M) (X) (Y))
  (let ((ss (list->sorted-set Y)))
    (dolist (x X)
      (->/prn
       (if-let1 v (! ss'> x)
         (- v x)
         "Infinity")))))
0