Submission #1221347
Source Code Expand
// UNNECESSARY // #include <chrono>//std::chrono::/system_clock/steady_clock/high_resolution_clock/duration // #include <cstdio>//printf/scanf/fopen/fclose/fprintf/fscanf/snprintf/putc/puts/getc/gets // #include <fstream>//ifstream/ofstream // DATA STRUCTURES #include <array> #include <bitset> #include <list> #include <queue> #include <map> #include <set> #include <stack> #include <tuple> #include <valarray> #include <vector> // MISCELLANEOUS #include <algorithm>//min/max/sort(rand-access it)/merge #include <cassert> #include <climits>//INT_MAX/INT_MIN/ULLONG_MAX #include <cmath>//fmin/fmax/fabs/sin(h)/cos(h)/tan(h)/exp/log/pow/sqrt/cbrt/ceil/floor/round/trunc #include <cstdlib>//abs/atof/atoi/atol/atoll/strtod/strtof/..., srand/rand, calloc/malloc, exit, qsort #include <iomanip>//setfill/setw/setprecision/fixed/scientific #include <iostream>//cin/cout/wcin/wcout/left/right/internal/dec/hex/oct/fixed/scientific #include <iterator> #include <limits>//numeric_limits<type>::max/min/lowest/epsilon/infinity/quiet_NaN/signaling_NaN #include <new> #include <string>//stoi/stol/stoul/stoll/stoull/stof/stod/stold/to_string/getline #include <utility>//pair #ifndef REP #define REP(i,n) for (int i = 0; i < n; ++i) #endif #ifndef REPST #define REPST(i,n) for (size_t i = 0; i < n; ++i) #endif #ifndef READ #define READ(x) std::cin >> x #endif typedef unsigned int ui; typedef long long ll; typedef unsigned long long ull; typedef std::pair<int, int> pii; typedef std::pair<ll, int> plli; typedef std::pair<ull, int> puli; typedef std::pair<double, int> pdi; typedef std::pair<ll, ll> pllll; typedef std::pair<ull, ull> pulul; typedef std::pair<double, double> pdd; typedef std::tuple<int, int, int> ti3; typedef std::tuple<int, int, int, int> ti4; const bool debug = true; // -------------------------------------------------------------------------------------- using namespace std; int main(void) { size_t n; cin >> n; int a, prev; int stat = 0; ui count = 0; cin >> a; REP(i,n-1) { prev = a; READ(a); switch (stat) { case 0: { if (a > prev) { stat = 1; } else if (a < prev) { stat = -1; } break; } case 1: { if (a < prev) { ++count; stat = 0; } break; } case -1: { if (a > prev) { ++count; stat = 0; } break; } default: { break; } } } cout << (++count) << '\n'; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | L3Sota |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 2833 Byte |
Status | AC |
Exec Time | 58 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 33 ms | 256 KB |
subtask_1_02.txt | AC | 26 ms | 256 KB |
subtask_1_03.txt | AC | 17 ms | 256 KB |
subtask_1_04.txt | AC | 54 ms | 256 KB |
subtask_1_05.txt | AC | 53 ms | 256 KB |
subtask_1_06.txt | AC | 54 ms | 256 KB |
subtask_1_07.txt | AC | 58 ms | 256 KB |
subtask_1_08.txt | AC | 54 ms | 256 KB |
subtask_1_09.txt | AC | 53 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |