Submission #1192051

#	Time	Username	Problem	Language	Result	Execution time	Memory
1192051		stefanopulos	Birthday gift (IZhO18_treearray)	C++20	0 / 100	11 ms	23876 KiB

treearray

#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 = 200005; 

int n, m, q;
int A[mxN];

vector<int> g[mxN];

set<int> kec[mxN];
set<int> dva[mxN];

int timer = 0;
int d[mxN];
int in[mxN];
int deda[mxN][20];
void dfs(int v, int p){
    deda[v][0] = p; in[v] = ++timer;
    ff(i,1,19)deda[v][i] = deda[deda[v][i - 1]][i - 1];
    for(auto u : g[v]){
        if(u != p){
            d[u] = d[v] + 1; dfs(u, v);
        }
    }
}

int LCA(int x, int y){
    if(d[x] < d[y])swap(x, y);
    fb(i,19,0)if((d[x] - d[y]) & (1 << i))x = deda[x][i];
    fb(i,19,0)if(deda[x][i] != deda[y][i])x = deda[x][i], y = deda[y][i];
    return (x == y ? x : deda[x][0]);
}

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

    cin >> n >> m >> q;
    ff(i,1,n - 1){
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }

    ff(i,1,m)cin >> A[i];

    dfs(1, 0);

    ff(i,1,m){
        kec[A[i]].insert(i);
        if(i > 1)dva[LCA(A[i - 1], A[i])].insert(i);
    }

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

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

            kec[A[pos]].erase(pos);
            if(pos > 1)dva[LCA(A[pos - 1], A[pos])].erase(pos);
            if(pos < m)dva[LCA(A[pos], A[pos + 1])].erase(pos + 1);

            A[pos] = val;

            kec[A[pos]].insert(pos);
            if(pos > 1)dva[LCA(A[pos - 1], A[pos])].insert(pos);
            if(pos < m)dva[LCA(A[pos], A[pos + 1])].insert(pos + 1);

        }   

        if(t == 2){
            int l, r, v;
            cin >> l >> r >> v;

            auto a = kec[v].lb(l);
            if(a != kec[v].end() && *a <= r){
                cout << *a << " " << *a << '\n';
                continue;
            }

            a = dva[v].lb(l);
            if(a != dva[v].end() && l < *a && *a <= r){
                cout << *a - 1 << " " << *a << '\n';
                continue;
            }

            cout << -1 << " " << -1 << '\n';

        }
    }

    return 0;
}
/*

5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1

// probati bojenje sahovski
*/
 
 
 
 
 

• Subtask 1: 0 / 12
• Subtask 2: 0 / 18
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44