Submission #1801114
Source Code Expand
#include<iostream> #include<string> #include<vector> #include<utility> #include<queue> #include<algorithm> #include<cmath> #include<cstdio> #include<cstring> #include<cstdlib> #include<complex> #define INF 2147483647 #define llINF 9223372036854775807 #define pb push_back #define mp make_pair #define F first #define S second #define ll long long using namespace std; int main(){ int n;cin>>n; int minus=0;int plus=0; int now;cin>>now;ll ans=0; for(int i=1;i<n;i++){ int a;cin>>a; if(now<a&&plus==minus){plus=1;} else if(now>a&&plus==minus){minus=1;} if(plus==1&&now>a){plus=0;ans++;} else if(minus==1&&now<a){minus=0;ans++;} now=a; } cout<<ans+1<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | shi |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 741 Byte |
Status | AC |
Exec Time | 55 ms |
Memory | 256 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 | 256 KB |
subtask_1_02.txt | AC | 26 ms | 256 KB |
subtask_1_03.txt | AC | 17 ms | 256 KB |
subtask_1_04.txt | AC | 54 ms | 256 KB |
subtask_1_05.txt | AC | 54 ms | 256 KB |
subtask_1_06.txt | AC | 55 ms | 256 KB |
subtask_1_07.txt | AC | 55 ms | 256 KB |
subtask_1_08.txt | AC | 53 ms | 256 KB |
subtask_1_09.txt | AC | 55 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |