oj.uz

Submission #204952

# Submission time Handle Problem Language Result Execution time Memory
204952 2020-02-27T15:00:21 Z dolphingarlic Money (IZhO17_money) C++14
0 / 100
 5 ms 388 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

int n, a[1000001], bit[1000001];

void update(int pos) {
    for (; pos <= n; pos += (pos & (-pos))) bit[pos]++;
}

int query(int a, int b) {
    int ans = 0;
    for (b--; b; b -= (b & (-b))) ans += bit[b];
    for (; a; a -= (a & (-a))) ans -= bit[a];
    return ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    FOR(i, 0, n) cin >> a[i];
    int ans = 1;
    FOR(i, 1, n) {
        if (a[i] < a[i - 1] || query(a[i - 1], a[i]) > 0) ans++;
        update(a[i]);
    }
    cout << ans;
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 55.0

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