Submission #94414

#	Time	Username	Problem	Language	Result	Execution time	Memory
94414		Kastanda	Money (IZhO17_money)	C++11	45 / 100	1570 ms	58164 KiB

money

#include<bits/stdc++.h>
using namespace std;
const int N = 1000006;
int n, cnt, A[N];
multiset < int > S;
inline void Del(int a)
{
    auto it = S.lower_bound(a);
    if ((*it) == a)
        S.erase(it);
}
int main()
{
    scanf("%d", &n);
    for (int i = 1; i <= n; i++)
        scanf("%d", &A[i]), S.insert(A[i]);
    S.insert(N); // just in case...
    for (int i = n; i;)
    {
        int used = 0;
        int l = i - 1;
        while (l)
        {
            Del(A[l + 1]);
            if (A[l] > A[l + 1])
                break;
            if (A[l] == A[l + 1])
            {
                l --;
                continue;
            }
            auto it = S.upper_bound(A[l]);
            if ((*it) < A[l + 1])
                break;
            if ((*it) == A[l + 1] && used)
                break;
            used = 1;
            l --;
        }
        i = l;
        cnt ++;
    }
    return !printf("%d", cnt);
}

Compilation message (stderr)

money.cpp: In function 'int main()':
money.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
money.cpp:16:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &A[i]), S.insert(A[i]);
         ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 0 / 55