Submission #1481880


Source Code Expand

# include <iostream>
# include <algorithm>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <utility>
# include <stack>
# include <queue>
# include <list>
constexpr int MOD = 1000000000 + 7;
constexpr int INF = 2000000000;
using namespace std;


int main() {
	int n;
	cin >> n;
	int a[100001];
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	int ans = 0;
	int l = 0;
	while(l<n){
		int r1 = l + 1;
		while (r1 < n&&a[r1] >= a[r1 - 1])r1++;
		int r2(l + 1);
		while (r2 < n&&a[r2] <= a[r2 - 1])r2++;
		l = max(r1, r2);
		ans++;
	}
	cout << ans << endl;
}

Submission Info

Submission Time
Task A - Sorted Arrays
User M3_cp
Language C++14 (GCC 5.4.1)
Score 300
Code Size 683 Byte
Status AC
Exec Time 54 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 17
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 27 ms 384 KB
subtask_1_03.txt AC 17 ms 384 KB
subtask_1_04.txt AC 53 ms 640 KB
subtask_1_05.txt AC 54 ms 640 KB
subtask_1_06.txt AC 53 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 53 ms 640 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB