結果
問題 | No.1095 Smallest Kadomatsu Subsequence |
ユーザー |
|
提出日時 | 2021-03-28 16:28:38 |
言語 | Nim (2.2.0) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 1,061 bytes |
コンパイル時間 | 3,108 ms |
コンパイル使用メモリ | 86,140 KB |
実行使用メモリ | 11,776 KB |
最終ジャッジ日時 | 2024-11-29 09:13:32 |
合計ジャッジ時間 | 5,821 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
コンパイルメッセージ
/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, intsetsimport critbits, future, strformat, dequestemplate `max=`(x,y) = x = max(x,y)template `min=`(x,y) = x = min(x,y)template `mod=`(x,y) = x = x mod ytemplate 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().parseIntproc scanf(): float = read().parseFloatproc toInt(c:char): int =return int(c) - int('0')proc solve():int=varn = scan()inf = int.high.div(2)a = newseqwith(n,scan())minL = newseqwith(n,inf)minR = newseqwith(n,inf)minL[0]=a[0]minR[n-1]=a[n-1]result=inffor i in 1..<n:minL[i]=min(minL[i-1],a[i])minR[n-i-1]=min(minR[n-i-1+1],a[n-1-i])#echo minL#echo minRfor i in 1..<n-1:if (minL[i-1]<a[i] and a[i]>minR[i+1]) or(minL[i-1]>a[i] and a[i]<minR[i+1]):result.min=(minL[i-1]+a[i]+minR[i+1])if result == inf:return -1echo solve()