oj.uz

Submission #1000303

# Submission time Handle Problem Language Result Execution time Memory
1000303 2024-06-17T08:22:08 Z sofija6 Money (IZhO17_money) C++14
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
#define ll long long
#define MAXN 1000010
using namespace std;
ll a[MAXN];
set<ll> s;
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n,ans=0;
    cin >> n;
    for (ll i=1;i<=n;i++)
        cin >> a[i];
    for (ll i=1;i<=n;i++)
    {
        auto it=s.upper_bound(a[i]);
        ans++;
        while (a[i+1]>=a[i] && (it==s.end() || a[i+1]<=(*it)))
            i++;
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -