#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 18;
const ll MAXN = 1e5 + 5;
struct Query {
int from, to;
ll gold, silver;
int low;
Query(int a, int b, ll c, ll d) : from(a), to(b), gold(c), silver(d) { }
};
vector<vector<int>> graph;
vector<pair<int,int>> edges;
vector<pair<ll,int>> cost;
vector<Query> queries;
int depth[MAXN], up[LOGN][MAXN], cnt[MAXN], counter[MAXN];
int tin[MAXN], tout[MAXN], mx_silver[MAXN], ans[MAXN];
ll fen[MAXN], fen2[MAXN];
int T = 0;
void dfs(int node, int parent) {
tin[node] = ++T;
for (auto u : graph[node]) {
if (u == parent)
continue;
depth[u] = depth[node] + 1;
up[0][u] = node;
for (int i = 1; i < LOGN; i++)
up[i][u] = up[i-1][up[i-1][u]];
dfs(u, node);
}
tout[node] = T;
}
void dfs2(int node, int parent) {
counter[node] = counter[parent] + cnt[node];
for (auto u : graph[node]) {
if (u == parent)
continue;
dfs2(u, node);
}
}
int find(int node, int k) {
for (int i = 0; i < LOGN; i++) {
if ((1<<i) & k)
node = up[i][node];
}
return node;
}
int lca(int a, int b) {
if (depth[b] > depth[a])
swap(a, b);
a = find(a, depth[a] - depth[b]);
if (a == b)
return a;
for (int i = LOGN-1; i >= 0; i--) {
if (up[i][a] != up[i][b]) {
a = up[i][a];
b = up[i][b];
}
}
return up[0][a];
}
void update(int k, ll val) {
while (k < MAXN) {
fen[k] += val;
if (val > 0)
fen2[k]++;
else if (val < 0)
fen2[k]--;
k += k & -k;
}
}
void range(int l, int r, ll val) {
update(l, val);
update(r+1, -val);
}
ll get(int k) {
k = tin[k];
ll res = 0;
while (k) {
res += fen[k];
k -= k & -k;
}
return res;
}
int get2(int k) {
k = tin[k];
int res = 0;
while (k) {
res += fen2[k];
k -= k & -k;
}
return res;
}
void parallel(ll l, ll r, vector<int> qs) {
if (l > r || qs.size() == 0)
return ;
if (l == r) {
int node = cost[l-1].s;
ll C = cost[l-1].f;
range(tin[node], tout[node], C);
for (auto u : qs) {
Query qry = queries[u];
ll total_silver = get(qry.from) + get(qry.to) - 2 * get(qry.low);
if (total_silver <= qry.silver)
ans[u] = get2(qry.from) + get2(qry.to) - 2 * get2(qry.low);
}
range(tin[node], tout[node], -C);
return ;
}
int mid = l + (r-l)/2;
for (ll i = l; i <= mid; i++) {
int node = cost[i-1].s;
ll C = cost[i-1].f;
range(tin[node], tout[node], C);
}
vector<int> left, right;
for (auto u : qs) {
Query qry = queries[u];
ll total_silver = get(qry.from) + get(qry.to) - 2 * get(qry.low);
if (total_silver <= qry.silver) {
right.push_back(u);
ans[u] = get2(qry.from) + get2(qry.to) - 2 * get2(qry.low);
} else
left.push_back(u);
}
parallel(mid+1, r, right);
for (int i = mid; i >= l; i--) {
int node = cost[i-1].s;
ll C = cost[i-1].f;
range(tin[node], tout[node], -C);
}
parallel(l, mid, left);
}
int main() {
fast
int N, M, Q, u, v;
cin >> N >> M >> Q;
graph = vector<vector<int>>(N+1, vector<int>());
for (int i = 1; i < N; i++) {
cin >> u >> v;
edges.push_back({u, v});
graph[u].push_back(v);
graph[v].push_back(u);
}
for (int i = 0; i < LOGN; i++)
up[i][1] = 1;
dfs(1, 1);
for (int i = 0; i < M; i++) {
ll P, C;
cin >> P >> C;
int edge = (depth[edges[P-1].f] > depth[edges[P-1].s] ? edges[P-1].f : edges[P-1].s);
cnt[edge]++;
cost.push_back({C, edge});
}
sort(cost.begin(), cost.end());
dfs2(1, 1);
for (int i = 0; i < Q; i++) {
ll a, b, c, d;
cin >> a >> b >> c >> d;
queries.push_back(Query(a, b, c, d));
queries.back().low = lca(queries.back().from, queries.back().to);
}
vector<int> qs;
for (int i = 0; i < Q; i++)
qs.push_back(i);
parallel(1, cost.size(), qs);
for (int i = 0; i < Q; i++) {
int all = counter[queries[i].from] + counter[queries[i].to] - 2 * counter[queries[i].low];
int can_be_silver = ans[i];
if (all-can_be_silver > queries[i].gold)
cout << "-1\n";
else
cout << queries[i].gold - all + can_be_silver << "\n";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
10588 KB |
Output is correct |
2 |
Correct |
1 ms |
10588 KB |
Output is correct |
3 |
Correct |
2 ms |
10588 KB |
Output is correct |
4 |
Correct |
2 ms |
10588 KB |
Output is correct |
5 |
Correct |
4 ms |
11072 KB |
Output is correct |
6 |
Correct |
5 ms |
11352 KB |
Output is correct |
7 |
Correct |
5 ms |
11100 KB |
Output is correct |
8 |
Correct |
5 ms |
11100 KB |
Output is correct |
9 |
Correct |
6 ms |
11100 KB |
Output is correct |
10 |
Correct |
6 ms |
11100 KB |
Output is correct |
11 |
Correct |
5 ms |
11100 KB |
Output is correct |
12 |
Correct |
5 ms |
10968 KB |
Output is correct |
13 |
Correct |
6 ms |
11184 KB |
Output is correct |
14 |
Correct |
6 ms |
11100 KB |
Output is correct |
15 |
Correct |
6 ms |
11100 KB |
Output is correct |
16 |
Correct |
6 ms |
11100 KB |
Output is correct |
17 |
Correct |
6 ms |
11100 KB |
Output is correct |
18 |
Correct |
6 ms |
11100 KB |
Output is correct |
19 |
Correct |
6 ms |
11172 KB |
Output is correct |
20 |
Correct |
6 ms |
11100 KB |
Output is correct |
21 |
Correct |
5 ms |
11100 KB |
Output is correct |
22 |
Correct |
5 ms |
11100 KB |
Output is correct |
23 |
Correct |
6 ms |
11096 KB |
Output is correct |
24 |
Correct |
5 ms |
11100 KB |
Output is correct |
25 |
Correct |
6 ms |
11100 KB |
Output is correct |
26 |
Correct |
4 ms |
11016 KB |
Output is correct |
27 |
Correct |
4 ms |
11100 KB |
Output is correct |
28 |
Correct |
5 ms |
10972 KB |
Output is correct |
29 |
Correct |
5 ms |
11352 KB |
Output is correct |
30 |
Correct |
5 ms |
11100 KB |
Output is correct |
31 |
Correct |
6 ms |
11096 KB |
Output is correct |
32 |
Correct |
5 ms |
11100 KB |
Output is correct |
33 |
Correct |
6 ms |
11184 KB |
Output is correct |
34 |
Correct |
5 ms |
11100 KB |
Output is correct |
35 |
Correct |
6 ms |
11100 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
10588 KB |
Output is correct |
2 |
Correct |
6 ms |
11100 KB |
Output is correct |
3 |
Correct |
5 ms |
11100 KB |
Output is correct |
4 |
Correct |
5 ms |
11100 KB |
Output is correct |
5 |
Correct |
235 ms |
29828 KB |
Output is correct |
6 |
Correct |
274 ms |
31160 KB |
Output is correct |
7 |
Correct |
262 ms |
31840 KB |
Output is correct |
8 |
Correct |
233 ms |
30480 KB |
Output is correct |
9 |
Correct |
209 ms |
27888 KB |
Output is correct |
10 |
Correct |
324 ms |
30856 KB |
Output is correct |
11 |
Correct |
313 ms |
30900 KB |
Output is correct |
12 |
Correct |
305 ms |
30804 KB |
Output is correct |
13 |
Correct |
320 ms |
31580 KB |
Output is correct |
14 |
Correct |
305 ms |
30668 KB |
Output is correct |
15 |
Correct |
380 ms |
38772 KB |
Output is correct |
16 |
Correct |
337 ms |
38828 KB |
Output is correct |
17 |
Correct |
351 ms |
37952 KB |
Output is correct |
18 |
Correct |
331 ms |
31164 KB |
Output is correct |
19 |
Correct |
347 ms |
30960 KB |
Output is correct |
20 |
Correct |
350 ms |
30896 KB |
Output is correct |
21 |
Correct |
310 ms |
34152 KB |
Output is correct |
22 |
Correct |
291 ms |
33468 KB |
Output is correct |
23 |
Correct |
301 ms |
33396 KB |
Output is correct |
24 |
Correct |
294 ms |
33408 KB |
Output is correct |
25 |
Correct |
275 ms |
31936 KB |
Output is correct |
26 |
Correct |
272 ms |
32696 KB |
Output is correct |
27 |
Correct |
267 ms |
32356 KB |
Output is correct |
28 |
Correct |
184 ms |
33464 KB |
Output is correct |
29 |
Correct |
175 ms |
33784 KB |
Output is correct |
30 |
Correct |
220 ms |
33068 KB |
Output is correct |
31 |
Correct |
241 ms |
32704 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
10584 KB |
Output is correct |
2 |
Correct |
6 ms |
11096 KB |
Output is correct |
3 |
Correct |
6 ms |
11100 KB |
Output is correct |
4 |
Correct |
5 ms |
11100 KB |
Output is correct |
5 |
Correct |
218 ms |
36140 KB |
Output is correct |
6 |
Correct |
214 ms |
37824 KB |
Output is correct |
7 |
Correct |
275 ms |
33728 KB |
Output is correct |
8 |
Correct |
319 ms |
38904 KB |
Output is correct |
9 |
Correct |
333 ms |
38860 KB |
Output is correct |
10 |
Correct |
330 ms |
38864 KB |
Output is correct |
11 |
Correct |
274 ms |
38892 KB |
Output is correct |
12 |
Correct |
282 ms |
39848 KB |
Output is correct |
13 |
Correct |
275 ms |
38740 KB |
Output is correct |
14 |
Correct |
218 ms |
38904 KB |
Output is correct |
15 |
Correct |
193 ms |
38588 KB |
Output is correct |
16 |
Correct |
242 ms |
39196 KB |
Output is correct |
17 |
Correct |
246 ms |
38900 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
10588 KB |
Output is correct |
2 |
Correct |
1 ms |
10588 KB |
Output is correct |
3 |
Correct |
2 ms |
10588 KB |
Output is correct |
4 |
Correct |
2 ms |
10588 KB |
Output is correct |
5 |
Correct |
4 ms |
11072 KB |
Output is correct |
6 |
Correct |
5 ms |
11352 KB |
Output is correct |
7 |
Correct |
5 ms |
11100 KB |
Output is correct |
8 |
Correct |
5 ms |
11100 KB |
Output is correct |
9 |
Correct |
6 ms |
11100 KB |
Output is correct |
10 |
Correct |
6 ms |
11100 KB |
Output is correct |
11 |
Correct |
5 ms |
11100 KB |
Output is correct |
12 |
Correct |
5 ms |
10968 KB |
Output is correct |
13 |
Correct |
6 ms |
11184 KB |
Output is correct |
14 |
Correct |
6 ms |
11100 KB |
Output is correct |
15 |
Correct |
6 ms |
11100 KB |
Output is correct |
16 |
Correct |
6 ms |
11100 KB |
Output is correct |
17 |
Correct |
6 ms |
11100 KB |
Output is correct |
18 |
Correct |
6 ms |
11100 KB |
Output is correct |
19 |
Correct |
6 ms |
11172 KB |
Output is correct |
20 |
Correct |
6 ms |
11100 KB |
Output is correct |
21 |
Correct |
5 ms |
11100 KB |
Output is correct |
22 |
Correct |
5 ms |
11100 KB |
Output is correct |
23 |
Correct |
6 ms |
11096 KB |
Output is correct |
24 |
Correct |
5 ms |
11100 KB |
Output is correct |
25 |
Correct |
6 ms |
11100 KB |
Output is correct |
26 |
Correct |
4 ms |
11016 KB |
Output is correct |
27 |
Correct |
4 ms |
11100 KB |
Output is correct |
28 |
Correct |
5 ms |
10972 KB |
Output is correct |
29 |
Correct |
5 ms |
11352 KB |
Output is correct |
30 |
Correct |
5 ms |
11100 KB |
Output is correct |
31 |
Correct |
6 ms |
11096 KB |
Output is correct |
32 |
Correct |
5 ms |
11100 KB |
Output is correct |
33 |
Correct |
6 ms |
11184 KB |
Output is correct |
34 |
Correct |
5 ms |
11100 KB |
Output is correct |
35 |
Correct |
6 ms |
11100 KB |
Output is correct |
36 |
Correct |
1 ms |
10588 KB |
Output is correct |
37 |
Correct |
6 ms |
11100 KB |
Output is correct |
38 |
Correct |
5 ms |
11100 KB |
Output is correct |
39 |
Correct |
5 ms |
11100 KB |
Output is correct |
40 |
Correct |
235 ms |
29828 KB |
Output is correct |
41 |
Correct |
274 ms |
31160 KB |
Output is correct |
42 |
Correct |
262 ms |
31840 KB |
Output is correct |
43 |
Correct |
233 ms |
30480 KB |
Output is correct |
44 |
Correct |
209 ms |
27888 KB |
Output is correct |
45 |
Correct |
324 ms |
30856 KB |
Output is correct |
46 |
Correct |
313 ms |
30900 KB |
Output is correct |
47 |
Correct |
305 ms |
30804 KB |
Output is correct |
48 |
Correct |
320 ms |
31580 KB |
Output is correct |
49 |
Correct |
305 ms |
30668 KB |
Output is correct |
50 |
Correct |
380 ms |
38772 KB |
Output is correct |
51 |
Correct |
337 ms |
38828 KB |
Output is correct |
52 |
Correct |
351 ms |
37952 KB |
Output is correct |
53 |
Correct |
331 ms |
31164 KB |
Output is correct |
54 |
Correct |
347 ms |
30960 KB |
Output is correct |
55 |
Correct |
350 ms |
30896 KB |
Output is correct |
56 |
Correct |
310 ms |
34152 KB |
Output is correct |
57 |
Correct |
291 ms |
33468 KB |
Output is correct |
58 |
Correct |
301 ms |
33396 KB |
Output is correct |
59 |
Correct |
294 ms |
33408 KB |
Output is correct |
60 |
Correct |
275 ms |
31936 KB |
Output is correct |
61 |
Correct |
272 ms |
32696 KB |
Output is correct |
62 |
Correct |
267 ms |
32356 KB |
Output is correct |
63 |
Correct |
184 ms |
33464 KB |
Output is correct |
64 |
Correct |
175 ms |
33784 KB |
Output is correct |
65 |
Correct |
220 ms |
33068 KB |
Output is correct |
66 |
Correct |
241 ms |
32704 KB |
Output is correct |
67 |
Correct |
1 ms |
10584 KB |
Output is correct |
68 |
Correct |
6 ms |
11096 KB |
Output is correct |
69 |
Correct |
6 ms |
11100 KB |
Output is correct |
70 |
Correct |
5 ms |
11100 KB |
Output is correct |
71 |
Correct |
218 ms |
36140 KB |
Output is correct |
72 |
Correct |
214 ms |
37824 KB |
Output is correct |
73 |
Correct |
275 ms |
33728 KB |
Output is correct |
74 |
Correct |
319 ms |
38904 KB |
Output is correct |
75 |
Correct |
333 ms |
38860 KB |
Output is correct |
76 |
Correct |
330 ms |
38864 KB |
Output is correct |
77 |
Correct |
274 ms |
38892 KB |
Output is correct |
78 |
Correct |
282 ms |
39848 KB |
Output is correct |
79 |
Correct |
275 ms |
38740 KB |
Output is correct |
80 |
Correct |
218 ms |
38904 KB |
Output is correct |
81 |
Correct |
193 ms |
38588 KB |
Output is correct |
82 |
Correct |
242 ms |
39196 KB |
Output is correct |
83 |
Correct |
246 ms |
38900 KB |
Output is correct |
84 |
Correct |
240 ms |
28680 KB |
Output is correct |
85 |
Correct |
239 ms |
27840 KB |
Output is correct |
86 |
Correct |
216 ms |
28356 KB |
Output is correct |
87 |
Correct |
328 ms |
30800 KB |
Output is correct |
88 |
Correct |
320 ms |
30688 KB |
Output is correct |
89 |
Correct |
331 ms |
30644 KB |
Output is correct |
90 |
Correct |
337 ms |
31024 KB |
Output is correct |
91 |
Correct |
349 ms |
30768 KB |
Output is correct |
92 |
Correct |
373 ms |
35900 KB |
Output is correct |
93 |
Correct |
360 ms |
37620 KB |
Output is correct |
94 |
Correct |
368 ms |
31296 KB |
Output is correct |
95 |
Correct |
357 ms |
31092 KB |
Output is correct |
96 |
Correct |
369 ms |
30916 KB |
Output is correct |
97 |
Correct |
347 ms |
30912 KB |
Output is correct |
98 |
Correct |
319 ms |
33364 KB |
Output is correct |
99 |
Correct |
305 ms |
33220 KB |
Output is correct |
100 |
Correct |
310 ms |
33028 KB |
Output is correct |
101 |
Correct |
311 ms |
33408 KB |
Output is correct |
102 |
Correct |
332 ms |
31452 KB |
Output is correct |
103 |
Correct |
301 ms |
31656 KB |
Output is correct |
104 |
Correct |
297 ms |
32196 KB |
Output is correct |
105 |
Correct |
216 ms |
31676 KB |
Output is correct |
106 |
Correct |
187 ms |
32188 KB |
Output is correct |
107 |
Correct |
234 ms |
31932 KB |
Output is correct |
108 |
Correct |
234 ms |
32188 KB |
Output is correct |