Submission #3451312
Source Code Expand
N = int(input()) A = list(map(int, input().split())) if N == 1: print(1) elif N == 2: print(1) else: L = [] for i in range(1, N): x = A[i] - A[i - 1] if x > 0: L.append("+") elif x == 0: L.append(".") else: L.append("-") c = 1 judge = L[0] for i in range(1,N - 1): if L[i] == ".": pass elif L[i] == "+": if judge == "+" or judge == ".": judge = "+" else: c += 1 judge = "." else: if judge == "-" or judge == ".": judge = "-" else: c += 1 judge = "." print(c)
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | su_565fx |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 573 Byte |
Status | AC |
Exec Time | 108 ms |
Memory | 14484 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 | 67 ms | 9768 KB |
subtask_1_02.txt | AC | 54 ms | 8356 KB |
subtask_1_03.txt | AC | 40 ms | 6292 KB |
subtask_1_04.txt | AC | 107 ms | 14484 KB |
subtask_1_05.txt | AC | 102 ms | 14480 KB |
subtask_1_06.txt | AC | 103 ms | 14480 KB |
subtask_1_07.txt | AC | 108 ms | 14052 KB |
subtask_1_08.txt | AC | 83 ms | 14052 KB |
subtask_1_09.txt | AC | 103 ms | 14052 KB |
subtask_1_10.txt | AC | 17 ms | 3064 KB |
subtask_1_11.txt | AC | 17 ms | 3064 KB |