Submission #1337328


Source Code Expand

// Copyright 2017 wu_qing
#include <cstdio>
#include <algorithm>
const int N = 1e5 + 10;
int n, a[N], ans, cur;
bool s, f1;
int main() {
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
        scanf("%d", a + i);
    n = std::unique(a, a + n) - a;
    while (cur < n) {
        ans++;
        if (cur == n - 1) break;
        s = a[cur] < a[cur + 1];
        for (int i = cur + 2; i <= n; i++) {
            if (i == n) {
                cur = n;
                break;
            }
            if (s ^ (a[i - 1] < a[i])) {
                cur = i;
                break;
            }
        }
    }
    printf("%d\n", ans);
    return 0;
}

Submission Info

Submission Time
Task A - Sorted Arrays
User wu_qing
Language C++14 (GCC 5.4.1)
Score 300
Code Size 680 Byte
Status AC
Exec Time 12 ms
Memory 512 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:10:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", a + i);
                           ^

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 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
subtask_1_01.txt AC 8 ms 384 KB
subtask_1_02.txt AC 6 ms 384 KB
subtask_1_03.txt AC 4 ms 256 KB
subtask_1_04.txt AC 12 ms 512 KB
subtask_1_05.txt AC 12 ms 512 KB
subtask_1_06.txt AC 12 ms 512 KB
subtask_1_07.txt AC 12 ms 512 KB
subtask_1_08.txt AC 12 ms 512 KB
subtask_1_09.txt AC 12 ms 512 KB
subtask_1_10.txt AC 1 ms 128 KB
subtask_1_11.txt AC 1 ms 128 KB