Submission #3455401


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int MOD=1e9+7;
ll INF=1e18;

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};

int main(){
    int n; cin>>n;
    vector<int> a(n);
    for(int i=0; i<n; i++) cin>>a[i];

    int ans=0, i=0;
    while(i<n){
        if(i==n-1){
            ans++;
            break;
        }

        if(a[i]==a[i+1]){
            i++;
            continue;
        }

        while(a[i]<=a[i+1] && i<n-1){
            i++;
            if(a[i]>a[i+1]){
                i++;
                ans++;
                break;
            }
        }

        while(a[i]>=a[i+1] && i<n-1){
            i++;
            if(a[i]<a[i+1]){
                i++;
                ans++;
                break;
            }
        }
    }
    cout << ans << endl;
}

Submission Info

Submission Time
Task A - Sorted Arrays
User rodea0952
Language C++14 (GCC 5.4.1)
Score 0
Code Size 877 Byte
Status WA
Exec Time 42 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 300
Status
AC × 3
AC × 15
WA × 2
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 25 ms 512 KB
subtask_1_02.txt AC 20 ms 384 KB
subtask_1_03.txt AC 13 ms 384 KB
subtask_1_04.txt AC 41 ms 640 KB
subtask_1_05.txt AC 42 ms 640 KB
subtask_1_06.txt AC 41 ms 640 KB
subtask_1_07.txt WA 41 ms 640 KB
subtask_1_08.txt AC 42 ms 640 KB
subtask_1_09.txt WA 41 ms 640 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB