Submission #1473385


Source Code Expand

import strutils, sequtils

let
  N = stdin.readline.parseInt
  A = stdin.readline.split.map(parseInt)
var dp = newSeqWith(N, newSeqWith(2, 0))
dp[0][0] = 1
dp[0][1] = 1

for i in 0..<(N-1):
  dp[i + 1][0] = min(dp[i][0], dp[i][1]) + 1
  dp[i + 1][1] = min(dp[i][0], dp[i][1]) + 1
  if A[i] <= A[i + 1]:
    dp[i + 1][0] = min(dp[i + 1][0], dp[i][0])
  if A[i] >= A[i + 1]:
    dp[i + 1][1] = min(dp[i + 1][1], dp[i][1])
dp[N-1].min.echo

Submission Info

Submission Time
Task A - Sorted Arrays
User n_knuu
Language Nim (0.13.0)
Score 300
Code Size 454 Byte
Status AC
Exec Time 35 ms
Memory 18052 KB

Compile Error

Hint: system [Processing]
Hint: Main [Processing]
Hint: strutils [Processing]
Hint: parseutils [Processing]
Hint: sequtils [Processing]
Hint:  [Link]
Hint: operation successful (12945 lines compiled; 1.872 sec total; 14.143MB; Release Build) [SuccessX]

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 17
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt AC 22 ms 10884 KB
subtask_1_02.txt AC 17 ms 8704 KB
subtask_1_03.txt AC 11 ms 5376 KB
subtask_1_04.txt AC 35 ms 18052 KB
subtask_1_05.txt AC 35 ms 18052 KB
subtask_1_06.txt AC 35 ms 18052 KB
subtask_1_07.txt AC 35 ms 18052 KB
subtask_1_08.txt AC 35 ms 18052 KB
subtask_1_09.txt AC 35 ms 18052 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB