Submission #1215985

#	Time	Username	Problem	Language	Result	Execution time	Memory
1215985		M_SH_O	Simple game (IZhO17_game)	C++20	100 / 100	431 ms	64328 KiB

game

#include <bits/stdc++.h>
//#include "grader.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/

#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define all(a) a.begin(), a.end()
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define INF 1000000000000000000
#define ordered_set tree<pll, null_type, less<pll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

mt19937 rng(1488);
ll randll(ll l, ll r){
    return uniform_int_distribution<ll>(l, r)(rng);
}

/*vector<map<ll, vll>> s;
vll p;

ll find(ll v) {
    if (p[v] == v) return v;
    return p[v] = find(p[v]);
}

void unite(ll a, ll b) {
    a = find(a);
    b = find(b);

    if (a == b) return;
    if (s[a].size() < s[b].size()) {
        p[a] = b;
        for (auto i : s[a]) {
            for (int j : i.se) {
                s[b][i.fr].pb(j);
            }
        }
        s[a].clear();
    }
    else {
        p[b] = a;
        for (auto i : s[b]) {
            for (int j : i.se) {
                s[a][i.fr].pb(j);
            }
        }
        s[b].clear();
    }
}*/

vll tree1, d;

void push(ll v, ll tl, ll tr) {
    if (tl == tr) return;
    tree1[v*2] += d[v];
    tree1[v*2+1] += d[v];
    d[v*2] += d[v];
    d[v*2+1] += d[v];
    d[v] = 0;
    tree1[v] = tree1[v*2]+tree1[v*2+1];
}

void bt(ll v, ll tl, ll tr, vll& a) {
    if (tl == tr) {
        tree1[v] = a[tl];
        return;
    }

    ll tm = (tl+tr)/2;
    bt(v*2, tl, tm, a);
    bt(v*2, tm+1, tr, a);

    tree1[v] = tree1[v*2]+tree1[v*2+1];
}

ll get(ll l, ll r, ll v, ll tl, ll tr) {
    if (l <= tl && tr <= r) return tree1[v];
    if (tl > r || tr < l) return 0;

    ll tm = (tl+tr)/2;
    push(v, tl, tr);
    return get(l, r, v*2, tl, tm)+get(l, r, v*2+1, tm+1, tr);
}

void update(ll l, ll r, ll val, ll v, ll tl, ll tr) {
    if (l <= tl && tr <= r) {
        tree1[v] += val;
        d[v] += val;
        push(v, tl, tr);
        return;
    }
    if (tl > r || tr < l) return;

    ll tm = (tl+tr)/2;
    push(v, tl, tr);

    update(l, r, val, v*2, tl, tm);
    update(l, r, val, v*2+1, tm+1, tr);

    tree1[v] = tree1[v*2]+tree1[v*2+1];
}

int main() {
    ll n, q;
    cin >> n >> q;
    vll a(n);
    tree1.resize(4000007, 0);
    d.resize(4000007, 0);

    for (int i =0 ; i < n; i ++) {
        cin >> a[i];
    }
    for (int i = 0; i < n-1; i ++) {
        update(min(a[i], a[i+1]), max(a[i], a[i+1]), 1, 1, 0, 1000000);
        if (i != 0) update(a[i], a[i], -1, 1, 0, 1000000);
    }

    while (q --) {
        ll x;
        cin >> x;
        if (x == 1) {
            ll pos, val;
            cin >> pos >> val;
            pos --;
            if (pos != 0) update(min(a[pos], a[pos-1]), max(a[pos], a[pos-1]), -1, 1, 0, 1000000);
            if (pos != n-1) update(min(a[pos], a[pos+1]), max(a[pos], a[pos+1]), -1, 1, 0, 1000000);
            if (pos != 0 && pos != n-1) update(a[pos], a[pos], 1, 1, 0, 1000000);
            a[pos] = val;
            if (pos != 0) update(min(a[pos], a[pos-1]), max(a[pos], a[pos-1]), 1, 1, 0, 1000000);
            if (pos != n-1) update(min(a[pos], a[pos+1]), max(a[pos], a[pos+1]), 1, 1, 0, 1000000);
            if (pos != 0 && pos != n-1) update(a[pos], a[pos], -1, 1, 0, 1000000);
        }
        else {
            ll k;
            cin >> k;
            cout << get(k, k, 1, 0, 1000000) << endl;
        }
    }
}

• Subtask 1: 22 / 22
• Subtask 2: 27 / 27
• Subtask 3: 51 / 51