oj.uz

Submission #891118

# Submission time Handle Problem Language Result Execution time Memory
891118 2023-12-22T08:02:15 Z Cyber_Wolf Two Currencies (JOI23_currencies) C++17
100 / 100
 657 ms 63556 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
 
using namespace std;
 
#define lg long long
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define mid (lr+hr)/2
 
const lg N = 1e5+5;
 
vector<lg> adj[N], o[N];
vector<array<lg, 2>> updates(N);
lg euler[N], depth[N], anc[N][20], in[N], out[N], tmp, bit1[N], bit2[N], edges[N][2], que[N][5], low[N], high[N], best[N], ans[N];
lg n, m, q;

/*
BIT: sum, cnt
queries: st, en, gold, silver
*/
 
void dfs(lg src)
{
	in[src] = ++tmp;
	euler[in[src]] = src;
	for(auto it : adj[src])
	{
		if(anc[src][0] == it)	continue;
		anc[it][0] = src;
		for(int i = 1; i < 20; i++)
		{
			if(anc[it][i-1] == -1)	break;
			anc[it][i] = anc[anc[it][i-1]][i-1];
		}
		depth[it] = depth[src]+1;
		dfs(it);
	}
	out[src] = tmp;
}
 
lg lca(lg a, lg b)
{
	if(depth[a] > depth[b])	swap(a, b);
	for(int i = 19; i+1; i--)
	{
		if(anc[b][i] == -1 || depth[anc[b][i]] < depth[a])	continue;
		b = anc[b][i];
	}
	if(a == b)	return a;
	for(int i = 19; i+1; i--)
	{
		if(anc[a][i] == -1 || anc[a][i] == anc[b][i])	continue;
		a = anc[a][i];
		b = anc[b][i];
	}
	return anc[a][0];
}
 
void update(lg idx, lg val)
{
	for(; idx <= n; idx += (idx&(-idx)))	
	{
		bit1[idx] += val;
		bit2[idx] += (val < 0 ? -1 : 1);
	}
	return;
}
 
lg get(lg idx, lg t)
{
	lg a = 0;
	for(; idx; idx -= (idx&(-idx)))	a += (t ? bit1[idx] : bit2[idx]);
	return a;
}
 
