Submission #1225920
Source Code Expand
#include<iostream> #include<algorithm> using namespace std; int n, a[100005]; int main() { cin >> n; if (n == 1) { cout << "1" << endl; return 0; } for (int i = 0; i < n; i++)cin >> a[i]; int cnt = 0, J = 0, K = -1; for (int i = 0; i <= n; i++) { if (i == n) { cnt++; break; } if (K == -1 && i != 0) { if (J > a[i])K = 1; if (J < a[i]) K = 0; } else { if (K == 0 && a[i - 1] > a[i]) { cnt++; J = a[i]; K = -1; } if (K == 1 && a[i - 1] < a[i]) { cnt++; J = a[i]; K = -1; } } } cout << cnt << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | E869120 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 554 Byte |
Status | WA |
Exec Time | 54 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 | AC | 26 ms | 384 KB |
subtask_1_03.txt | WA | 17 ms | 384 KB |
subtask_1_04.txt | AC | 54 ms | 640 KB |
subtask_1_05.txt | WA | 53 ms | 640 KB |
subtask_1_06.txt | WA | 54 ms | 640 KB |
subtask_1_07.txt | AC | 54 ms | 640 KB |
subtask_1_08.txt | AC | 54 ms | 640 KB |
subtask_1_09.txt | WA | 54 ms | 640 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |