//Bismillahir-Rahmanir-Rahim
#include <bits/stdc++.h>
using namespace std;
#define flash ios_base::sync_with_stdio(0),cin.tie(0)
#define pb push_back
#define ll long long
#define ld long double
#define dbg(x) cerr << #x << " = " << x << "\n";
#define ff first
#define ss second
/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma comment (linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
const long long INF = 1e9 + 7;
const long long MOD = 1e9 + 7;
const int maxn = 2e5 + 10;
const int lg = 22;
int n, m, q, a[maxn], upp[maxn][lg + 1], tin[maxn], tout[maxn], timer;
vector <int> g[maxn];
void dfs(int v, int p) {
upp[v][0] = p;
tin[v] = ++timer;
for (int i = 1; i <= lg; i++) {
upp[v][i] = upp[upp[v][i - 1]][i - 1];
}
for (auto to: g[v]) {
if (to != p) {
dfs(to, v);
}
}
tout[v] = timer;
}
bool check(int a, int b) {
if (tin[a] <= tin[b] && tout[a] >= tout[b]) {
return 1;
}
return 0;
}
void press_F_() {
cin >> n >> m >> q;
for (int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
g[x].pb(y);
g[y].pb(x);
}
for (int i = 1; i <= m; i++) {
cin >> a[i];
}
dfs(1, 0);
while(q--) {
int tp;
cin >> tp;
if (tp == 1) {
int pos, v;
cin >> pos >> v;
a[pos] = v;
} else {
int l, r, u;
cin >> l >> r >> u;
int x = l, nx = INF, ny = -INF, lca;
lca = a[l];
for (int i = l; i <= r; i++) {
if (a[i] == u) {
if (ny - nx + 1 < i - i + 1) {
ny = i;
nx = i;
}
}
if (check(a[i], lca)) {
lca = a[i];
if (lca == u) {
if (ny - nx + 1 < i - x + 1) {
nx = x;
ny = i;
}
}
if (!check(u, lca)) {
x = i;
lca = a[i];
}
continue;
}
if (check(a[i], lca)) {
if (lca == u) {
if (ny - nx + 1 < i - x + 1) {
nx = x;
ny = i;
}
}
if (!check(u, lca)) {
lca = a[i];
x = i;
}
continue;
}
int cur = a[i];
for (int j = lg; j >= 0; j--) {
if (!check(upp[cur][j], lca) && upp[cur][j] != 0) {
cur = upp[cur][j];
}
}
if (upp[cur][0] == u) {
if (ny - nx + 1 < i - x + 1) {
nx = x;
ny = i;
}
lca = upp[cur][0];
}
if (!check(u, lca)) {
lca = a[i];
x = i;
}
}
if (nx == INF && ny == -INF) {
nx = -1;
ny = -1;
}
cout << nx << " " << ny << '\n';
}
}
}
/*
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
*/
int main() {
flash;
// srand(time(0));
int T = 1;
// cin >> T;
for (int i = 1; i <= T; i++) {
// cout << "Case" << " " << i << ':' << "\n";
press_F_();
}
//Respa gold 2023-2024 InshAllah
return 0;
}
/*
Maybe not today and tomorrow, but InshAllah one day I will reach expert
*/
// g++ -std=c++17 main.cpp
// ./a.out
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8796 KB |
n=5 |
| 2 |
Incorrect |
2 ms |
8792 KB |
Wrong range. |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8796 KB |
n=5 |
| 2 |
Incorrect |
2 ms |
8792 KB |
Wrong range. |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8796 KB |
n=5 |
| 2 |
Incorrect |
2 ms |
8792 KB |
Wrong range. |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
8796 KB |
n=5 |
| 2 |
Incorrect |
2 ms |
8792 KB |
Wrong range. |
| 3 |
Halted |
0 ms |
0 KB |
- |
