Submission #1097936

#	Time	Username	Problem	Language	Result	Execution time	Memory
1097936		coldbr3w	Birthday gift (IZhO18_treearray)	C++17	100 / 100	835 ms	104420 KiB

treearray

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pll pair<long long, long long>
#define pb push_back
#define F first
#define S second  
#define all(x) (x).begin(), (x).end()

const ll N = 2e5 + 100;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll block = 350;
ll n,m,q;
vector<ll>adj[N];
ll up[N][20], d[N], a[N];
set<ll>s[N], g[N];
void dfs(ll u, ll par){
    for(auto v : adj[u]){
        if(v == par) continue;
        up[v][0] = u;
        for(int i = 1; i <= 19;i++) up[v][i] = up[up[v][i-1]][i-1];
        d[v] = d[u] + 1;
        dfs(v, u);
    }
}
ll lca(ll u, ll v){
    if(d[u] != d[v]){
        if(d[u] < d[v]) swap(u, v);
        ll k = d[u] - d[v];
        for(int i = 19; i >= 0;i--) if(k & (1 << i)) u = up[u][i];
    }
    if(u == v) return u;
    for(int i = 19; i >= 0;i--) if(up[u][i] != up[v][i]) u = up[u][i], v = up[v][i];
    return up[u][0];
}
void to_thic_cau(){
    cin >> n >> m >> q;
    for(int i = 1; i <= n - 1;i++){
        ll u,v; cin >> u >> v;
        adj[u].pb(v); adj[v].pb(u);
    }
    dfs(1, 0);
    for(int i = 1; i <= m;i++){
        cin >> a[i];
        s[a[i]].insert(i);
        if(i >= 2) g[lca(a[i], a[i-1])].insert(i);
    }
    while(q--){
        ll t; cin >> t;
        if(t == 1){
            ll pos, v; cin >> pos >> v;
            s[a[pos]].erase(pos);
            if(pos > 1) g[lca(a[pos], a[pos-1])].erase(pos);
            if(pos < m) g[lca(a[pos], a[pos+1])].erase(pos + 1);
            a[pos] = v;
            s[a[pos]].insert(pos);
            if(pos > 1) g[lca(a[pos], a[pos-1])].insert(pos);
            if(pos < m) g[lca(a[pos], a[pos+1])].insert(pos + 1);
        }
        else{
            ll l,r,v; cin >> l >> r >> v;
            auto it = s[v].lower_bound(l);
            if(it != s[v].end() && *it <= r){
                cout << (*it) << ' ' << (*it) << '\n';
                continue;
            }
            it = g[v].upper_bound(l);
            if(it != g[v].end() && *it <= r){
                cout << (*it) - 1 << ' ' << (*it) << '\n';
                continue;
            }
            cout << -1 << ' ' << -1 << '\n';
        }
    }
}

signed main()   
{  
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll tc = 1;
    //cin >> tc;
    while(tc--) to_thic_cau();
}

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