Submission #1221356
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define int long long #define all(v) begin(v), end(v) #define rep(i, n) for(int i = 0; i < (int)(n); i++) #define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++) template<class T1, class T2> void chmin(T1 &a, T2 b){if(a>b)a=b;} template<class T1, class T2> void chmax(T1 &a, T2 b){if(a<b)a=b;} using pint = pair<int, int>; using tint = tuple<int, int, int>; using vint = vector<int>; const int inf = 1LL << 55; const int mod = 1e9 + 7; signed main() { cin.tie(0); ios_base::sync_with_stdio(0); cout << fixed << setprecision(12); int N; cin >> N; vint A; rep(i, N) { int a; cin >> a; if(A.empty() || A.back() != a) A.push_back(a); } if(N == 1) { cout << 1 << endl; return 0; } bool up = A[0] < A[1]; int cnt = 1; reps(i, 1, N) { //cout<<i<<" "<<up<<" "<<A[i-1]<<" "<<A[i]<<endl; if(up) { if(A[i-1] > A[i]) i++, cnt++, up = A[i-1] < A[i]; } else { if(A[i-1] < A[i]) i++, cnt++, up = A[i-1] < A[i]; } } cout << cnt << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | ukuku09 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1120 Byte |
Status | RE |
Exec Time | 388 ms |
Memory | 1400 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 | AC | 8 ms | 892 KB |
subtask_1_02.txt | WA | 6 ms | 892 KB |
subtask_1_03.txt | AC | 4 ms | 640 KB |
subtask_1_04.txt | AC | 12 ms | 1400 KB |
subtask_1_05.txt | AC | 12 ms | 1400 KB |
subtask_1_06.txt | AC | 12 ms | 1400 KB |
subtask_1_07.txt | AC | 12 ms | 1400 KB |
subtask_1_08.txt | RE | 388 ms | 256 KB |
subtask_1_09.txt | AC | 12 ms | 1400 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |