Submission #1690996
Source Code Expand
#include<iostream> using namespace std; int n,a[100001]; int ans=1; int main() { cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; int book; if(a[1]<=a[2]) book=1; else book=0; for(int i=2;i<=n;i++) { if(book==1&&a[i]<=a[i-1]) continue; else if(book=1&&a[i]>a[i-1]) { ans++; if(a[i+1]>=a[i]) book=1; else book=0; i++; } if(book==0&&a[i]>=a[i-1]) continue; else if(book==0&&a[i]<a[i-1]) { ans++; if(a[i+1]>=a[i]) book=1; else book=0; i++; } } cout<<ans; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | justin_cao |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 581 Byte |
Status | WA |
Exec Time | 55 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 | WA | 33 ms | 512 KB |
subtask_1_02.txt | WA | 26 ms | 384 KB |
subtask_1_03.txt | WA | 17 ms | 384 KB |
subtask_1_04.txt | WA | 54 ms | 640 KB |
subtask_1_05.txt | WA | 53 ms | 640 KB |
subtask_1_06.txt | WA | 53 ms | 640 KB |
subtask_1_07.txt | WA | 55 ms | 640 KB |
subtask_1_08.txt | WA | 53 ms | 640 KB |
subtask_1_09.txt | WA | 55 ms | 640 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | WA | 1 ms | 256 KB |