oj.uz

Submission #331551

# Submission time Handle Problem Language Result Execution time Memory
331551 2020-11-28T22:08:03 Z jovan_b Simple game (IZhO17_game) C++17
100 / 100
 86 ms 5416 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

const int MAX = 1000000;

int h[MAX+5];

int bit[MAX+5];

void upd(int x, int val){
    while(x <= MAX+1){
        bit[x] += val;
        x += x & -x;
    }
}

int query(int x){
    int res = 0;
    while(x){
        res += bit[x];
        x -= x & -x;
    }
    return res;
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
	cout.precision(10);
	cout << fixed;

    int n, m;
    cin >> n >> m;
    for(int i=1; i<=n; i++){
        cin >> h[i];
    }
    for(int i=2; i<=n; i++){
        upd(min(h[i-1], h[i]), 1);
        upd(max(h[i-1], h[i])+1, -1);
    }
    while(m--){
        int t;
        cin >> t;
        if(t == 1){
            int i, y;
            cin >> i >> y;
            if(i > 1){
                upd(min(h[i-1], h[i]), -1);
                upd(max(h[i-1], h[i])+1, 1);
            }
            if(i < n){
                upd(min(h[i+1], h[i]), -1);
                upd(max(h[i+1], h[i])+1, 1);
            }
            h[i] = y;
            if(i > 1){
                upd(min(h[i-1], h[i]), 1);
                upd(max(h[i-1], h[i])+1, -1);
            }
            if(i < n){
                upd(min(h[i+1], h[i]), 1);
                upd(max(h[i+1], h[i])+1, -1);
            }
        }
        else{
            int y;
            cin >> y;
            cout << query(y) << "\n";
        }
    }
    return 0;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 4076 KB Output is correct
3 Correct 3 ms 4076 KB Output is correct
4 Correct 3 ms 4076 KB Output is correct
5 Correct 3 ms 4076 KB Output is correct
6 Correct 3 ms 4076 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 4076 KB Output is correct
3 Correct 3 ms 4076 KB Output is correct
4 Correct 3 ms 4076 KB Output is correct
5 Correct 3 ms 4076 KB Output is correct
6 Correct 3 ms 4076 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 39 ms 1024 KB Output is correct
9 Correct 51 ms 5416 KB Output is correct
10 Correct 55 ms 5228 KB Output is correct
11 Correct 39 ms 1004 KB Output is correct
12 Correct 43 ms 1516 KB Output is correct
13 Correct 43 ms 1388 KB Output is correct

Subtask #3
51.0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 3 ms 4076 KB Output is correct
3 Correct 3 ms 4076 KB Output is correct
4 Correct 3 ms 4076 KB Output is correct
5 Correct 3 ms 4076 KB Output is correct
6 Correct 3 ms 4076 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 39 ms 1024 KB Output is correct
9 Correct 51 ms 5416 KB Output is correct
10 Correct 55 ms 5228 KB Output is correct
11 Correct 39 ms 1004 KB Output is correct
12 Correct 43 ms 1516 KB Output is correct
13 Correct 43 ms 1388 KB Output is correct
14 Correct 66 ms 4992 KB Output is correct
15 Correct 86 ms 4972 KB Output is correct
16 Correct 72 ms 4972 KB Output is correct
17 Correct 72 ms 5100 KB Output is correct
18 Correct 81 ms 4972 KB Output is correct