Submission #495924

#	Time	Username	Problem	Language	Result	Execution time	Memory
495924		kingline	Birthday gift (IZhO18_treearray)	C++17	0 / 100	15 ms	23912 KiB

treearray

#include <bits/stdc++.h>
#define pb push_back
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define all(data) data.begin() , data.end()
#define endl '\n'
//freopen("nenokku_easy.in", "r", stdin);
//freopen("nenokku_easy.out", "w", stdout);
//#define int long long
#define pii pair < int, int >

using namespace std;

typedef long long ll;
const int N = 2e5 + 5;
const int lg = 21;

int n, m, q, tin[N], tout[N], sz, up[N][lg], a[N];
vector < int > g[N];

void dfs(int v, int pr) {
    tin[v] = ++sz;
    up[v][0] = pr;
    for(int i = 1; i < lg; i++) {
        up[v][i] = up[up[v][i - 1]][i - 1];
    }
    for(int i = 0; i < g[v].size(); i++) {
        int to = g[v][i];
        if(to != pr) {
            dfs(to, v);
        }
    }
    tout[v] = ++sz;
}

bool upper(int x, int y) {
    return tin[x] <= tin[y] && tout[x] >= tout[y];
}

int lca(int x, int y) {
    if(upper(x, y)) return x;
    if(upper(y, x)) return y;
    for(int i = lg - 1; i >= 0; i--) {
        if(up[x][i] == 0) continue;
        if(!upper(up[x][i], y)) {
            x = up[x][i];
        }
    }
    return up[x][0];
}

main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m >> q;
    for(int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }
    dfs(1, 1);
    multiset < int > st1[N];
    for(int i = 1; i <= m; i++) {
        cin >> a[i];
        st1[a[i]].insert(i);
    }
    multiset < int > st2[N];
    for(int i = 1; i < m; i++) {
        int lc = lca(a[i], a[i + 1]);
        st2[lc].insert(i);
    }
    while(q--) {
        int tp, pos, l, r, v;
        cin >> tp;
        if(tp % 2) {
            cin >> pos >> v;
            st1[a[pos]].erase(pos);
            st1[v].insert(pos);
            if(pos != 1) {
                st2[lca(a[pos - 1], a[pos])].erase(pos - 1);
            }
            if(pos != m) {
                st2[lca(a[pos + 1], a[pos])].erase(pos + 1);
            }
            if(pos != 1) {
                st2[lca(a[pos - 1], v)].insert(pos - 1);
            }
            if(pos != m) {
                st2[lca(a[pos + 1], v)].insert(pos + 1);
            }
            a[pos] = v;
        } else {
            cin >> l >> r >> v;
            if(st1[v].size()) {
                int res = *st1[v].lower_bound(l);
                if(l <= res && res <= r) {
                    cout << res << " " << res << endl;
                    continue;
                }
            }
            if(st2[v].size()) {
                int res = *st2[v].lower_bound(l);
                if(l <= res && res < r) {
                    cout << res << " " << res + 1 << endl;
                    continue;
                }
            }
            cout << "-1 -1\n";
        }
    }
}

Compilation message (stderr)

treearray.cpp: In function 'void dfs(int, int)':
treearray.cpp:26:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |     for(int i = 0; i < g[v].size(); i++) {
      |                    ~~^~~~~~~~~~~~~
treearray.cpp: At global scope:
treearray.cpp:51:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   51 | main() {
      | ^~~~

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