Submission #1221792
Source Code Expand
#include <iostream> #include <algorithm> #include <string> #include <vector> #include <functional> using namespace std; #define FOR(i,a,b) for (int i=(a);i<(b);i++) #define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--) #define REP(i,n) for (int i=0;i<(n);i++) #define RREP(i,n) for (int i=(n)-1;i>=0;i--) int N; vector <int > A; int main() { cin >> N; if(N == 1){ cout << 1; return 0; } A.resize(N); REP(i,N){ cin >> A[i]; } int ans = 1; int flag = 1; int v,oldv; FOR(i,0,N-1){ v = A[i+1] - A[i]; if(v == 0) continue; if(flag){ oldv = v; flag = 0; continue; } if(oldv * v > 0){ continue; } else { ans++; flag=1; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | A - Sorted Arrays |
User | atm314 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 751 Byte |
Status | WA |
Exec Time | 55 ms |
Memory | 640 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 | WA | 34 ms | 512 KB |
subtask_1_02.txt | AC | 26 ms | 384 KB |
subtask_1_03.txt | WA | 17 ms | 384 KB |
subtask_1_04.txt | WA | 53 ms | 640 KB |
subtask_1_05.txt | AC | 54 ms | 640 KB |
subtask_1_06.txt | WA | 53 ms | 640 KB |
subtask_1_07.txt | AC | 55 ms | 640 KB |
subtask_1_08.txt | AC | 53 ms | 640 KB |
subtask_1_09.txt | AC | 55 ms | 640 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |