Submission #992074

#	Time	Username	Problem	Language	Result	Execution time	Memory
992074		VMaksimoski008	Birthday gift (IZhO18_treearray)	C++17	56 / 100	3822 ms	27476 KiB

treearray

#include <bits/stdc++.h>

#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,bmi,bmi2,lzcnt,popcnt")

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

int n, m, q, depth[maxn], up[maxn][LOG];
vector<int> graph[maxn], val(maxn);

void dfs(int u, int p) {
    for(int i=1; i<LOG; i++) up[u][i] = up[up[u][i-1]][i-1];

    for(int &v : graph[u]) {
        if(v == p) continue;
        up[v][0] = u;
        depth[v] = depth[u] + 1;
        dfs(v, u);
    }
}

int jmp(int x, int d) {
    for(int j=LOG-1; j>=0; j--)
        if(d & (1 << j)) x = up[x][j];
    return x;
}

int get_lca(int a, int b) {
    if(a == 1e9) return b;
    if(b == 1e9) return a;
    if(depth[a] < depth[b]) swap(a, b);

    a = jmp(a, depth[a] - depth[b]);
    if(a == b) return a;
    for(int j=LOG-1; j>=0; j--)
        if(up[a][j] != up[b][j])
            a = up[a][j], b = up[b][j];

    return up[a][0];
}

struct SegTree {
    int n;
    vector<int> v;
    vector<int> tree;

    SegTree(int _n) {
        n = _n;
        tree.resize(4*n+5, 1e9);
    }

    void build(int u, int tl, int tr) {
        if(tl == tr) {
            tree[u] = v[tl];
        } else {
            int tm = (tl + tr) / 2;
            build(2*u, tl, tm);
            build(2*u+1, tm+1, tr);
            tree[u] = get_lca(tree[2*u], tree[2*u+1]);
        }
    }

    void update(int u, int tl, int tr, int p, int v) {
        if(tl == tr) {
            tree[u] = v;
        } else {
            int tm = (tl + tr) / 2;
            if(p <= tm) update(2*u, tl, tm, p, v);
            else update(2*u+1, tm+1, tr, p, v);
            tree[u] = get_lca(tree[2*u], tree[2*u+1]);
        }
    }

    int query(int u, int tl, int tr, int l, int r) {
        if(tl > tr || l > tr || tl > r) return 1e9;
        if(l <= tl && tr <= r) return tree[u];
        int tm = (tl + tr) / 2;
        return get_lca(
            query(2*u, tl, tm, l, r),
            query(2*u+1, tm+1, tr, l, r)
        );
    }

    void update(int p, int v) { update(1, 0, n-1, p, v); }
    int query(int l, int r) { return query(1, 0, n-1, l, r); }
};

int32_t main() {
    ios_base::sync_with_stdio(false);
    cout.tie(0); cin.tie(0);

    cin >> n >> m >> q;

    for(int i=0; i<n-1; i++) {
        int a, b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    dfs(1, 0);

    for(int i=1; i<=m; i++) {
        cin >> val[i];
    }

    SegTree tree(m+1);
    for(int i=1; i<=m; i++) tree.update(i, val[i]);

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

        if(t == 1) {
            int p, v;
            cin >> p >> v;
            val[p] = v;
            tree.update(p, v);
        } else {
            int l, r, v;
            cin >> l >> r >> v;

            bool ok = 0;

            for(int i=l; i<=r; i++) {
                int d = depth[v];
                int tl=i, tr=r, pos=i;
                while(tl <= tr) {
                    int mid = (tl + tr) / 2;
                    if(depth[tree.query(i, mid)] >= d) pos = mid, tl = mid + 1;
                    else tr = mid - 1;
                }

                //cout << i << ": " << pos << ", " << d << '\n';
                //cout << tree.query(i, pos) << '\n';
                if(tree.query(i, pos) == v && !ok) {
                    ok = 1;
                    cout << i << " " << pos << '\n';
                    break;
                }
            }

            if(!ok) cout << "-1 -1" << '\n';
        }
    }

    return 0;
}

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