Submission #1221354
Source Code Expand
#include <cstdio> #include <iostream> #include <string> #include <cstring> #include <vector> #define oo 987654321 #define INT long long using namespace std; int n, a[100010], ans = 1, d; int main() { ios::sync_with_stdio(false); cin>>n; for(int i = 0 ; i < n ; i++ ) cin>>a[i]; if( n <= 2 ) return cout<<1<<endl, 0; for(int i = 0 ; i < n-2 ; i++ ) { if( a[i] > a[i+1] and a[i+1] < a[i+2] ) ans++, i++; else if( a[i] < a[i+1] and a[i+1] > a[i+2] ) ans++, i++; } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | JKJeong |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 569 Byte |
Status | WA |
Exec Time | 12 ms |
Memory | 640 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 | 8 ms | 512 KB |
subtask_1_02.txt | AC | 6 ms | 512 KB |
subtask_1_03.txt | AC | 4 ms | 384 KB |
subtask_1_04.txt | AC | 12 ms | 640 KB |
subtask_1_05.txt | AC | 11 ms | 640 KB |
subtask_1_06.txt | AC | 12 ms | 640 KB |
subtask_1_07.txt | WA | 12 ms | 640 KB |
subtask_1_08.txt | AC | 11 ms | 640 KB |
subtask_1_09.txt | WA | 12 ms | 640 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |