結果
問題 | No.505 カードの数式2 |
ユーザー | dot_haraai |
提出日時 | 2021-06-20 03:41:07 |
言語 | Nim (2.0.2) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,483 bytes |
コンパイル時間 | 3,908 ms |
コンパイル使用メモリ | 87,624 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-22 22:26:01 |
合計ジャッジ時間 | 4,766 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 1 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 1 ms
5,376 KB |
testcase_11 | WA | - |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 1 ms
5,376 KB |
testcase_14 | WA | - |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 2 ms
5,376 KB |
testcase_20 | AC | 1 ms
5,376 KB |
testcase_21 | AC | 2 ms
5,376 KB |
testcase_22 | AC | 1 ms
5,376 KB |
testcase_23 | AC | 1 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 1 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 | WA | - |
testcase_30 | WA | - |
testcase_31 | 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() a = newseqwith(n,scan()) dp = newseqwith(n,newseqwith(2,0)) # dp[i][0]:最小値 # dp[i][1]:最大値 dp[0][0]=a[0] dp[0][1]=a[0] for i in 1..<n: if a[i]!=0: dp[i][0].min=min(@[dp[i-1][0]-a[i],dp[i-1][0]+a[i],dp[i-1][0]*a[i],dp[i-1][0].div(a[i])]) dp[i][0].min=min(@[dp[i-1][1]-a[i],dp[i-1][1]+a[i],dp[i-1][1]*a[i],dp[i-1][1].div(a[i])]) dp[i][1].max=max(@[dp[i-1][0]-a[i],dp[i-1][0]+a[i],dp[i-1][0]*a[i],dp[i-1][0].div(a[i])]) dp[i][1].max=max(@[dp[i-1][1]-a[i],dp[i-1][1]+a[i],dp[i-1][1]*a[i],dp[i-1][1].div(a[i])]) else: dp[i][0].min=min(@[dp[i-1][0]-a[i],dp[i-1][0]+a[i],dp[i-1][0]*a[i]]) dp[i][0].min=min(@[dp[i-1][1]-a[i],dp[i-1][1]+a[i],dp[i-1][1]*a[i]]) dp[i][1].max=max(@[dp[i-1][0]-a[i],dp[i-1][0]+a[i],dp[i-1][0]*a[i]]) dp[i][1].max=max(@[dp[i-1][1]-a[i],dp[i-1][1]+a[i],dp[i-1][1]*a[i]]) echo dp[n-1][1] solve()