int main()
{
	fastio;
	cin >> n >> m >> q;
	for(int i = 1; i < n; i++)
	{
		lg u, v;
		cin >> u >> v;
		adj[u].push_back(v);
		adj[v].push_back(u);
		edges[i][0] = u;
		edges[i][1] = v;
	}
	memset(anc, -1, sizeof(anc));
	dfs(1);
	for(int i = 1; i < n; i++)
	{
		if(depth[edges[i][0]] > depth[edges[i][1]])	swap(edges[i][0], edges[i][1]);
	}
	for(int i = 1; i <= m; i++)
	{
		lg a, b;
		cin >> a >> b;
		updates[i][0] = b;
		updates[i][1] = a;
	}
	sort(updates.begin()+1, updates.begin()+m+1);
	for(int i = 0; i < q; i++)
	{
		for(int j = 0; j < 4; j++)	cin >> que[i][j];
		que[i][4] = lca(que[i][0], que[i][1]);
		low[i] = 0, high[i] = m;
	}
	bool changed = true;
	while(changed)
	{
		changed = false;
		for(int i = 1; i <= n; i++)	bit1[i] = bit2[i] = 0;
		for(int i = 0; i < q; i++)
		{
			if(low[i] <= high[i])	o[(low[i]+high[i]) >> 1].push_back(i);
		}
		for(int i = 0; i <= m; i++)
		{
			if(i)
			{
				update(in[edges[updates[i][1]][1]], updates[i][0]);
				update(out[edges[updates[i][1]][1]]+1, -updates[i][0]);
			}
			while(o[i].size())
			{
				changed = true;
				lg idx = o[i].back();
				o[i].pop_back();
				lg x = get(in[que[idx][0]], 1)+get(in[que[idx][1]], 1)-2*get(in[que[idx][4]], 1);
				if(x <= que[idx][3])
				{
					low[idx] = i+1;
					best[idx] = i;
				}
				else{
					high[idx] = i-1;
				}
			}
		}
	}
	for(int i = 1; i <= n; i++)	bit1[i] = bit2[i] = 0;
	for(int i = 0; i < q; i++)	o[best[i]].push_back(i);
	for(int i = 1; i <= m; i++)
	{
		update(in[edges[updates[i][1]][1]], updates[i][0]);
		update(out[edges[updates[i][1]][1]]+1, -updates[i][0]);
		while(o[i].size())
		{
			lg idx = o[i].back();
			o[i].pop_back();
			lg x = get(in[que[idx][0]], 0)+get(in[que[idx][1]], 0)-2*get(in[que[idx][4]], 0);
			ans[idx] = -x;
		}
	}
	for(int i = 0; i < q; i++)
	{
		lg x = get(in[que[i][0]], 0)+get(in[que[i][1]], 0)-2*get(in[que[i][4]], 0);
		ans[i] += x;
	}
	for(int i = 0; i < q; i++)
	{
		if(ans[i] > que[i][2])	cout << "-1\n";
		else	cout << que[i][2]-ans[i] << '\n';
	}
	
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31324 KB Output is correct
2 Correct 5 ms 31324 KB Output is correct
3 Correct 5 ms 31324 KB Output is correct
4 Correct 5 ms 31324 KB Output is correct
5 Correct 8 ms 31580 KB Output is correct
6 Correct 9 ms 31832 KB Output is correct
7 Correct 8 ms 31580 KB Output is correct
8 Correct 11 ms 31580 KB Output is correct
9 Correct 9 ms 31580 KB Output is correct
10 Correct 9 ms 31836 KB Output is correct
11 Correct 10 ms 31836 KB Output is correct
12 Correct 10 ms 31832 KB Output is correct
13 Correct 10 ms 31836 KB Output is correct
14 Correct 9 ms 31840 KB Output is correct
15 Correct 9 ms 31836 KB Output is correct
16 Correct 10 ms 31784 KB Output is correct
17 Correct 9 ms 31832 KB Output is correct
18 Correct 10 ms 31836 KB Output is correct
19 Correct 8 ms 31836 KB Output is correct
20 Correct 8 ms 31836 KB Output is correct
21 Correct 9 ms 31752 KB Output is correct
22 Correct 8 ms 31836 KB Output is correct
23 Correct 9 ms 31732 KB Output is correct
24 Correct 9 ms 31628 KB Output is correct
25 Correct 9 ms 31836 KB Output is correct
26 Correct 8 ms 31596 KB Output is correct
27 Correct 8 ms 31580 KB Output is correct
28 Correct 8 ms 31836 KB Output is correct
29 Correct 8 ms 31580 KB Output is correct
30 Correct 9 ms 31836 KB Output is correct
31 Correct 10 ms 31836 KB Output is correct
32 Correct 9 ms 31580 KB Output is correct
33 Correct 10 ms 31836 KB Output is correct
34 Correct 9 ms 31892 KB Output is correct
35 Correct 9 ms 31836 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31324 KB Output is correct
2 Correct 9 ms 31836 KB Output is correct
3 Correct 10 ms 31836 KB Output is correct
4 Correct 9 ms 31836 KB Output is correct
5 Correct 285 ms 50096 KB Output is correct
6 Correct 292 ms 54464 KB Output is correct
7 Correct 324 ms 54276 KB Output is correct
8 Correct 233 ms 50116 KB Output is correct
9 Correct 226 ms 49616 KB Output is correct
10 Correct 410 ms 57708 KB Output is correct
11 Correct 407 ms 57524 KB Output is correct
12 Correct 365 ms 57288 KB Output is correct
13 Correct 435 ms 57640 KB Output is correct
14 Correct 422 ms 57216 KB Output is correct
15 Correct 506 ms 62924 KB Output is correct
16 Correct 476 ms 63432 KB Output is correct
17 Correct 488 ms 62580 KB Output is correct
18 Correct 426 ms 57376 KB Output is correct
19 Correct 441 ms 57296 KB Output is correct
20 Correct 476 ms 57492 KB Output is correct
21 Correct 324 ms 58696 KB Output is correct
22 Correct 311 ms 58712 KB Output is correct
23 Correct 346 ms 58696 KB Output is correct
24 Correct 340 ms 58488 KB Output is correct
25 Correct 313 ms 56824 KB Output is correct
26 Correct 333 ms 56768 KB Output is correct
27 Correct 312 ms 57032 KB Output is correct
28 Correct 262 ms 56364 KB Output is correct
29 Correct 304 ms 54984 KB Output is correct
30 Correct 274 ms 54976 KB Output is correct
31 Correct 295 ms 54980 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31324 KB Output is correct
2 Correct 10 ms 31836 KB Output is correct
3 Correct 9 ms 31804 KB Output is correct
4 Correct 8 ms 31888 KB Output is correct
5 Correct 315 ms 56272 KB Output is correct
6 Correct 274 ms 55876 KB Output is correct
7 Correct 394 ms 54728 KB Output is correct
8 Correct 615 ms 63556 KB Output is correct
9 Correct 657 ms 63320 KB Output is correct
10 Correct 611 ms 63476 KB Output is correct
11 Correct 525 ms 63368 KB Output is correct
12 Correct 513 ms 63356 KB Output is correct
13 Correct 484 ms 63396 KB Output is correct
14 Correct 484 ms 63200 KB Output is correct
15 Correct 365 ms 63188 KB Output is correct
16 Correct 459 ms 63272 KB Output is correct
17 Correct 468 ms 63332 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 31324 KB Output is correct
2 Correct 5 ms 31324 KB Output is correct
3 Correct 5 ms 31324 KB Output is correct
4 Correct 5 ms 31324 KB Output is correct
5 Correct 8 ms 31580 KB Output is correct
6 Correct 9 ms 31832 KB Output is correct
7 Correct 8 ms 31580 KB Output is correct
8 Correct 11 ms 31580 KB Output is correct
9 Correct 9 ms 31580 KB Output is correct
10 Correct 9 ms 31836 KB Output is correct
11 Correct 10 ms 31836 KB Output is correct
12 Correct 10 ms 31832 KB Output is correct
13 Correct 10 ms 31836 KB Output is correct
14 Correct 9 ms 31840 KB Output is correct
15 Correct 9 ms 31836 KB Output is correct
16 Correct 10 ms 31784 KB Output is correct
17 Correct 9 ms 31832 KB Output is correct
18 Correct 10 ms 31836 KB Output is correct
19 Correct 8 ms 31836 KB Output is correct
20 Correct 8 ms 31836 KB Output is correct
21 Correct 9 ms 31752 KB Output is correct
22 Correct 8 ms 31836 KB Output is correct
23 Correct 9 ms 31732 KB Output is correct
24 Correct 9 ms 31628 KB Output is correct
25 Correct 9 ms 31836 KB Output is correct
26 Correct 8 ms 31596 KB Output is correct
27 Correct 8 ms 31580 KB Output is correct
28 Correct 8 ms 31836 KB Output is correct
29 Correct 8 ms 31580 KB Output is correct
30 Correct 9 ms 31836 KB Output is correct
31 Correct 10 ms 31836 KB Output is correct
32 Correct 9 ms 31580 KB Output is correct
33 Correct 10 ms 31836 KB Output is correct
34 Correct 9 ms 31892 KB Output is correct
35 Correct 9 ms 31836 KB Output is correct
36 Correct 5 ms 31324 KB Output is correct
37 Correct 9 ms 31836 KB Output is correct
38 Correct 10 ms 31836 KB Output is correct
39 Correct 9 ms 31836 KB Output is correct
40 Correct 285 ms 50096 KB Output is correct
41 Correct 292 ms 54464 KB Output is correct
42 Correct 324 ms 54276 KB Output is correct
43 Correct 233 ms 50116 KB Output is correct
44 Correct 226 ms 49616 KB Output is correct
45 Correct 410 ms 57708 KB Output is correct
46 Correct 407 ms 57524 KB Output is correct
47 Correct 365 ms 57288 KB Output is correct
48 Correct 435 ms 57640 KB Output is correct
49 Correct 422 ms 57216 KB Output is correct
50 Correct 506 ms 62924 KB Output is correct
51 Correct 476 ms 63432 KB Output is correct
52 Correct 488 ms 62580 KB Output is correct
53 Correct 426 ms 57376 KB Output is correct
54 Correct 441 ms 57296 KB Output is correct
55 Correct 476 ms 57492 KB Output is correct
56 Correct 324 ms 58696 KB Output is correct
57 Correct 311 ms 58712 KB Output is correct
58 Correct 346 ms 58696 KB Output is correct
59 Correct 340 ms 58488 KB Output is correct
60 Correct 313 ms 56824 KB Output is correct
61 Correct 333 ms 56768 KB Output is correct
62 Correct 312 ms 57032 KB Output is correct
63 Correct 262 ms 56364 KB Output is correct
64 Correct 304 ms 54984 KB Output is correct
65 Correct 274 ms 54976 KB Output is correct
66 Correct 295 ms 54980 KB Output is correct
67 Correct 5 ms 31324 KB Output is correct
68 Correct 10 ms 31836 KB Output is correct
69 Correct 9 ms 31804 KB Output is correct
70 Correct 8 ms 31888 KB Output is correct
71 Correct 315 ms 56272 KB Output is correct
72 Correct 274 ms 55876 KB Output is correct
73 Correct 394 ms 54728 KB Output is correct
74 Correct 615 ms 63556 KB Output is correct
75 Correct 657 ms 63320 KB Output is correct
76 Correct 611 ms 63476 KB Output is correct
77 Correct 525 ms 63368 KB Output is correct
78 Correct 513 ms 63356 KB Output is correct
79 Correct 484 ms 63396 KB Output is correct
80 Correct 484 ms 63200 KB Output is correct
81 Correct 365 ms 63188 KB Output is correct
82 Correct 459 ms 63272 KB Output is correct
83 Correct 468 ms 63332 KB Output is correct
84 Correct 391 ms 49788 KB Output is correct
85 Correct 331 ms 49912 KB Output is correct
86 Correct 287 ms 49596 KB Output is correct
87 Correct 458 ms 57628 KB Output is correct
88 Correct 417 ms 57420 KB Output is correct
89 Correct 466 ms 57512 KB Output is correct
90 Correct 443 ms 57780 KB Output is correct
91 Correct 494 ms 57556 KB Output is correct
92 Correct 562 ms 61124 KB Output is correct
93 Correct 555 ms 62260 KB Output is correct
94 Correct 465 ms 57324 KB Output is correct
95 Correct 488 ms 57264 KB Output is correct
96 Correct 458 ms 57040 KB Output is correct
97 Correct 546 ms 57344 KB Output is correct
98 Correct 502 ms 58172 KB Output is correct
99 Correct 445 ms 57988 KB Output is correct
100 Correct 401 ms 58488 KB Output is correct
101 Correct 387 ms 58440 KB Output is correct
102 Correct 383 ms 57908 KB Output is correct
103 Correct 424 ms 57916 KB Output is correct
104 Correct 365 ms 57928 KB Output is correct
105 Correct 313 ms 54604 KB Output is correct
106 Correct 309 ms 56264 KB Output is correct
107 Correct 371 ms 54624 KB Output is correct
108 Correct 307 ms 54556 KB Output is correct