結果

問題 No.1148 土偶Ⅲ
ユーザー dot_haraai
提出日時 2021-05-28 22:29:55
言語 Nim
(2.2.0)
結果
AC  
実行時間 46 ms / 2,000 ms
コード長 971 bytes
コンパイル時間 4,200 ms
コンパイル使用メモリ 86,784 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-07 09:55:07
合計ジャッジ時間 6,211 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [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():int=
  var
    n = scan()
    w = scan()
    a = newseqwith(n,scan())
    left = 0
    cum = 0
    exists = initHashSet[int]()
  for right in 0..<n:
    while left < right and (cum > w or a[right] in exists):
      cum-=a[left]
      exists.excl(a[left])
      left+=1
    exists.incl(a[right])
    cum+=a[right]
    if cum<w:
      result.max=right-left+1
    
    
    #echo fmt"{left}, {right}"


      

  

  
echo solve()
0