Submission #495917

#	Time	Username	Problem	Language	Result	Execution time	Memory
495917		armashka	Birthday gift (IZhO18_treearray)	C++17	100 / 100	1202 ms	121260 KiB

treearray

#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 3e5 + 5;
const ll M = 1e8;
const ll inf = 1e3;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            
 
ll n, m, q, a[N], d[N], len, up[N][30];
vector <ll> g[N], order;
set <ll> st[N], ss[N];
 
void dfs(ll v, ll pr) {
    up[v][0] = pr;
    for (auto to : g[v]) {
        if (to != pr) {
            d[to] = d[v] + 1;
            dfs(to, v);
        }
    }
}

ll lift(ll v, ll time) {
    for (int i = 0; i <= 25; ++ i) {
        if (time & (1 << i)) v = up[v][i];
    }
    return v;
}

ll get_lca(ll u, ll v) {
    if (d[u] < d[v]) swap(u, v);
    u = lift(u, d[u] - d[v]);
    if (u == v) return u;
    for (int i = 25; i >= 0; -- i) {
        if (up[v][i] != up[u][i]) {
            v = up[v][i], u = up[u][i];
        }
    }
    return up[v][0];
}

 
const void solve(/*Armashka*/) {
    cin >> n >> m >> q;
    for (int i = 1; i < n; ++ i) {
        ll u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    dfs(1, -1);
    
    for (int i = 1; i <= 25; ++ i) {
        for (int v = 1; v <= n; ++ v) {
            up[v][i] = up[up[v][i - 1]][i - 1]; 
        }
    }

    for (int i = 1; i <= m; ++ i) cin >> a[i];
    for (int i = 1; i < m; ++ i) {
        ll lca = get_lca(a[i], a[i + 1]);
        st[lca].insert(i);
        ss[a[i]].insert(i);
    }
    ss[a[m]].insert(m);
    while (q --) {
        ll type;
        cin >> type;
        if (type == 1) {
            ll pos, val;
            cin >> pos >> val;
            if (pos > 1) {
                st[get_lca(a[pos], a[pos - 1])].erase(pos - 1);
            }
            if (pos < m) {
                st[get_lca(a[pos], a[pos + 1])].erase(pos);
            }
            ss[a[pos]].erase(pos);
            a[pos] = val;
            ss[a[pos]].insert(pos);
            if (pos > 1) {
                st[get_lca(a[pos], a[pos - 1])].insert(pos - 1);
            }
            if (pos < m) {
                st[get_lca(a[pos], a[pos + 1])].insert(pos);  
            }
        } else {
            ll L, R, v;
            cin >> L >> R >> v;
            auto pos = st[v].lower_bound(L);
            if (pos != st[v].end() && *pos < R) cout << *pos << " " << *pos + 1 << "\n";
            else {
                auto pos = ss[v].lower_bound(L);
                if (pos != ss[v].end() && *pos <= R) cout << *pos << " " << *pos << "\n";
                else cout << "-1 -1\n";
            }
        }
    }
}
 
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}
 
/*
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
*/

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