Submission #1496500
Source Code Expand
#include <bits/stdc++.h> #define rep(i, a, n) for(int i = a; i < n; i++) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define o(a) cout << a << endl #define int long long #define fi first #define se second using namespace std; typedef pair<int, int> P; signed main(){ int n; cin >> n; vector<int> a(n); rep(i, 0, n){ cin >> a[i]; } int ans = 1; int f = 0; rep(i, 1, n){ if(a[i - 1] < a[i]){ if(f == 0) f = 1; else if(f == -1){ ans++; f = 0; } } if(a[i - 1] > a[i]){ if(f == 0) f = -1; else if(f == 1){ ans++; f = -1; } } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | treeone |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 838 Byte |
Status | WA |
Exec Time | 41 ms |
Memory | 1024 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 | 25 ms | 768 KB |
subtask_1_02.txt | AC | 20 ms | 640 KB |
subtask_1_03.txt | WA | 13 ms | 512 KB |
subtask_1_04.txt | WA | 41 ms | 1024 KB |
subtask_1_05.txt | AC | 40 ms | 1024 KB |
subtask_1_06.txt | WA | 41 ms | 1024 KB |
subtask_1_07.txt | WA | 41 ms | 1024 KB |
subtask_1_08.txt | AC | 40 ms | 1024 KB |
subtask_1_09.txt | WA | 41 ms | 1024 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |