Submission #54390

#	Time	Username	Problem	Language	Result	Execution time	Memory
54390		egorlifar	Birthday gift (IZhO18_treearray)	C++17	100 / 100	1491 ms	233844 KiB

treearray

/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <iomanip>
#include <deque>
    
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define x first
#define y second
const string FILENAME = "input";
const int MAXN = 200228;

//12:00
//17:00
int n, m, q;
vector<int> g[MAXN];
int a[MAXN];
int jump[MAXN][20];
int in[MAXN];
int out[MAXN];
int timer = 0;


void dfs(int u, int pr = -1) {
    timer++;
    in[u] = timer;
    for (auto h: g[u]) {
        if (h != pr) {
            jump[h][0] = u;
            dfs(h, u);
        }
    }
    out[u] = timer;
}


bool is_ancestor(int a, int b) {
    return in[a] <= in[b] && out[b] <= out[a];
}


int lca(int a, int b) {
    if (is_ancestor(a, b)) {
        return a;
    }
    if (is_ancestor(b, a)) {
        return b;
    }
    for (int k = 18; k >= 0; k--) {
        if (!is_ancestor(jump[a][k], b)) {
            a = jump[a][k];
        }
    }
    return jump[a][0];
}


set<int> pos[MAXN];
set<int> kek[MAXN];


void del(int i) {
    pos[a[i]].erase(i);
    if (i) {
        kek[lca(a[i - 1], a[i])].erase(i - 1);
    }
    if (i + 1 < m) {
        kek[lca(a[i], a[i + 1])].erase(i);
    }
}


void add(int i) {
    pos[a[i]].insert(i);
    if (i) {
        kek[lca(a[i - 1], a[i])].insert(i - 1);
    }
    if (i + 1 < m) {
        kek[lca(a[i], a[i + 1])].insert(i);
    }
}


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
    cin >> n >> m >> q;
    for (int i = 0; i < n - 1; i++) {
        int c, d;
        cin >> c >> d;
        c--, d--;
        g[c].pb(d);
        g[d].pb(c);
    }
    dfs(0);
    for (int k = 1; k <= 18; k++) {
        for (int i = 0; i < n; i++) {
            jump[i][k] = jump[jump[i][k - 1]][k - 1];
        }
    }
    for (int i = 0; i < m; i++) {
        cin >> a[i];
        a[i]--;
        pos[a[i]].insert(i);
        if (i) {
            kek[lca(a[i - 1], a[i])].insert(i - 1);
        }
    }
    //return 0;
    for (int it = 0; it < q; it++) {
        int t;
        cin >> t;
        if (t == 1) {
            int id, val;
            cin >> id >> val;
            val--;
            id--;
            del(id);
            a[id] = val;
            add(id);
        } else {
            int l, r, v;
            cin >> l >> r >> v;
            l--, r--, v--;
            auto it = pos[v].lower_bound(l);
            if (it != pos[v].end()) {
                int as = *it;
                if (as <= r) {
                    cout << as + 1 << ' ' << as + 1 << '\n';
                    continue;
                }
            }
            it = kek[v].lower_bound(l);
              if (it != kek[v].end()) {
                int as = *it;
                if (as < r) {
                    cout << as + 1 << ' ' << as + 2 << '\n';
                    continue;
                }
            }
            cout << -1 << ' ' << -1 << '\n';
        }
    }   
}       

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