Submission #1794261
Source Code Expand
#include <bits/stdc++.h> using namespace std; int a[100001]; int d1[100001]; int d[100001]; main () { ios_base::sync_with_stdio (0); cin.tie (0); int n; cin >> n; for (int i = 1;i <= n;i ++) { cin >> a[i]; if (i == 1) { d[i] = 1; d1[i] = 1; continue; } if (a[i] > a[i - 1]) { d[i] = d[i - 1]; d1[i] = min (d[i - 1], d1[i - 1]) + 1; } else { d[i] = min (d1[i - 1], d[i - 1]) + 1; d1[i] = d1[i - 1]; } } cout << min (d[n], d1[n]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | almasalmas |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 525 Byte |
Status | WA |
Exec Time | 12 ms |
Memory | 1408 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 | 1024 KB |
subtask_1_02.txt | WA | 6 ms | 768 KB |
subtask_1_03.txt | AC | 4 ms | 640 KB |
subtask_1_04.txt | AC | 12 ms | 1408 KB |
subtask_1_05.txt | AC | 11 ms | 1408 KB |
subtask_1_06.txt | AC | 12 ms | 1408 KB |
subtask_1_07.txt | WA | 12 ms | 1408 KB |
subtask_1_08.txt | WA | 11 ms | 1408 KB |
subtask_1_09.txt | WA | 12 ms | 1408 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |