Submission #1692334
Source Code Expand
#include<bits/stdc++.h> #define rep(i,n) for(int i=0;i<(n);i++) #define loop(i,x,n) for(int i=(x);i<(n);i++) #define all(x) (x).begin(),(x).end() #define pb push_back #define mp make_pair #define fir first #define sec second #define ub upper_bound #define lb lower_bound //#define int long long using namespace std; const int MOD=1000000007; const int INF=1000000009; int main(){ int m; cin>>m; vector<int> a(m),b; rep(i,m)cin>>a[i]; rep(i,m){ if(a[i]==a[i+1])continue; b.pb(a[i]); } int p=0; rep(i,b.size()-2){ if(a[i]<a[i+1]&&a[i+1]>a[i+2]){ p++; i++; } if(a[i]>a[i+1]&&a[i+1]<a[i+2]){ p++; i++; } } cout<<p+1<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | fuu32 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 740 Byte |
Status | RE |
Exec Time | 96 ms |
Memory | 1276 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 25 ms | 896 KB |
subtask_1_02.txt | AC | 20 ms | 768 KB |
subtask_1_03.txt | WA | 13 ms | 640 KB |
subtask_1_04.txt | WA | 41 ms | 1276 KB |
subtask_1_05.txt | AC | 41 ms | 1276 KB |
subtask_1_06.txt | WA | 41 ms | 1276 KB |
subtask_1_07.txt | WA | 42 ms | 1276 KB |
subtask_1_08.txt | AC | 41 ms | 640 KB |
subtask_1_09.txt | WA | 42 ms | 1276 KB |
subtask_1_10.txt | RE | 96 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |