oj.uz

Submission #88173

# Submission time Handle Problem Language Result Execution time Memory
88173 2018-12-04T09:00:27 Z turbat Money (IZhO17_money) C++14
0 / 100
 3 ms 552 KB 
#include<bits/stdc++.h> 
using namespace std;
int n, a[1000005], ans, fen[1000005], b;
void upd(int x){
    while (x <= 1e6){
        fen[x]++;
        x += x & -x;
    }
}
int get(int x){
    int s = 0;
    while (x){
        s += fen[x];
        x -= x & -x;
    }
    return s;
}
int main(){
    cin >> n;
    for(int i = 0;i < n;i++) cin >> a[i];
    for (int i = 0;i < n;i++){
        b = i;
        ans++;
        while (i + 1 < n && a[i] <= a[i + 1] && !(get(a[i] - 1) - get(a[b])) )
            i++;
        for (int j = b;j <= i;j++) upd(a[j]);
    }
    cout << ans;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 55.0

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