Submission #1691007
Source Code Expand
#include<iostream> using namespace std; int a[100005]={0}; int n; int main(){ cin>>n; for(int i=0;i<n;++i) cin>>a[i]; int ans=1; bool x1= false, x2 = false; for(int i=1;i<n;i++){ if(x1==false&&x2==false) { if(a[i]<a[i-1]) x2=true; else if(a[i]>a[i-1]) x1=true; } else if(x1==true) { if(a[i]<a[i-1]) { ans++; x1=false; } } else if(x2==true) { if(a[i]>a[i-1]) { ans++; x2=false; } } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | justin_cao |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 669 Byte |
Status | AC |
Exec Time | 58 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 | 27 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 | 56 ms | 640 KB |
subtask_1_06.txt | AC | 54 ms | 640 KB |
subtask_1_07.txt | AC | 57 ms | 640 KB |
subtask_1_08.txt | AC | 55 ms | 640 KB |
subtask_1_09.txt | AC | 58 ms | 640 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |