Submission #1241404

Source Code Expand

import sys

N=int(input())
if N<=2:
    print(1)
    sys.exit()

A=[int(i) for i in input().split(" ")]


count=1
i=1
while i<N-1:
    if A[i]>A[i+1] and A[i]>A[i-1]:
        count+=1
        i+=1
    elif A[i]<A[i+1] and A[i]<A[i-1]:
        count+=1
        i+=1
    i+=1

print(count)

Submission Info

Submission Time
Task A - Sorted Arrays
User Fulltea
Language Python (3.4.3)
Score 0
Code Size 310 Byte
Status WA
Exec Time 106 ms
Memory 14252 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 15
WA × 2
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 18 ms 3060 KB
sample_02.txt AC 17 ms 3064 KB
sample_03.txt AC 17 ms 3064 KB
subtask_1_01.txt AC 57 ms 9608 KB
subtask_1_02.txt AC 60 ms 8196 KB
subtask_1_03.txt AC 43 ms 6324 KB
subtask_1_04.txt AC 86 ms 14228 KB
subtask_1_05.txt AC 106 ms 14252 KB
subtask_1_06.txt AC 83 ms 14252 KB
subtask_1_07.txt WA 86 ms 14060 KB
subtask_1_08.txt AC 89 ms 14060 KB
subtask_1_09.txt WA 87 ms 14060 KB
subtask_1_10.txt AC 17 ms 3064 KB
subtask_1_11.txt AC 18 ms 3064 KB