結果
問題 | No.1077 Noelちゃんと星々4 |
ユーザー | dot_haraai |
提出日時 | 2021-06-11 20:01:41 |
言語 | Nim (2.0.2) |
結果 |
AC
|
実行時間 | 157 ms / 2,000 ms |
コード長 | 1,382 bytes |
コンパイル時間 | 3,884 ms |
コンパイル使用メモリ | 87,040 KB |
実行使用メモリ | 83,328 KB |
最終ジャッジ日時 | 2024-05-08 13:56:26 |
合計ジャッジ時間 | 6,600 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 109 ms
58,112 KB |
testcase_03 | AC | 140 ms
74,368 KB |
testcase_04 | AC | 47 ms
24,448 KB |
testcase_05 | AC | 36 ms
19,072 KB |
testcase_06 | AC | 60 ms
30,848 KB |
testcase_07 | AC | 66 ms
35,200 KB |
testcase_08 | AC | 52 ms
26,496 KB |
testcase_09 | AC | 45 ms
23,168 KB |
testcase_10 | AC | 140 ms
74,368 KB |
testcase_11 | AC | 93 ms
49,152 KB |
testcase_12 | AC | 80 ms
40,960 KB |
testcase_13 | AC | 35 ms
18,304 KB |
testcase_14 | AC | 139 ms
72,704 KB |
testcase_15 | AC | 77 ms
39,808 KB |
testcase_16 | AC | 51 ms
27,008 KB |
testcase_17 | AC | 85 ms
44,672 KB |
testcase_18 | AC | 141 ms
75,648 KB |
testcase_19 | AC | 35 ms
17,664 KB |
testcase_20 | AC | 1 ms
5,376 KB |
testcase_21 | AC | 157 ms
83,328 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, 37) Warning: imported and not used: 'deques' [UnusedImport] /home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport] /home/judge/data/code/Main.nim(2, 44) Warning: imported and not used: 'heapqueue' [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] /home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
ソースコード
import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets import critbits, future, strformat, deques,heapqueue 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() y = newseqwith(n,scan()) ymin=y.min() ymax = y.max()-y.min() dp = newseqwith(n,newseqwith(ymax+1,int.high.div(4))) smallerVal = newseqwith(2,newseqwith(ymax+1,int.high.div(4))) if n==1: return 0 for i in 0..<n: y[i]-=ymin for tail in 0..<ymax: dp[0][tail]=abs(y[0]-tail) if tail>0: smallerVal[0][tail]=min(smallerVal[0][tail-1],dp[0][tail]) else: smallerVal[0][tail]=dp[0][tail] for i in 1..<n: var now = i.mod(2) var prev = (i+1).mod(2) for tail in 0..ymax: dp[i][tail].min=smallerVal[prev][tail]+abs(y[i]-tail) if tail>0: smallerVal[now][tail]=min(smallerVal[now][tail-1],dp[i][tail]) else: smallerVal[now][tail]=dp[i][tail] return smallerVal[(n-1).mod(2)][^1] echo solve()