Submission #1223979
Source Code Expand
#include<bits/stdc++.h> using namespace std; void rd(int &x){ int k, m=0; x=0; for(;;){ k = getchar_unlocked(); if(k=='-'){ m=1; break; } if('0'<=k&&k<='9'){ x=k-'0'; break; } } for(;;){ k = getchar_unlocked(); if(k<'0'||k>'9'){ break; } x=x*10+k-'0'; } if(m){ x=-x; } } void wt_L(int x){ char f[10]; int m=0, s=0; if(x<0){ m=1; x=-x; } while(x){ f[s++]=x%10; x/=10; } if(!s){ f[s++]=0; } if(m){ putchar_unlocked('-'); } while(s--){ putchar_unlocked(f[s]+'0'); } } int A[100000], N; int main(){ int i, j, res=0; rd(N); { int Lj4PdHRW; for(Lj4PdHRW=0;Lj4PdHRW<N;Lj4PdHRW++){ rd(A[Lj4PdHRW]); } } for(i=0;i<N;i++){ res++; while(i < N-1 && A[i]==A[i+1]){ i++; } if(i==N-1){ break; } if(A[i] < A[i+1]){ while(i < N-1 && A[i] <= A[i+1]){ i++; } } else{ while(i < N-1 && A[i] >= A[i+1]){ i++; } } } wt_L(res); putchar_unlocked('\n'); return 0; } // cLay varsion 20170413-1 [beta] // --- original code --- // int N, A[100000]; // { // int i, j, res = 0; // rd(N,A(N)); // rep(i,N){ // res++; // while(i < N-1 && A[i]==A[i+1]) i++; // if(i==N-1) break; // if(A[i] < A[i+1]){ // while(i < N-1 && A[i] <= A[i+1]) i++; // } else { // while(i < N-1 && A[i] >= A[i+1]) i++; // } // } // wt(res); // }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | LayCurse |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1597 Byte |
Status | AC |
Exec Time | 4 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 | 3 ms | 512 KB |
subtask_1_02.txt | AC | 2 ms | 384 KB |
subtask_1_03.txt | AC | 2 ms | 384 KB |
subtask_1_04.txt | AC | 4 ms | 640 KB |
subtask_1_05.txt | AC | 4 ms | 640 KB |
subtask_1_06.txt | AC | 4 ms | 640 KB |
subtask_1_07.txt | AC | 4 ms | 640 KB |
subtask_1_08.txt | AC | 4 ms | 640 KB |
subtask_1_09.txt | AC | 4 ms | 640 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |