Submission #1221793
Source Code Expand
#include <iostream> #include <cstring> using namespace std; const int M = 1e5 + 10; int a[M]; int main() { int n; cin >> n; for(int i = 1 ; i <= n ; i++) { cin >> a[i]; } int ans = 1; int flag = -1; for(int i = 2 ; i <= n ; i++) { if(flag == -1) { if(a[i] > a[i - 1]) { flag = 1; continue; } else if(a[i] < a[i - 1]) { flag = 0; continue; } } if(flag == 1) { if(a[i] < a[i - 1]) { ans++; flag = -1; } continue; } else if(flag == 0){ if(a[i] > a[i - 1]) { ans++; flag = -1; } continue; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | Gealo |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 906 Byte |
Status | AC |
Exec Time | 55 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 | 32 ms | 512 KB |
subtask_1_02.txt | AC | 26 ms | 384 KB |
subtask_1_03.txt | AC | 16 ms | 384 KB |
subtask_1_04.txt | AC | 55 ms | 640 KB |
subtask_1_05.txt | AC | 53 ms | 640 KB |
subtask_1_06.txt | AC | 54 ms | 640 KB |
subtask_1_07.txt | AC | 53 ms | 640 KB |
subtask_1_08.txt | AC | 54 ms | 640 KB |
subtask_1_09.txt | AC | 54 ms | 640 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |