// Om Namah Shivaya
// GM in 94 days
#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;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}
void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }
void usaco(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int maxn = 2000 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;
vector<ll> adj[maxn];
struct lca_algo {
// LCA template (for graphs with 1-based indexing)
int LOG = 1;
vector<int> depth;
vector<vector<int>> up;
lca_algo() {
}
lca_algo(int n) {
lca_init(n);
}
void lca_init(int n) {
while ((1 << LOG) < n) LOG++;
up = vector<vector<int>>(n + 1, vector<int>(LOG, 1));
depth = vector<int>(n + 1);
lca_dfs(1, -1);
}
void lca_dfs(int node, int par) {
trav(child, adj[node]) {
if (child == par) conts;
up[child][0] = node;
rep1(j, LOG - 1) {
up[child][j] = up[up[child][j - 1]][j - 1];
}
depth[child] = depth[node] + 1;
lca_dfs(child, node);
}
}
int lift(int u, int k) {
rep(j, LOG) {
if (k & (1 << j)) {
u = up[u][j];
}
}
return u;
}
int query(int u, int v) {
if (depth[u] < depth[v]) swap(u, v);
int k = depth[u] - depth[v];
u = lift(u, k);
if (u == v) return u;
rev(j, LOG - 1, 0) {
if (up[u][j] != up[v][j]) {
u = up[u][j];
v = up[v][j];
}
}
u = up[u][0];
return u;
}
};
void solve(int test_case)
{
// https://github.com/DrSwad/CompetitiveProgramming/blob/master/Olympiad/IZhO/IZhO%2018-treearray.cpp
ll n, m, q; cin >> n >> m >> q;
rep1(i, n - 1) {
ll u, v; cin >> u >> v;
adj[u].pb(v), adj[v].pb(u);
}
lca_algo LCA(n);
vector<ll> a(m + 5);
rep1(i, m) cin >> a[i];
map<ll, set<ll>> mp1, mp2;
rep1(i, m) {
mp1[a[i]].insert(i);
if (i + 1 < m) {
ll lca = LCA.query(a[i], a[i + 1]);
mp2[lca].insert(i);
}
}
while (q--) {
ll op; cin >> op;
if (op == 1) {
ll i, v; cin >> i >> v;
mp1[a[i]].erase(i);
if (i + 1 < m) {
ll lca = LCA.query(a[i], a[i + 1]);
mp2[lca].erase(i);
}
if (i - 1 >= 1) {
ll lca = LCA.query(a[i], a[i - 1]);
mp2[lca].erase(i - 1);
}
a[i] = v;
mp1[a[i]].insert(i);
if (i + 1 < m) {
ll lca = LCA.query(a[i], a[i + 1]);
mp2[lca].insert(i);
}
if (i - 1 >= 1) {
ll lca = LCA.query(a[i], a[i - 1]);
mp2[lca].insert(i - 1);
}
}
else {
ll l, r, v; cin >> l >> r >> v;
auto &st1 = mp1[v], &st2 = mp2[v];
auto it1 = st1.lower_bound(l);
if (it1 != st1.end() and (*it1) <= r) {
cout << *it1 << " " << *it1 << endl;
conts;
}
auto it2 = st2.lower_bound(l);
if (it2 != st2.end() and (*it2) + 1 <= r) {
cout << *it2 << " " << *it2 + 1 << endl;
conts;
}
cout << -1 << " " << -1 << endl;
}
}
}
int main()
{
chrono::steady_clock::time_point begin = chrono::steady_clock::now();
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
chrono::steady_clock::time_point end = chrono::steady_clock::now();
cerr << "[Finished in " << chrono::duration_cast<chrono::microseconds>(end - begin).count() / 1000 << "ms]" << endl;
return 0;
}
Compilation message
treearray.cpp: In function 'void usaco(std::string)':
treearray.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((filename + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
treearray.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | freopen((filename + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
n=5 |
| 2 |
Correct |
1 ms |
340 KB |
n=100 |
| 3 |
Correct |
1 ms |
340 KB |
n=100 |
| 4 |
Incorrect |
1 ms |
340 KB |
Jury has the answer but participant has not |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
n=5 |
| 2 |
Correct |
1 ms |
340 KB |
n=100 |
| 3 |
Correct |
1 ms |
340 KB |
n=100 |
| 4 |
Incorrect |
1 ms |
340 KB |
Jury has the answer but participant has not |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
n=5 |
| 2 |
Correct |
1 ms |
340 KB |
n=100 |
| 3 |
Correct |
1 ms |
340 KB |
n=100 |
| 4 |
Incorrect |
1 ms |
340 KB |
Jury has the answer but participant has not |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
n=5 |
| 2 |
Correct |
1 ms |
340 KB |
n=100 |
| 3 |
Correct |
1 ms |
340 KB |
n=100 |
| 4 |
Incorrect |
1 ms |
340 KB |
Jury has the answer but participant has not |
| 5 |
Halted |
0 ms |
0 KB |
- |
