Submission #470617

#	Time	Username	Problem	Language	Result	Execution time	Memory
470617		Return_0	Birthday gift (IZhO18_treearray)	C++17	100 / 100	841 ms	99144 KiB

treearray

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 2e5 + 7;

ll a [N], h [N], par [N], hd [N], bc [N], sz [N], n, m, q;
set <ll> pos [N], st [N];
vector <ll> adj [N];

ll DFS (cl &v = 1, cl &pr = 0) {
	h[v] = h[par[v] = pr] + 1;
	for (auto &u : adj[v]) if (u != pr) sz[v] += DFS(u, v), bc[v] = sz[u] > sz[bc[v]] ? u : bc[v];
	return ++sz[v];
}

void HLD (cl &v = 1, cl &head = 1) {
	hd[v] = head;
	if (bc[v]) HLD(bc[v], head);
	for (auto &u : adj[v]) if (u != par[v] && u != bc[v]) HLD(u, u);
}

inline ll LCA (ll v, ll u) {
	while (hd[v] != hd[u]) {
		if (h[hd[v]] < h[hd[u]]) u = par[hd[u]];
		else v = par[hd[v]];
	}
	return h[v] < h[u] ? v : u;
}

int main ()
{
	cin.tie(0)->sync_with_stdio(false);

	cin>> n >> m >> q;
	for (ll v, u, i = 1; i < n; i++) {
		cin>> v >> u;
		adj[v].push_back(u);
		adj[u].push_back(v);
	}
	assert(DFS() == n); HLD();
	for (ll i = 1; i <= m; i++) cin>> a[i], pos[a[i]].insert(i);
	for (ll i = 1; i < m; i++) st[LCA(a[i], a[i + 1])].insert(i);
	for (ll tp, x, y, z; q--;) {
		cin>> tp >> x >> y;
		if (tp == 1) {
			pos[a[x]].erase(x);
			if (x > 1) st[LCA(a[x - 1], a[x])].erase(x - 1);
			if (x < m) st[LCA(a[x], a[x + 1])].erase(x);
			pos[a[x] = y].insert(x);
			if (x > 1) st[LCA(a[x - 1], a[x])].insert(x - 1);
			if (x < m) st[LCA(a[x], a[x + 1])].insert(x);
		} else {
			cin>> z;
			auto it = pos[z].lower_bound(x);
			if (it != pos[z].end() && *it <= y) { cout<< *it << ' ' << *it << '\n'; continue; }
			it = st[z].lower_bound(x);
			if (it != st[z].end() && *it < y) { cout<< *it << ' ' << *it + 1 << '\n'; continue; }
			cout<< "-1 -1\n";
		}
	}

	cerr<< "\n" __TIMESTAMP__ " - Time elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
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