Submission #1188627

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188627		stefanopulos	Simple game (IZhO17_game)	C++20	0 / 100	2 ms	4232 KiB

game

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 100005; 

int n, q;
int Y[mxN];

const int N = 1e6;

int dud[N + 5];
void upd(int x, int val){
    while(x <= N){
        dud[x] += val;
        x += x&(-x);
    }
}
int query(int x){
    int sum = 0;
    while(x > 0){
        sum += dud[x];
        x -= x&(-x);
    }
    return sum;
}

void add(int i, int j, int koef){
    int l = min(Y[i], Y[j]) + 1;
    int r = max(Y[i], Y[j]) - 1;
    if(l <= r){
        upd(l, koef);
        upd(r + 1, -koef);
    }
}

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> q;
    ff(i,1,n)cin >> Y[i];

    ff(i,2,n)add(i - 1, i, +1);

    while(q--){
        int t;
        cin >> t;

        if(t == 1){
            int pos, val;
            cin >> pos >> val;

            if(pos > 1)add(pos - 1, pos, -1);
            if(pos < n)add(pos, pos + 1, -1);
            Y[pos] =  val;
            if(pos < n)add(pos, pos + 1, +1);
            if(pos > 1)add(pos - 1, pos, -1);

        }
        else{
            int h;
            cin >> h;
            cout << query(h) << '\n';
        }

    }

    return 0;
}
/*



// probati bojenje sahovski
*/
 
 
 
 
 

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