oj.uz

Submission #972495

# Submission time Handle Problem Language Result Execution time Memory
972495 2024-04-30T13:52:38 Z yellowtoad Two Currencies (JOI23_currencies) C++17
100 / 100
 1421 ms 57432 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#define f first
#define s second
#define int long long
using namespace std;

int n, m, q, p[100010][20], cnt, d[100010], ans[100010], vl[100010];
vector<int> edge[100010];
pair<pair<pair<int,int>,int>,pair<int,int>> qry[100010];
pair<int,int> edd[100010], ed[100010], rng[100010], node[400010], idk[100010];

void dfs(int u, int v, int depth) {
	p[u][0] = v;
	d[u] = depth;
	rng[u].f = ++cnt;
	for (int i = 1; i < 20; i++) p[u][i] = p[p[u][i-1]][i-1];
	for (int i = 0; i < edge[u].size(); i++) if (edge[u][i] != v) dfs(edge[u][i],u,depth+1);
	rng[u].s = cnt;
}

int lca(int u, int v) {
	if (d[u] < d[v]) swap(u,v);
	int i = 19;
	while (i >= 0) {
		if (d[p[u][i]] >= d[v]) u = p[u][i];
		i--;
	}
	if (u == v) return u;
	i = 19;
	while (i >= 0) {
		if (p[u][i] != p[v][i]) u = p[u][i], v = p[v][i];
		i--;
	}
	return p[u][0];
}

void split(int id) {
	node[id*2].f += node[id].f;
	node[id*2+1].f += node[id].f;
	node[id*2].s += node[id].s;
	node[id*2+1].s += node[id].s;
	node[id] = {0,0};
}

void update(int id, int x, int y, int l, int r, pair<int,int> val) {
	if ((l <= x) && (y <= r)) {
		node[id].f += val.f;
		node[id].s += val.s;
		return;
	}
	if ((r < x) || (y < l)) return;
	int mid = (x+y)/2;
	split(id);
	update(id*2,x,mid,l,r,val);
	update(id*2+1,mid+1,y,l,r,val);
}

pair<int,int> summ(int id, int x, int y, int pos) {
	if (x == y) return node[id];
	int mid = (x+y)/2;
	split(id);
	if (pos <= mid) return summ(id*2,x,mid,pos);
	else return summ(id*2+1,mid+1,y,pos);
}

pair<int,int> sum(int u) {
	return summ(1,1,n,rng[u].f);
}

void solve(int l, int r, vector<int> query) {
	vector<int> ll, rr;
	if (l == r) {
		for (int i = 0; i < query.size(); i++) {
			int u = qry[query[i]].f.f.f, v = qry[query[i]].f.f.s, lcaa = qry[query[i]].f.s;
			if (qry[query[i]].s.s < sum(u).f+sum(v).f-2*sum(lcaa).f) ll.push_back(query[i]);
			else ans[query[i]] = sum(u).s+sum(v).s-2*sum(lcaa).s;
		}
		for (int i = l; i <= r; i++) update(1,1,n,rng[ed[i].s].f,rng[ed[i].s].s,{-vl[i],1});
		for (int i = 0; i < ll.size(); i++) {
			int u = qry[ll[i]].f.f.f, v = qry[ll[i]].f.f.s, lcaa = qry[ll[i]].f.s;
			ans[ll[i]] = sum(u).s+sum(v).s-2*sum(lcaa).s;
		}
		for (int i = l; i <= r; i++) update(1,1,n,rng[ed[i].s].f,rng[ed[i].s].s,{vl[i],-1});
		return;
	}
	int mid = (l+r)/2;
	for (int i = mid+1; i <= r; i++) update(1,1,n,rng[ed[i].s].f,rng[ed[i].s].s,{-vl[i],1});
	for (int i = 0; i < query.size(); i++) {
		int u = qry[query[i]].f.f.f, v = qry[query[i]].f.f.s, lcaa = qry[query[i]].f.s;
		if (qry[query[i]].s.s < sum(u).f+sum(v).f-2*sum(lcaa).f) ll.push_back(query[i]);
		else rr.push_back(query[i]);
	}
	solve(l,mid,ll);
	for (int i = mid+1; i <= r; i++) update(1,1,n,rng[ed[i].s].f,rng[ed[i].s].s,{vl[i],-1});
	solve(mid+1,r,rr);
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n >> m >> q;
	for (int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		edd[i] = {u,v};
		edge[u].push_back(v);
		edge[v].push_back(u);
	}
	dfs(1,0,1);
	for (int i = 1; i <= m; i++) cin >> idk[i].s >> idk[i].f;
	sort(idk+1,idk+m+1);
	for (int i = 1; i <= m; i++) {
		int u = idk[i].s, v = idk[i].f;
		ed[i] = edd[u];
		vl[i] = v;
		if (d[ed[i].s] < d[ed[i].f]) swap(ed[i].f,ed[i].s);
		update(1,1,n,rng[ed[i].s].f,rng[ed[i].s].s,{vl[i],0});
	}
	for (int i = 1; i <= q; i++) {
		cin >> qry[i].f.f.f >> qry[i].f.f.s >> qry[i].s.f >> qry[i].s.s;
		qry[i].f.s = lca(qry[i].f.f.f,qry[i].f.f.s);
	}
	vector<int> query;
	for (int i = 1; i <= q; i++) query.push_back(i);
	solve(1,m,query);
	for (int i = 1; i <= q; i++) cout << max(-1LL,qry[i].s.f-ans[i]) << endl;
}

