結果
問題 | No.1160 Strange Bowling |
ユーザー |
|
提出日時 | 2021-03-25 19:39:23 |
言語 | Nim (2.2.0) |
結果 |
AC
|
実行時間 | 57 ms / 2,000 ms |
コード長 | 1,285 bytes |
コンパイル時間 | 4,251 ms |
コンパイル使用メモリ | 86,400 KB |
実行使用メモリ | 9,344 KB |
最終ジャッジ日時 | 2024-11-27 04:54:03 |
合計ジャッジ時間 | 6,678 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
コンパイルメッセージ
/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():int= var n = scan() p = newseqwith(n,0) a = newseqwith(n,0) dp = newseqwith(n,newseqwith(2,0)) for i in 0..<n: (p[i],a[i])=(scan(),scan()) # dp[i][0]: iターン目でai本以外倒した # dp[i][1]: iターン目でai本倒した(i+1ターン目で倒した本数にa(i+1)を加える) if a[0]==p[0]: dp[0][0]=p[0]-1 dp[0][1]=a[0] else: dp[0][0]=p[0] dp[0][1]=a[0] for i in 1..<n: if p[i]==a[i]: dp[i][0]=max(dp[i-1][0]+p[i]-1,dp[i-1][1]+(p[i]-1)*2) dp[i][1]=max(dp[i-1][0]+p[i],dp[i-1][1]+p[i]*2) else: dp[i][0]=max(dp[i-1][0]+p[i],dp[i-1][1]+p[i]*2) dp[i][1]=max(dp[i-1][0]+a[i],dp[i-1][1]+a[i]*2) #echo dp return max(dp[n-1]) echo solve()