Submission #1793422
Source Code Expand
#include <iostream> #include <algorithm> #include <string> #include <vector> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <stack> #include <queue> #include <set> #include <map> #include <ctime> #include <list> #include <numeric> #include <utility> #include <ctime> #define INF 100000000 #define LINF 9000000000000000000 #define mod 1000000007 #define rep(i,n) for(int i=0;i<int(n);i++) #define REP(i,a,b) for(int i=(a);i<int(b);i++) #define all(x) (x).begin(),x.end() #define pb push_back #define mp make_pair #define MOD(x) (x%(mod)) using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef pair<int,int> pi; int dx[4]={1,0,-1,0}; int dy[4]={0,1,0,-1}; bool debug=false; /*---------------------------------------------------*/ int n; int a[100005]; int hoge[100005]; int main(){ cin>>n; rep(i,n)cin>>a[i]; REP(i,1,n){ if(a[i]<a[i-1])hoge[i]=0; else if(a[i]>a[i-1])hoge[i]=1; else hoge[i]=2; } int ans=1; hoge[0]=hoge[1]; int c=hoge[0]; //rep(i,n)cout<<i<<": "<<hoge[i]<<endl; REP(i,0,n){ if(hoge[i]==2)continue; if(hoge[i]!=c){ ans++; i++; for(;i<n;i++){ c=hoge[i]; if(c!=2)break; } } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | mkan_0141 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1374 Byte |
Status | WA |
Exec Time | 55 ms |
Memory | 1024 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 | AC | 33 ms | 768 KB |
subtask_1_02.txt | AC | 26 ms | 640 KB |
subtask_1_03.txt | AC | 17 ms | 512 KB |
subtask_1_04.txt | AC | 54 ms | 1024 KB |
subtask_1_05.txt | AC | 53 ms | 1024 KB |
subtask_1_06.txt | AC | 54 ms | 1024 KB |
subtask_1_07.txt | AC | 55 ms | 1024 KB |
subtask_1_08.txt | WA | 54 ms | 1024 KB |
subtask_1_09.txt | AC | 55 ms | 1024 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |