제출 #495705

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
495705		armashka	Birthday gift (IZhO18_treearray)	C++17	12 / 100	4034 ms	7504 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], p[N], len, t[N * 4], tree[N * 4];
vector <ll> g[N], order;
bool used[N];

void dfs(ll v) {
    used[v] = 1;
    order.pb(v);
    for (auto to : g[v]) {
        if (!used[to]) {
            d[to] = d[v] + 1;
            dfs(to);
            order.pb(v);
        }
    }

}

void build(ll v = 1, ll tl = 1, ll tr = len) {
    if (tl == tr) {
        t[v] = order[tl - 1];
        return;
    }
    ll tm = (tl + tr) / 2;
    build(v + v, tl, tm);
    build(v + v + 1, tm + 1, tr);
    if (d[t[v + v]] < d[t[v + v + 1]]) t[v] = t[v + v];
    else t[v] = t[v + v + 1];
}

ll get_lca(ll l, ll r, ll v = 1, ll tl = 1, ll tr = len) {
    if (r < tl || tr < l) return 0;
    if (l <= tl && tr <= r) return t[v];
    ll tm = (tl + tr) / 2;
    ll ans1 = get_lca(l, r, v + v, tl, tm);
    ll ans2 = get_lca(l, r, v + v + 1, tm + 1, tr);
    if (d[ans1] < d[ans2]) return ans1;
    else return ans2;
}

void build_tree(ll v = 1, ll tl = 1, ll tr = n) {
    if (tl == tr) {
        tree[v] = a[tl];
        return;
    }
    ll tm = (tl + tr) / 2;
    build_tree(v + v, tl, tm);
    build_tree(v + v + 1, tm + 1, tr);
    ll l = p[t[v + v]], r = p[t[v + v + 1]];
    if (l > r) swap(l, r);
    tree[v] = get_lca(l, r);
}

void upd(ll pos, ll val, ll v = 1, ll tl = 1, ll tr = n) {
    if (tl == tr) {
        tree[v] = val;
        return;
    }
    ll tm = (tl + tr) / 2;
    if (pos <= tm) upd(pos, val, v + v, tl, tm);
    else upd(pos, val, v + v + 1, tm + 1, tr);
    ll l = p[t[v + v]], r = p[t[v + v + 1]];
    if (l > r) swap(l, r);
    tree[v] = get_lca(l, r);

}

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);
    len = order.sz;
    build();
    for (int i = 0; i < len; ++ i) {
        ll cur = order[i];
        if (!p[cur]) p[cur] = i + 1;
    }
    d[0] = inf;
    for (int i = 1; i <= m; ++ i) cin >> a[i];
    build_tree();
    while (q --) {
        ll type;
        cin >> type;
        if (type == 1) {
            ll pos, val;
            cin >> pos >> val;
            upd(pos, val);
            a[pos] = val;
        } else {
            ll l, r, v;
            cin >> l >> r >> v;
            bool ok = 0;
            for (int i = l; i <= r; ++ i) {
                ll cur = a[i];
                for (int j = i; j <= r; ++ j) {
                    ll f = p[cur], s = p[a[j]];
                    if (f > s) swap(f, s);
                    cur = get_lca(f, s);
                    if (cur == v) {
                        cout << i << " " << j << "\n";
                        ok = 1;
                        break;
                    }
                }
                if (ok) break;
            }
            if (!ok) 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: 0 / 18
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44