oj.uz

Submission #344419

# Submission time Handle Problem Language Result Execution time Memory
344419 2021-01-05T18:14:12 Z apostoldaniel854 Simple game (IZhO17_game) C++14
100 / 100
 77 ms 6508 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
#define pb push_back
#define dbg(x) cerr << #x << " " << x << "\n"

const int MAX_N = 1e5, MX = 1e6;
int aib[1 + MX];
int h[1 + MAX_N];


void update (int pos, int val) {
    while (pos <= MX) {
        aib[pos] += val;
        pos += pos & -pos;
    }
}
int query (int pos) {
    int ans = 0;
    while (pos > 0) {
        ans += aib[pos];
        pos -= pos & -pos;
    }
    return ans;
}

void change (int l, int r, int sgn) {
    if (l > r)
        swap (l, r);
    update (l, sgn);
    update (r + 1, -sgn);
}

int main () {
    ios::sync_with_stdio (false);
    cin.tie (0); cout.tie (0);

    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
        cin >> h[i];
    for (int i = 2; i <= n; i++)
        change (h[i - 1], h[i], 1);
    while (m--) {
        int type;
        cin >> type;
        if (type == 1) {
            int pos, new_h;
            cin >> pos >> new_h;
            if (pos > 1)
                change (h[pos - 1], h[pos], -1);
            if (pos < n)
                change (h[pos], h[pos + 1], -1);
            h[pos] = new_h;
            if (pos > 1)
                change (h[pos - 1], h[pos], 1);
            if (pos < n)
                change (h[pos], h[pos + 1], 1);
        }
        else {
            int h;
            cin >> h;
            cout << query (h) << "\n";
        }
    }
    return 0;
}
/**
3 3
1 5 1
2 3
1 1 5
2 3
**/

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 4204 KB Output is correct
3 Correct 3 ms 4224 KB Output is correct
4 Correct 3 ms 4204 KB Output is correct
5 Correct 3 ms 4204 KB Output is correct
6 Correct 4 ms 4204 KB Output is correct
7 Correct 2 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 4204 KB Output is correct
3 Correct 3 ms 4224 KB Output is correct
4 Correct 3 ms 4204 KB Output is correct
5 Correct 3 ms 4204 KB Output is correct
6 Correct 4 ms 4204 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 38 ms 1700 KB Output is correct
9 Correct 53 ms 6508 KB Output is correct
10 Correct 52 ms 6508 KB Output is correct
11 Correct 40 ms 1644 KB Output is correct
12 Correct 43 ms 2816 KB Output is correct
13 Correct 46 ms 2796 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 4204 KB Output is correct
3 Correct 3 ms 4224 KB Output is correct
4 Correct 3 ms 4204 KB Output is correct
5 Correct 3 ms 4204 KB Output is correct
6 Correct 4 ms 4204 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 38 ms 1700 KB Output is correct
9 Correct 53 ms 6508 KB Output is correct
10 Correct 52 ms 6508 KB Output is correct
11 Correct 40 ms 1644 KB Output is correct
12 Correct 43 ms 2816 KB Output is correct
13 Correct 46 ms 2796 KB Output is correct
14 Correct 77 ms 6220 KB Output is correct
15 Correct 73 ms 6252 KB Output is correct
16 Correct 69 ms 6252 KB Output is correct
17 Correct 65 ms 6252 KB Output is correct
18 Correct 68 ms 6252 KB Output is correct