結果

問題 No.1095 Smallest Kadomatsu Subsequence
ユーザー dot_haraaidot_haraai
提出日時 2021-03-28 16:28:38
言語 Nim
(2.0.2)
結果
AC  
実行時間 42 ms / 2,000 ms
コード長 1,061 bytes
コンパイル時間 3,283 ms
コンパイル使用メモリ 87,528 KB
実行使用メモリ 11,776 KB
最終ジャッジ日時 2024-05-06 22:44:21
合計ジャッジ時間 5,482 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 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 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 1 ms
5,376 KB
testcase_13 AC 3 ms
5,376 KB
testcase_14 AC 3 ms
5,376 KB
testcase_15 AC 3 ms
5,376 KB
testcase_16 AC 3 ms
5,376 KB
testcase_17 AC 3 ms
5,376 KB
testcase_18 AC 3 ms
5,376 KB
testcase_19 AC 3 ms
5,376 KB
testcase_20 AC 3 ms
5,376 KB
testcase_21 AC 3 ms
5,376 KB
testcase_22 AC 3 ms
5,376 KB
testcase_23 AC 42 ms
11,776 KB
testcase_24 AC 41 ms
11,776 KB
testcase_25 AC 41 ms
11,776 KB
testcase_26 AC 42 ms
11,776 KB
testcase_27 AC 41 ms
11,776 KB
testcase_28 AC 38 ms
11,776 KB
testcase_29 AC 39 ms
11,776 KB
testcase_30 AC 39 ms
11,776 KB
testcase_31 AC 39 ms
11,776 KB
testcase_32 AC 38 ms
11,776 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]

ソースコード

diff # 

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()
    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=inf
  for 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 minR
  for 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 -1
    


  
  

echo solve()
0