Submission #8823393
Source Code Expand
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < (int)(n); i++) typedef long long ll; using namespace std; int main(){ ios::sync_with_stdio(false); cin.tie(0); ll n; cin >> n; vector<ll> a(n); rep(i,n) cin >> a[i]; ll cnt = 1; for(int i = 0; i < n - 1; i++){ if(a[i] < a[i+1]){ int j = 1; while(i+j < n - 1){ if(a[i+j] <= a[i+j+1]) j++; else { cnt++; i+=j; break; } } } else if(a[i] > a[i+1]){ int j = 1; while(i+j < n - 1){ if(a[i+j] >= a[i+j+1]) j++; else { cnt++; i+=j; break; } } } } cout << cnt << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | Jonah00 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 959 Byte |
Status | TLE |
Exec Time | 2103 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 | AC | 7 ms | 768 KB |
subtask_1_02.txt | AC | 758 ms | 640 KB |
subtask_1_03.txt | AC | 4 ms | 512 KB |
subtask_1_04.txt | AC | 11 ms | 1024 KB |
subtask_1_05.txt | TLE | 2103 ms | 1024 KB |
subtask_1_06.txt | AC | 11 ms | 1024 KB |
subtask_1_07.txt | AC | 11 ms | 1024 KB |
subtask_1_08.txt | AC | 44 ms | 1024 KB |
subtask_1_09.txt | AC | 11 ms | 1024 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |