Submission details
Task:Zigzag
Sender:OOliOO_slayer
Submission time:2015-09-16 19:32:07 +0300
Language:C++
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.06 sdetails
#2ACCEPTED0.06 sdetails
#3ACCEPTED0.06 sdetails
#4ACCEPTED0.06 sdetails
#5ACCEPTED0.05 sdetails
#60.05 sdetails
#70.06 sdetails
#80.06 sdetails
#90.05 sdetails
#100.06 sdetails
#110.06 sdetails
#120.05 sdetails
#130.05 sdetails
#140.06 sdetails
#150.06 sdetails
#160.06 sdetails
#170.06 sdetails
#18ACCEPTED0.06 sdetails
#190.05 sdetails
#20ACCEPTED0.05 sdetails
#21ACCEPTED0.06 sdetails
#220.07 sdetails
#230.05 sdetails

Code

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <utility>
#include <set>

typedef long long LL;

using namespace std;

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n; cin >> n;
    vector<int> v;
    for(int i = 0; i < n; i++){
        int x; cin >> x; v.push_back(x);
    }
    
    if(n == 1){
        cout << 1 << endl;
        return 0;
    }
    if(n == 2){
        if(v[0] == v[1]) cout << 1 << endl;
        else cout << 2 << endl;
        return 0;
    }
    
    LL ans = 0;
    LL first = -1; LL last = -1;
    for(int i = 1; i < n-1; i++){
        if(!(v[i-1] <= v[i] && v[i] <= v[i+1]) &&
           !(v[i-1] >= v[i] && v[i] >= v[i+1])){
            ans++;
            if(first == -1) first = i;
            last = i;
        }
    }
    
    if(first == -1 || v[0] != v[first]) ans++;
    if(last == -1 || v[n-1] != v[last]) ans++;
    cout << ans << endl;
}


Test details

Test 1

Verdict: ACCEPTED

input
26914
209563339 493138663 352519700 ...

correct output
17861

user output
17861

Test 2

Verdict: ACCEPTED

input
69623
448426297 297876050 307483466 ...

correct output
46402

user output
46402

Test 3

Verdict: ACCEPTED

input
74436
633012861 731816315 697620472 ...

correct output
49602

user output
49602

Test 4

Verdict: ACCEPTED

input
40279
561990353 513856090 901866509 ...

correct output
26955

user output
26955

Test 5

Verdict: ACCEPTED

input
51496
683270487 631068160 190804676 ...

correct output
34326

user output
34326

Test 6

Verdict:

input
97124
1000007 1000006 1000003 100000...

correct output
61495

user output
55283

Test 7

Verdict:

input
91945
1000005 1000005 1000006 100000...

correct output
58521

user output
52663

Test 8

Verdict:

input
96629
1000004 1000010 1000003 100001...

correct output
61327

user output
55228

Test 9

Verdict:

input
92161
1000042 1000001 1000055 100001...

correct output
60962

user output
60334

Test 10

Verdict:

input
96806
1000057 1000002 1000011 100006...

correct output
64127

user output
63471

Test 11

Verdict:

input
99118
1000084 1000083 1000002 100008...

correct output
66012

user output
65310

Test 12

Verdict:

input
98412
1000959 1000993 1000257 100064...

correct output
65720

user output
65656

Test 13

Verdict:

input
90443
1000341 1000111 1000853 100021...

correct output
60148

user output
60086

Test 14

Verdict:

input
94265
1000087 1000461 1000534 100020...

correct output
62824

user output
62765

Test 15

Verdict:

input
91433
1001939 1009857 1000325 100505...

correct output
60938

user output
60929

Test 16

Verdict:

input
96457
1005466 1001970 1000639 100288...

correct output
64111

user output
64103

Test 17

Verdict:

input
91928
1003162 1008129 1007967 100683...

correct output
61129

user output
61123

Test 18

Verdict: ACCEPTED

input
96494
1076481 1008804 1047323 102583...

correct output
64214

user output
64214

Test 19

Verdict:

input
98136
1025253 1017437 1050227 105377...

correct output
65345

user output
65344

Test 20

Verdict: ACCEPTED

input
90294
1098032 1037085 1089672 105311...

correct output
60164

user output
60164

Test 21

Verdict: ACCEPTED

input
100000
19836 85811 67650 86807 50191 ...

correct output
66639

user output
66639

Test 22

Verdict:

input
100000
999999998 999999999 999999996 ...

correct output
59975

user output
47957

Test 23

Verdict:

input
11
1000000000 1000000000 10000000...

correct output
4

user output
3