Submission #1221342
Source Code Expand
# A N = int(input()) A = list(map(int, input().split())) res = 1 status = 0 a = A[0] for i in range(1, N): if A[i] > a: if status == 1: a = A[i] elif status == 0: a = A[i] status = 1 elif status == -1: res += 1 status = 0 a = A[i] elif A[i] < a: if status == 1: res += 1 status = 0 a = A[i] elif status == 0: a = A[i] status = -1 elif status == -1: a = A[i] else: pass print(res)
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | hoxosh |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 628 Byte |
Status | AC |
Exec Time | 76 ms |
Memory | 14436 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 17 ms | 3064 KB |
sample_02.txt | AC | 17 ms | 3064 KB |
sample_03.txt | AC | 17 ms | 3064 KB |
subtask_1_01.txt | AC | 54 ms | 9736 KB |
subtask_1_02.txt | AC | 39 ms | 8196 KB |
subtask_1_03.txt | AC | 33 ms | 6292 KB |
subtask_1_04.txt | AC | 76 ms | 14100 KB |
subtask_1_05.txt | AC | 74 ms | 14096 KB |
subtask_1_06.txt | AC | 74 ms | 14224 KB |
subtask_1_07.txt | AC | 76 ms | 14052 KB |
subtask_1_08.txt | AC | 59 ms | 14436 KB |
subtask_1_09.txt | AC | 75 ms | 14052 KB |
subtask_1_10.txt | AC | 17 ms | 3064 KB |
subtask_1_11.txt | AC | 17 ms | 3064 KB |