結果

問題 No.944 煎っぞ!
ユーザー dot_haraaidot_haraai
提出日時 2021-04-03 17:06:14
言語 Nim
(2.0.2)
結果
AC  
実行時間 441 ms / 3,000 ms
コード長 1,698 bytes
コンパイル時間 3,329 ms
コンパイル使用メモリ 86,400 KB
実行使用メモリ 5,760 KB
最終ジャッジ日時 2024-06-07 04:03:39
合計ジャッジ時間 6,784 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 67 ms
5,248 KB
testcase_01 AC 66 ms
5,376 KB
testcase_02 AC 65 ms
5,376 KB
testcase_03 AC 65 ms
5,376 KB
testcase_04 AC 68 ms
5,376 KB
testcase_05 AC 68 ms
5,376 KB
testcase_06 AC 67 ms
5,376 KB
testcase_07 AC 66 ms
5,376 KB
testcase_08 AC 68 ms
5,376 KB
testcase_09 AC 67 ms
5,376 KB
testcase_10 AC 1 ms
5,376 KB
testcase_11 AC 11 ms
5,376 KB
testcase_12 AC 3 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 74 ms
5,376 KB
testcase_15 AC 3 ms
5,376 KB
testcase_16 AC 1 ms
5,376 KB
testcase_17 AC 1 ms
5,376 KB
testcase_18 AC 11 ms
5,376 KB
testcase_19 AC 11 ms
5,376 KB
testcase_20 AC 432 ms
5,760 KB
testcase_21 AC 441 ms
5,760 KB
testcase_22 AC 22 ms
5,376 KB
testcase_23 AC 25 ms
5,376 KB
testcase_24 AC 26 ms
5,376 KB
testcase_25 AC 25 ms
5,376 KB
testcase_26 AC 26 ms
5,376 KB
testcase_27 AC 13 ms
5,632 KB
testcase_28 AC 2 ms
5,376 KB
testcase_29 AC 2 ms
5,376 KB
testcase_30 AC 433 ms
5,760 KB
testcase_31 AC 20 ms
5,376 KB
testcase_32 AC 16 ms
5,376 KB
testcase_33 AC 14 ms
5,376 KB
testcase_34 AC 14 ms
5,376 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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 binSearch(le,n,deli:int):(int,bool)=
    
    var
      left = le+1
      right = n
    #echo fmt"le:{le}, left:{left}, right:{n}"
    if ca[right]-ca[le]<deli:
      return (-1,true)
    if ca[right]-ca[le]==deli:
      return (right,false)
    if ca[left]-ca[le]>deli:
      return (-1,true)
    var
      mid:int
    while left+1<right:
      #echo fmt"left:{left},{ca[left]-ca[le]},  right:{right}, {ca[right]-ca[le]}"
      mid = (left+right).div(2)
      if ca[mid]-ca[le]>deli:
        right=mid
      else:
        left=mid
    if ca[left]-ca[le]==deli:
      return (left,false)
    else:
      return (-1,true)


  proc devide(deli:int):int=
    #echo fmt"deli: {deli}"
    var
      le = 0
      err = false
    while le!=n:
      (le, err) = binSearch(le,n,deli)
      if err:
        return 0
      else:
        result+=1
    #if result==38:
      #echo "!!! deli = ", deli
      

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

  
echo solve()
0