oj.uz

Submission #758297

# Submission time Handle Problem Language Result Execution time Memory
758297 2023-06-14T12:11:13 Z haxorman Money (IZhO17_money) C++14
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

const int mxN = 1e6 + 7;

int arr[mxN];

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    
    int n;
    cin >> n;

    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }
    arr[n] = INT_MIN;
        
    int ans = 0, prv = 0;
    set<int> vals;
    for (int i = 1; i <= n; ++i) {
        vals.insert(arr[prv]);
        auto it1 = vals.upper_bound(arr[prv]);
        auto it2 = vals.lower_bound(arr[i]);
        
        if (arr[i - 1] > arr[i] || it1 != it2) {
            ++ans;
            prv = i;
        }
    }
    cout << ans << "\n";
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 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 212 KB Output is correct
2 Incorrect 0 ms 212 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 212 KB Output is correct
2 Incorrect 0 ms 212 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 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -