Submission #3817691
Source Code Expand
#include <iostream> using namespace std; int updown(int i, int j){ if(i<j) return 1; if(i>j) return 0; } int main() { int N; cin >> N; int A[100010]; for(int i=0; i<N; ++i) cin >> A[i]; int P=1; int ud=2; for(int i=1; i<N; ++i){ if(A[i-1]!=A[i]){ if(ud!=2 && ud!=updown(A[i-1], A[i])){ ++P; ud=2; } else ud=updown(A[i-1], A[i]); } } cout << P << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | ward1302 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 470 Byte |
Status | AC |
Exec Time | 55 ms |
Memory | 640 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 | 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 | 33 ms | 512 KB |
subtask_1_02.txt | AC | 26 ms | 384 KB |
subtask_1_03.txt | AC | 17 ms | 384 KB |
subtask_1_04.txt | AC | 54 ms | 640 KB |
subtask_1_05.txt | AC | 53 ms | 640 KB |
subtask_1_06.txt | AC | 55 ms | 640 KB |
subtask_1_07.txt | AC | 54 ms | 640 KB |
subtask_1_08.txt | AC | 54 ms | 640 KB |
subtask_1_09.txt | AC | 54 ms | 640 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |