Submission #1221340


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
#ifdef ONPC
    freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
#else
    //freopen("a.in", "r", stdin);
    //freopen("a.out", "w", stdout);
#endif
    int n;
    scanf("%d", &n);
    vector <int> a(n);
    for (int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    vector <int> q;
    int ans = 0;
    for (int i = 0; i < n; i++)
    {
        if (q.size() != 0 && (q.size() == 1 || ((q[0] <= q[1]) == (q.back() <= a[i]))))
        {
            if (q.back() != a[i])
            {
                q.push_back(a[i]);
            }
        }
        else
        {
            q.clear();
            q.push_back(a[i]);
            ans++;
        }
    }
    printf("%d\n", ans);
}

Submission Info

Submission Time
Task A - Sorted Arrays
User 300iq
Language C++14 (GCC 5.4.1)
Score 0
Code Size 839 Byte
Status WA
Exec Time 13 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:21: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 0 / 300
Status
AC × 3
AC × 14
WA × 3
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 8 ms 512 KB
subtask_1_02.txt AC 7 ms 768 KB
subtask_1_03.txt AC 5 ms 384 KB
subtask_1_04.txt AC 13 ms 640 KB
subtask_1_05.txt WA 13 ms 1024 KB
subtask_1_06.txt AC 13 ms 640 KB
subtask_1_07.txt WA 13 ms 640 KB
subtask_1_08.txt AC 13 ms 640 KB
subtask_1_09.txt WA 13 ms 640 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB