Submission #1221811


Source Code Expand

n = int(input())
a_ = list(map(int, input().split(' ')))
a = [-1]
i = 0
while  i < n:
    if a[-1] != a_[i]:
        a.append(a_[i])
    i += 1
a = a[1:]

ret = 1

i = 0
while i < n-2:
    if (a[i] > a[i+1] and a[i+1] < a[i+2]) or (a[i] < a[i+1] and a[i+1] > a[i+2]):
        ret += 1
        i += 2
    else:
        i += 1
        
print(ret)

Submission Info

Submission Time
Task A - Sorted Arrays
User marshi
Language Python (3.4.3)
Score 0
Code Size 364 Byte
Status RE
Exec Time 128 ms
Memory 14436 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 2
RE × 1
AC × 10
RE × 7
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 RE 19 ms 3316 KB
sample_02.txt AC 17 ms 3064 KB
sample_03.txt AC 17 ms 3064 KB
subtask_1_01.txt AC 74 ms 9736 KB
subtask_1_02.txt RE 70 ms 8196 KB
subtask_1_03.txt AC 50 ms 6324 KB
subtask_1_04.txt AC 107 ms 14228 KB
subtask_1_05.txt RE 128 ms 14224 KB
subtask_1_06.txt AC 109 ms 14224 KB
subtask_1_07.txt RE 117 ms 14052 KB
subtask_1_08.txt RE 59 ms 14436 KB
subtask_1_09.txt RE 111 ms 14052 KB
subtask_1_10.txt AC 17 ms 3064 KB
subtask_1_11.txt AC 17 ms 3064 KB