結果

問題 No.935 う　し　た　ぷ　に　き　あ く ん 笑　ビ　－　ム
ユーザー dot_haraaidot_haraai
提出日時 2021-03-09 22:46:16
言語 Nim
(2.0.2)
結果
WA  
実行時間 -
コード長 1,862 bytes
コンパイル時間 3,575 ms
コンパイル使用メモリ 87,148 KB
実行使用メモリ 35,072 KB
最終ジャッジ日時 2024-10-11 12:38:29
合計ジャッジ時間 9,822 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 16 ms
7,808 KB
testcase_02 AC 8 ms
8,448 KB
testcase_03 AC 22 ms
10,880 KB
testcase_04 AC 35 ms
19,328 KB
testcase_05 AC 14 ms
10,752 KB
testcase_06 AC 99 ms
11,136 KB
testcase_07 AC 94 ms
16,640 KB
testcase_08 AC 237 ms
34,688 KB
testcase_09 AC 139 ms
20,736 KB
testcase_10 AC 163 ms
21,228 KB
testcase_11 AC 203 ms
32,512 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 WA -
testcase_15 AC 2 ms
5,248 KB
testcase_16 AC 1 ms
5,248 KB
testcase_17 AC 90 ms
35,072 KB
testcase_18 AC 84 ms
20,864 KB
testcase_19 AC 167 ms
11,008 KB
testcase_20 AC 152 ms
30,976 KB
testcase_21 AC 16 ms
5,248 KB
testcase_22 AC 13 ms
10,112 KB
testcase_23 AC 2 ms
5,248 KB
testcase_24 AC 2 ms
5,248 KB
testcase_25 AC 3 ms
5,248 KB
testcase_26 AC 3 ms
5,248 KB
testcase_27 AC 2 ms
5,248 KB
testcase_28 AC 2 ms
5,248 KB
testcase_29 AC 3 ms
5,248 KB
testcase_30 AC 3 ms
5,248 KB
testcase_31 AC 2 ms
5,248 KB
testcase_32 AC 3 ms
5,248 KB
testcase_33 AC 115 ms
32,768 KB
testcase_34 AC 170 ms
27,904 KB
testcase_35 AC 153 ms
29,056 KB
testcase_36 AC 43 ms
15,872 KB
testcase_37 AC 117 ms
30,336 KB
testcase_38 AC 92 ms
11,264 KB
testcase_39 AC 181 ms
28,672 KB
testcase_40 AC 197 ms
29,440 KB
testcase_41 AC 195 ms
29,696 KB
testcase_42 AC 156 ms
30,720 KB
testcase_43 AC 204 ms
29,824 KB
testcase_44 AC 56 ms
7,424 KB
testcase_45 AC 211 ms
34,432 KB
testcase_46 AC 19 ms
5,248 KB
testcase_47 AC 75 ms
9,728 KB
testcase_48 AC 73 ms
21,148 KB
testcase_49 AC 65 ms
10,368 KB
testcase_50 AC 99 ms
20,736 KB
testcase_51 AC 108 ms
19,072 KB
testcase_52 AC 106 ms
18,432 KB
testcase_53 AC 190 ms
34,432 KB
testcase_54 AC 48 ms
18,304 KB
testcase_55 AC 8 ms
5,248 KB
testcase_56 AC 146 ms
28,416 KB
testcase_57 AC 90 ms
17,280 KB
testcase_58 AC 2 ms
5,248 KB
testcase_59 AC 2 ms
5,248 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()=
  var
    n = scan()
    s = read()
    a = newseqwith(n,scan())
    enemyCount = newseqwith(n,newseqwith(n,0))
    breakCost = newseqwith(n+1,0)
    Q = scan()
    k = newseqwith(Q,scan())
  for i in 1..n:
    breakCost[i]=breakCost[i-1]+a[i-1]
  for x in 0..<n:
    if s[x]=='E':
      enemyCount[x][0]=1
    for y in x+1..<n:
      if s[y]=='E':
        enemyCount[x][y-x] = enemyCount[x][y-1-x] + 1
      else:
        enemyCount[x][y-x] = enemyCount[x][y-1-x]
  
  #echo enemyCount.join("\n")

  #echo breakCost
  proc tryIt(x,m:int,p:int):bool=
    return breakCost[m+1]-breakCost[x]<=p




  proc binSearch(x,p,left,right:int):int=
    if left+1==right:
      return left
    else:
      var mid = (left+right).div(2)
      if tryIt(x,mid,p):
        return binSearch(x,p,mid,right)
      else:
        return binSearch(x,p,left,mid)
  
  for q in 0..<Q:
    var
      res = 0
      p = k[q]
    #echo "query ", q
    #echo "pow ", p
    for x in 0..<n:
      if not tryIt(x,x,p):
        res.max=0
      elif tryIt(x,n-1,p):
        res.max=enemyCount[x][n-1]
      else:
        var right = binSearch(x,p,0,n-1)
        #echo fmt"  {x} => {right} (cost: {breakCost[right+1]-breakCost[x]})"
        #echo fmt"  {tryIt(x,right,p)}"
        res.max=enemyCount[x][right-x]
    echo res


      







  
solve()
0