oj.uz

Submission #37365

# Submission time Handle Problem Language Result Execution time Memory
37365 2017-12-24T16:49:26 Z HardNut Money (IZhO17_money) C++14
0 / 100
 0 ms 6084 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;

typedef long long ll;

int n, a[N], ans;
set<pair<int, int>> st;

int main() {
//    freopen("money.in", "r", stdin);
//    freopen("money.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        st.insert({a[i], i});
        auto id = st.find({a[i], i});
        if (id == st.begin()) {
            ans++;
            continue;
        }
        id--;
        if ((*id).second == i - 1) {
            continue;
        }
        id = st.upper_bound({a[i], 0});
        if (id == st.begin()) {
            ans++;
            continue;
        }
        id--;
        if ((*id).second == i - 1) {
            continue;
        }
        ans++;
    }
    cout << ans;
}
/**
5
3 3 2 3 1
1 2 3 3 3
**/

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6084 KB Output is correct
2 Correct 0 ms 6084 KB Output is correct
3 Correct 0 ms 6084 KB Output is correct
4 Correct 0 ms 6084 KB Output is correct
5 Correct 0 ms 6084 KB Output is correct
6 Correct 0 ms 6084 KB Output is correct
7 Correct 0 ms 6084 KB Output is correct
8 Correct 0 ms 6084 KB Output is correct
9 Correct 0 ms 6084 KB Output is correct
10 Correct 0 ms 6084 KB Output is correct
11 Correct 0 ms 6084 KB Output is correct
12 Incorrect 0 ms 6084 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6084 KB Output is correct
2 Correct 0 ms 6084 KB Output is correct
3 Correct 0 ms 6084 KB Output is correct
4 Correct 0 ms 6084 KB Output is correct
5 Correct 0 ms 6084 KB Output is correct
6 Correct 0 ms 6084 KB Output is correct
7 Correct 0 ms 6084 KB Output is correct
8 Correct 0 ms 6084 KB Output is correct
9 Correct 0 ms 6084 KB Output is correct
10 Correct 0 ms 6084 KB Output is correct
11 Correct 0 ms 6084 KB Output is correct
12 Incorrect 0 ms 6084 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6084 KB Output is correct
2 Correct 0 ms 6084 KB Output is correct
3 Correct 0 ms 6084 KB Output is correct
4 Correct 0 ms 6084 KB Output is correct
5 Correct 0 ms 6084 KB Output is correct
6 Correct 0 ms 6084 KB Output is correct
7 Correct 0 ms 6084 KB Output is correct
8 Correct 0 ms 6084 KB Output is correct
9 Correct 0 ms 6084 KB Output is correct
10 Correct 0 ms 6084 KB Output is correct
11 Correct 0 ms 6084 KB Output is correct
12 Incorrect 0 ms 6084 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 6084 KB Output is correct
2 Correct 0 ms 6084 KB Output is correct
3 Correct 0 ms 6084 KB Output is correct
4 Correct 0 ms 6084 KB Output is correct
5 Correct 0 ms 6084 KB Output is correct
6 Correct 0 ms 6084 KB Output is correct
7 Correct 0 ms 6084 KB Output is correct
8 Correct 0 ms 6084 KB Output is correct
9 Correct 0 ms 6084 KB Output is correct
10 Correct 0 ms 6084 KB Output is correct
11 Correct 0 ms 6084 KB Output is correct
12 Incorrect 0 ms 6084 KB Output isn't correct
13 Halted 0 ms 0 KB -