Compilation message

currencies.cpp: In function 'void dfs(long long int, long long int, long long int)':
currencies.cpp:19:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for (int i = 0; i < edge[u].size(); i++) if (edge[u][i] != v) dfs(edge[u][i],u,depth+1);
      |                  ~~^~~~~~~~~~~~~~~~
currencies.cpp: In function 'void solve(long long int, long long int, std::vector<long long int>)':
currencies.cpp:75:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   for (int i = 0; i < query.size(); i++) {
      |                   ~~^~~~~~~~~~~~~~
currencies.cpp:81:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |   for (int i = 0; i < ll.size(); i++) {
      |                   ~~^~~~~~~~~~~
currencies.cpp:90:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |  for (int i = 0; i < query.size(); i++) {
      |                  ~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 3 ms 14680 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 12 ms 15452 KB Output is correct
6 Correct 17 ms 15452 KB Output is correct
7 Correct 12 ms 15420 KB Output is correct
8 Correct 15 ms 15452 KB Output is correct
9 Correct 15 ms 15452 KB Output is correct
10 Correct 14 ms 15340 KB Output is correct
11 Correct 16 ms 15448 KB Output is correct
12 Correct 15 ms 15452 KB Output is correct
13 Correct 15 ms 15540 KB Output is correct
14 Correct 17 ms 15592 KB Output is correct
15 Correct 16 ms 15448 KB Output is correct
16 Correct 16 ms 15448 KB Output is correct
17 Correct 16 ms 15452 KB Output is correct
18 Correct 20 ms 15324 KB Output is correct
19 Correct 14 ms 15452 KB Output is correct
20 Correct 14 ms 15564 KB Output is correct
21 Correct 14 ms 15452 KB Output is correct
22 Correct 14 ms 15452 KB Output is correct
23 Correct 14 ms 15508 KB Output is correct
24 Correct 13 ms 15452 KB Output is correct
25 Correct 14 ms 15708 KB Output is correct
26 Correct 12 ms 15452 KB Output is correct
27 Correct 14 ms 15416 KB Output is correct
28 Correct 12 ms 15452 KB Output is correct
29 Correct 12 ms 15708 KB Output is correct
30 Correct 14 ms 15704 KB Output is correct
31 Correct 14 ms 15452 KB Output is correct
32 Correct 14 ms 15452 KB Output is correct
33 Correct 15 ms 15640 KB Output is correct
34 Correct 15 ms 15452 KB Output is correct
35 Correct 15 ms 15452 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 14 ms 15452 KB Output is correct
3 Correct 15 ms 15452 KB Output is correct
4 Correct 14 ms 15452 KB Output is correct
5 Correct 853 ms 53496 KB Output is correct
6 Correct 989 ms 53268 KB Output is correct
7 Correct 924 ms 54904 KB Output is correct
8 Correct 724 ms 50880 KB Output is correct
9 Correct 762 ms 50408 KB Output is correct
10 Correct 1126 ms 51124 KB Output is correct
11 Correct 1147 ms 51512 KB Output is correct
12 Correct 1231 ms 51908 KB Output is correct
13 Correct 1201 ms 52112 KB Output is correct
14 Correct 1215 ms 51144 KB Output is correct
15 Correct 1367 ms 56008 KB Output is correct
16 Correct 1409 ms 56848 KB Output is correct
17 Correct 1240 ms 55756 KB Output is correct
18 Correct 1303 ms 50140 KB Output is correct
19 Correct 1303 ms 50420 KB Output is correct
20 Correct 1266 ms 50752 KB Output is correct
21 Correct 1053 ms 56880 KB Output is correct
22 Correct 1014 ms 57240 KB Output is correct
23 Correct 1028 ms 57164 KB Output is correct
24 Correct 1060 ms 56980 KB Output is correct
25 Correct 970 ms 53604 KB Output is correct
26 Correct 949 ms 53724 KB Output is correct
27 Correct 962 ms 53924 KB Output is correct
28 Correct 849 ms 54048 KB Output is correct
29 Correct 849 ms 55300 KB Output is correct
30 Correct 910 ms 53756 KB Output is correct
31 Correct 865 ms 54452 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 14684 KB Output is correct
2 Correct 14 ms 15632 KB Output is correct
3 Correct 15 ms 15452 KB Output is correct
4 Correct 15 ms 15452 KB Output is correct
5 Correct 784 ms 57432 KB Output is correct
6 Correct 755 ms 56840 KB Output is correct
7 Correct 977 ms 49728 KB Output is correct
8 Correct 1186 ms 56808 KB Output is correct
9 Correct 1196 ms 56424 KB Output is correct
10 Correct 1228 ms 57064 KB Output is correct
11 Correct 985 ms 56516 KB Output is correct
12 Correct 1004 ms 56488 KB Output is correct
13 Correct 985 ms 56560 KB Output is correct
14 Correct 910 ms 56668 KB Output is correct
15 Correct 828 ms 56512 KB Output is correct
16 Correct 898 ms 56772 KB Output is correct
17 Correct 891 ms 56512 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 3 ms 14680 KB Output is correct
4 Correct 2 ms 14684 KB Output is correct
5 Correct 12 ms 15452 KB Output is correct
6 Correct 17 ms 15452 KB Output is correct
7 Correct 12 ms 15420 KB Output is correct
8 Correct 15 ms 15452 KB Output is correct
9 Correct 15 ms 15452 KB Output is correct
10 Correct 14 ms 15340 KB Output is correct
11 Correct 16 ms 15448 KB Output is correct
12 Correct 15 ms 15452 KB Output is correct
13 Correct 15 ms 15540 KB Output is correct
14 Correct 17 ms 15592 KB Output is correct
15 Correct 16 ms 15448 KB Output is correct
16 Correct 16 ms 15448 KB Output is correct
17 Correct 16 ms 15452 KB Output is correct
18 Correct 20 ms 15324 KB Output is correct
19 Correct 14 ms 15452 KB Output is correct
20 Correct 14 ms 15564 KB Output is correct
21 Correct 14 ms 15452 KB Output is correct
22 Correct 14 ms 15452 KB Output is correct
23 Correct 14 ms 15508 KB Output is correct
24 Correct 13 ms 15452 KB Output is correct
25 Correct 14 ms 15708 KB Output is correct
26 Correct 12 ms 15452 KB Output is correct
27 Correct 14 ms 15416 KB Output is correct
28 Correct 12 ms 15452 KB Output is correct
29 Correct 12 ms 15708 KB Output is correct
30 Correct 14 ms 15704 KB Output is correct
31 Correct 14 ms 15452 KB Output is correct
32 Correct 14 ms 15452 KB Output is correct
33 Correct 15 ms 15640 KB Output is correct
34 Correct 15 ms 15452 KB Output is correct
35 Correct 15 ms 15452 KB Output is correct
36 Correct 2 ms 14680 KB Output is correct
37 Correct 14 ms 15452 KB Output is correct
38 Correct 15 ms 15452 KB Output is correct
39 Correct 14 ms 15452 KB Output is correct
40 Correct 853 ms 53496 KB Output is correct
41 Correct 989 ms 53268 KB Output is correct
42 Correct 924 ms 54904 KB Output is correct
43 Correct 724 ms 50880 KB Output is correct
44 Correct 762 ms 50408 KB Output is correct
45 Correct 1126 ms 51124 KB Output is correct
46 Correct 1147 ms 51512 KB Output is correct
47 Correct 1231 ms 51908 KB Output is correct
48 Correct 1201 ms 52112 KB Output is correct
49 Correct 1215 ms 51144 KB Output is correct
50 Correct 1367 ms 56008 KB Output is correct
51 Correct 1409 ms 56848 KB Output is correct
52 Correct 1240 ms 55756 KB Output is correct
53 Correct 1303 ms 50140 KB Output is correct
54 Correct 1303 ms 50420 KB Output is correct
55 Correct 1266 ms 50752 KB Output is correct
56 Correct 1053 ms 56880 KB Output is correct
57 Correct 1014 ms 57240 KB Output is correct
58 Correct 1028 ms 57164 KB Output is correct
59 Correct 1060 ms 56980 KB Output is correct
60 Correct 970 ms 53604 KB Output is correct
61 Correct 949 ms 53724 KB Output is correct
62 Correct 962 ms 53924 KB Output is correct
63 Correct 849 ms 54048 KB Output is correct
64 Correct 849 ms 55300 KB Output is correct
65 Correct 910 ms 53756 KB Output is correct
66 Correct 865 ms 54452 KB Output is correct
67 Correct 2 ms 14684 KB Output is correct
68 Correct 14 ms 15632 KB Output is correct
69 Correct 15 ms 15452 KB Output is correct
70 Correct 15 ms 15452 KB Output is correct
71 Correct 784 ms 57432 KB Output is correct
72 Correct 755 ms 56840 KB Output is correct
73 Correct 977 ms 49728 KB Output is correct
74 Correct 1186 ms 56808 KB Output is correct
75 Correct 1196 ms 56424 KB Output is correct
76 Correct 1228 ms 57064 KB Output is correct
77 Correct 985 ms 56516 KB Output is correct
78 Correct 1004 ms 56488 KB Output is correct
79 Correct 985 ms 56560 KB Output is correct
80 Correct 910 ms 56668 KB Output is correct
81 Correct 828 ms 56512 KB Output is correct
82 Correct 898 ms 56772 KB Output is correct
83 Correct 891 ms 56512 KB Output is correct
84 Correct 874 ms 50896 KB Output is correct
85 Correct 864 ms 44628 KB Output is correct
86 Correct 751 ms 44444 KB Output is correct
87 Correct 1184 ms 51324 KB Output is correct
88 Correct 1222 ms 51372 KB Output is correct
89 Correct 1216 ms 51396 KB Output is correct
90 Correct 1218 ms 51256 KB Output is correct
91 Correct 1176 ms 51376 KB Output is correct
92 Correct 1381 ms 54508 KB Output is correct
93 Correct 1287 ms 55568 KB Output is correct
94 Correct 1361 ms 50300 KB Output is correct
95 Correct 1360 ms 50384 KB Output is correct
96 Correct 1367 ms 50292 KB Output is correct
97 Correct 1421 ms 50288 KB Output is correct
98 Correct 1228 ms 57216 KB Output is correct
99 Correct 1160 ms 57068 KB Output is correct
100 Correct 1155 ms 57088 KB Output is correct
101 Correct 1150 ms 56900 KB Output is correct
102 Correct 1095 ms 51964 KB Output is correct
103 Correct 982 ms 52552 KB Output is correct
104 Correct 980 ms 52420 KB Output is correct
105 Correct 889 ms 52824 KB Output is correct
106 Correct 882 ms 53044 KB Output is correct
107 Correct 938 ms 53464 KB Output is correct
108 Correct 943 ms 52704 KB Output is correct