Submission #1337243
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i)) using ll = long long; int main() { int n; cin >> n; int a[100001]; rep(i, n) cin >>a[i]; int ans=0; rep(i, n) { ans++; while (i+1<n and a[i] == a[i+1]) ++i; if (a[i] > a[i+1]) { while (i+1<n and a[i] >= a[i+1]) ++i; } else { while (i+1<n and a[i] <= a[i+1]) ++i; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | dsytk7 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 518 Byte |
Status | AC |
Exec Time | 54 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 | 33 ms | 512 KB |
subtask_1_02.txt | AC | 26 ms | 384 KB |
subtask_1_03.txt | AC | 17 ms | 384 KB |
subtask_1_04.txt | AC | 54 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 | 54 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 |