結果

問題 No.944 煎っぞ!
ユーザー dot_haraai
提出日時 2021-04-03 14:07:09
言語 Nim
(2.2.0)
結果
TLE  
実行時間 -
コード長 1,185 bytes
コンパイル時間 4,791 ms
コンパイル使用メモリ 87,088 KB
実行使用メモリ 18,640 KB
最終ジャッジ日時 2024-12-24 19:24:01
合計ジャッジ時間 86,054 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 17 TLE * 18
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(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]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [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()
    a = newseqwith(n,scan())
    ca = newseqwith(n+1,0)
  for i in 0..<n:
    ca[i+1]=ca[i]+a[i]
 # echo ca
  proc devide(d:int):int=
    var
      le = 0
      length = 1
      cnt = 0
    while le<n:
      
      while le+length<=n and ca[le+length]-ca[le]<d:
        length+=1
      #echo le,", ",length, ", "
      #echo ca[le+length]-ca[le]
      if le+length<=n and ca[le+length]-ca[le] == d:
        cnt+=1
        le=le+length
        length=1
      else:
        return 0
    return cnt

  for d in a.max()..a.sum():
    result.max=devide(d)
    if result>0:
      return 
    
    
    

  
echo solve()
0