結果

問題 No.1093 区間の和 / Sum of Range
ユーザー dot_haraai
提出日時 2021-03-28 16:56:30
言語 Nim
(2.2.0)
結果
AC  
実行時間 93 ms / 2,000 ms
コード長 1,068 bytes
コンパイル時間 4,072 ms
コンパイル使用メモリ 89,032 KB
実行使用メモリ 9,216 KB
最終ジャッジ日時 2024-11-29 09:15:11
合計ジャッジ時間 7,900 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 36
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve()=
  var
    (n,k) = (scan(),scan())
    a = newseqwith(n,scan())
    c = newseqwith(n-k+1,0)
    q = scan()
    x = newseqwith(q,(0,0))
    res = newseqwith(q,0)

  for i in 0..<q:
    x[i]=(scan(),i)

  c[0]=a[0..<k].sum()
  for i in 1..<n-k+1:
    c[i]=c[i-1]-a[i-1]+a[i+k-1]
  
  c.sort(SortOrder.Ascending)
  x.sort(SortOrder.Ascending)
  #echo c
  #echo x
  var idx=0
  for (v, i) in x:
    while idx<c.len and c[idx]<=v:
      idx+=1
    #echo fmt"({v},{i}),{idx}"
    res[i] = idx
  echo res.join("\n")



  


solve()
0