/*************************************
* author: marvinthang *
* created: 04.07.2023 17:42:26 *
*************************************/
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define left ___left
#define right ___right
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define MASK(i) (1LL << (i))
#define BIT(x, i) ((x) >> (i) & 1)
#define __builtin_popcount __builtin_popcountll
#define ALL(v) (v).begin(), (v).end()
#define REP(i, n) for (int i = 0, _n = (n); i < _n; ++i)
#define REPD(i, n) for (int i = (n); i--; )
#define FOR(i, a, b) for (int i = (a), _b = (b); i < _b; ++i)
#define FORD(i, b, a) for (int i = (b), _a = (a); --i >= _a; )
#define FORE(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORDE(i, b, a) for (int i = (b), _a = (a); i >= _a; --i)
#define scan_op(...) istream & operator >> (istream &in, __VA_ARGS__ &u)
#define print_op(...) ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
#include "debug.h"
#else
#define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define DB(...) 23
#define db(...) 23
#define debug(...) 23
#endif
template <class U, class V> scan_op(pair <U, V>) { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>) { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>) { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b) { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b) { if (a < b) { a = b; return true; } return false; }
// index from 0
template <class T = int>
struct Fenwick {
T *bit = nullptr;
int n;
Fenwick(int _n = 0) {
resize(_n);
}
void reset(void) {
fill(bit, bit + 1 + n, T(0));
}
void resize(int _n) {
if (bit != nullptr) delete[] bit;
n = _n;
bit = new T[n + 1];
reset();
}
void update(int i, T val) {
assert(0 <= i);
++i;
for (; i <= n; i += i & -i) bit[i] += val;
}
T get(int i) {
if (i < 0) return T(0);
++i;
i = min(i, n);
T res(0);
for (; i > 0; i -= i & -i)
res += bit[i];
return res;
}
int upper_bound(T val) {
int res = 0;
for (int i = __lg(n); i >= 0; --i) {
if ((res | MASK(i)) <= n && val >= bit[res | MASK(i)]) {
res |= MASK(i);
val -= bit[res];
}
}
return res;
}
int lower_bound(T val) {
int res = 0;
for (int i = __lg(n); i >= 0; --i) {
if ((res | MASK(i)) <= n && val > bit[res | MASK(i)]) {
res |= MASK(i);
val -= bit[res];
}
}
return res;
}
};
// end of template
const int MAX = 1e5 + 5;
const int LOG = 20;
int N, M, Q, tin[MAX], tout[MAX];
vector <int> adj[MAX];
pair <int, int> edges[MAX];
vector <pair <int, int>> events;
int anc[MAX][LOG], depth[MAX], res[MAX];
int U[MAX], V[MAX], X[MAX], lca[MAX];
long long Y[MAX];
void init(void) {
cin >> N >> M >> Q;
REP(i, N - 1) {
int u, v; cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
edges[i] = make_pair(u, v);
}
}
void dfs(int u) {
static int timeDfs = 0;
tin[u] = timeDfs++;
depth[u] = depth[anc[u][0]] + 1;
FOR(i, 1, LOG) anc[u][i] = anc[anc[u][i - 1]][i - 1];
for (int v: adj[u]) if (v != anc[u][0]) {
anc[v][0] = u;
dfs(v);
}
tout[u] = timeDfs;
}
int get_lca(int u, int v) {
if (depth[u] < depth[v]) swap(u, v);
REPD(i, LOG) if (depth[anc[u][i]] >= depth[v]) u = anc[u][i];
if (u == v) return u;
REPD(i, LOG) if (anc[u][i] != anc[v][i]) {
u = anc[u][i];
v = anc[v][i];
}
return anc[u][0];
}
Fenwick <int> cnt;
Fenwick <long long> sum;
void add(int p, int v) {
int w = events[p].fi * v;
p = events[p].se;
cnt.update(tin[p], -v);
cnt.update(tout[p], v);
sum.update(tin[p], w);
sum.update(tout[p], -w);
}
int calc(int i) {
long long s = sum.get(tin[U[i]]) + sum.get(tin[V[i]]) - 2 * sum.get(tin[lca[i]]);
if (s <= Y[i]) {
int c = cnt.get(tin[U[i]]) + cnt.get(tin[V[i]]) - 2 * cnt.get(tin[lca[i]]);
return max(-1, X[i] - c);
}
return -2;
}
void solve(int l, int r, const vector <int> &q) {
if (q.empty()) return;
if (r - l == 1) {
for (int i: q) res[i] = calc(i);
if (r == M) {
add(l, 1);
for (int i: q) maximize(res[i], calc(i));
add(l, -1);
}
return;
}
int m = l + r >> 1;
FOR(i, l, m) add(i, 1);
vector <int> ql, qr;
for (int i: q) (calc(i) == -2 ? ql : qr).push_back(i);
solve(m, r, qr);
FOR(i, l, m) add(i, -1);
solve(l, m, ql);
}
void process(void) {
dfs(1);
sum.resize(N);
cnt.resize(N);
REP(i, M) {
int p, c; cin >> p >> c; --p;
p = anc[edges[p].fi][0] == edges[p].se ? edges[p].fi : edges[p].se;
events.emplace_back(c, p);
cnt.update(tin[p], +1);
cnt.update(tout[p], -1);
}
sort(ALL(events));
vector <int> q;
REP(i, Q) {
cin >> U[i] >> V[i] >> X[i] >> Y[i];
lca[i] = get_lca(v[0], v[1]);
q.push_back(i);
}
solve(0, M, q);
REP(i, Q) cout << res[i] << '\n';
}
int main(void) {
ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
file("currencies");
init();
process();
cerr << "Time elapsed: " << TIME << " s.\n";
return (0^0);
}
Compilation message
currencies.cpp: In function 'void solve(int, int, const std::vector<int>&)':
currencies.cpp:185:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
185 | int m = l + r >> 1;
| ~~^~~
currencies.cpp: In function 'void process()':
currencies.cpp:209:20: error: 'v' was not declared in this scope
209 | lca[i] = get_lca(v[0], v[1]);
| ^
currencies.cpp: In function 'int main()':
currencies.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:218:2: note: in expansion of macro 'file'
218 | file("currencies");
| ^~~~
currencies.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
30 | #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
currencies.cpp:218:2: note: in expansion of macro 'file'
218 | file("currencies");
| ^~~~
