結果
問題 | No.935 う し た ぷ に き あ く ん 笑 ビ - ム |
ユーザー | dot_haraai |
提出日時 | 2021-03-09 22:51:04 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 223 ms / 2,000 ms |
コード長 | 1,959 bytes |
コンパイル時間 | 4,534 ms |
コンパイル使用メモリ | 86,784 KB |
実行使用メモリ | 35,200 KB |
最終ジャッジ日時 | 2024-04-19 20:24:42 |
合計ジャッジ時間 | 8,596 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 8 ms
5,248 KB |
testcase_01 | AC | 15 ms
7,808 KB |
testcase_02 | AC | 8 ms
8,448 KB |
testcase_03 | AC | 20 ms
10,880 KB |
testcase_04 | AC | 32 ms
19,328 KB |
testcase_05 | AC | 13 ms
10,752 KB |
testcase_06 | AC | 92 ms
11,136 KB |
testcase_07 | AC | 85 ms
16,640 KB |
testcase_08 | AC | 223 ms
34,688 KB |
testcase_09 | AC | 129 ms
20,736 KB |
testcase_10 | AC | 148 ms
21,184 KB |
testcase_11 | AC | 191 ms
32,548 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | AC | 1 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 78 ms
35,200 KB |
testcase_18 | AC | 77 ms
20,864 KB |
testcase_19 | AC | 150 ms
11,008 KB |
testcase_20 | AC | 145 ms
30,968 KB |
testcase_21 | AC | 14 ms
5,376 KB |
testcase_22 | AC | 13 ms
10,112 KB |
testcase_23 | AC | 2 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 2 ms
5,376 KB |
testcase_26 | AC | 2 ms
5,376 KB |
testcase_27 | AC | 1 ms
5,376 KB |
testcase_28 | AC | 2 ms
5,376 KB |
testcase_29 | AC | 3 ms
5,376 KB |
testcase_30 | AC | 2 ms
5,376 KB |
testcase_31 | AC | 2 ms
5,376 KB |
testcase_32 | AC | 2 ms
5,376 KB |
testcase_33 | AC | 107 ms
32,768 KB |
testcase_34 | AC | 168 ms
27,904 KB |
testcase_35 | AC | 144 ms
29,056 KB |
testcase_36 | AC | 40 ms
15,872 KB |
testcase_37 | AC | 103 ms
30,336 KB |
testcase_38 | AC | 84 ms
11,264 KB |
testcase_39 | AC | 170 ms
28,800 KB |
testcase_40 | AC | 185 ms
29,536 KB |
testcase_41 | AC | 182 ms
29,696 KB |
testcase_42 | AC | 147 ms
30,640 KB |
testcase_43 | AC | 187 ms
29,952 KB |
testcase_44 | AC | 52 ms
7,424 KB |
testcase_45 | AC | 201 ms
34,432 KB |
testcase_46 | AC | 16 ms
5,376 KB |
testcase_47 | AC | 69 ms
9,728 KB |
testcase_48 | AC | 71 ms
21,248 KB |
testcase_49 | AC | 64 ms
10,368 KB |
testcase_50 | AC | 91 ms
20,864 KB |
testcase_51 | AC | 101 ms
18,944 KB |
testcase_52 | AC | 95 ms
18,688 KB |
testcase_53 | AC | 180 ms
34,560 KB |
testcase_54 | AC | 44 ms
18,304 KB |
testcase_55 | AC | 6 ms
5,376 KB |
testcase_56 | AC | 140 ms
28,160 KB |
testcase_57 | AC | 84 ms
17,152 KB |
testcase_58 | AC | 2 ms
5,376 KB |
testcase_59 | AC | 1 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]
ソースコード
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: #echo fmt" {breakCost[x+1]-breakCost[x]}" #echo " ",tryIt(x,x,p), tryIt(x,n-1,p) if not tryIt(x,x,p): res.max=0 elif tryIt(x,n-1,p): res.max=enemyCount[x][n-1-x] 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()