oj.uz

Submission #143831

# Submission time Handle Problem Language Result Execution time Memory
143831 2019-08-15T09:44:33 Z MladenP Money (IZhO17_money) C++17
0 / 100
 2 ms 376 KB 
#include <bits/stdc++.h>
#define MAXN 1000010
#define PRINT(x) cerr<<#x<<'='<<x<<endl;
using namespace std;
int a[MAXN], bit[MAXN], N, rez;
int query(int idx) {
    int rez = 0;
    for( ; idx ; idx -= idx&-idx) rez += bit[idx];
    return rez;
}
void update(int idx, int val) {
    for( ; idx < MAXN; idx += idx&-idx) bit[idx] += val;
}
int main() {
    cin >> N >> a[1];
    rez = 1;
    for(int i = 2; i <= N; i++) {
        cin >> a[i];
        if(a[i-1] > a[i] || query(a[i]) > query(a[i-1])) {
            rez++;
            PRINT(i);
        }
        update(a[i-1], +1);
    }
    cout << rez;
    return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 55.0

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