oj.uz

Submission #838073

# Submission time Handle Problem Language Result Execution time Memory
838073 2023-08-26T07:47:15 Z fatemetmhr Two Currencies (JOI23_currencies) C++17
100 / 100
 926 ms 47480 KB 
// na hanooz omidi vjood dare... hanooz ye karayi hast ke bknm :)

#include <bits/stdc++.h>

using namespace std;


#define debug(x) cerr << "(" << (#x) << "): " << (x) << endl;
#define all(x)   (x).begin(), (x).end()
#define fi       first
#define se       second
#define mp       make_pair
#define pb       push_back

typedef long long ll;

const int maxn5 = 1e5 + 10;
const int lg    = 20;

int ti = 3, st[maxn5], ft[maxn5], h[maxn5];
int hcnt[maxn5], cnt[maxn5], s[maxn5], t[maxn5];
int par[lg][maxn5], a[maxn5], b[maxn5], c[maxn5];
int lo[maxn5], hi[maxn5];
ll x[maxn5], y[maxn5], mx[maxn5];
pair <int, int> p[maxn5];
vector <int> req[maxn5];
vector <pair<int, int>> adj[maxn5];


pair <ll, int> operator +(pair <ll, int> a, pair <ll, int> b){
	return mp(a.fi + b.fi, a.se + b.se);
}

pair <ll, int> operator -(pair <ll, int> a, pair <ll, int> b){
	return mp(a.fi - b.fi, a.se - b.se);
}

pair <ll, int> operator *(int a, pair <ll, int> b){
	return mp(a * b.fi, a * b.se);
}

namespace fen{

	pair <ll, int> fen[maxn5];

	void clear(){
		memset(fen, 0, sizeof fen);
	}

	pair <ll, int> get(int id){
		pair<ll, int> ret = {0, 0};
		for(; id; id -= id & -id)
			ret = ret + fen[id];
		return ret;
	}

	void add(int id, pair <ll, int> val){
		for(; id < maxn5; id += id & -id)
			fen[id] = fen[id] + val;
	}

	void add(int l, int r, ll val){
		//debug("Adding ");
		//debug(l);
		//debug(r);
		//debug(val);
		add(l, mp(val, 1));
		add(r + 1, mp(-val, -1));
	}
}

int lca(int a, int b){
	if(h[a] < h[b])
		swap(a, b);
	int d = h[a] - h[b];
	for(int i = 0; i < lg; i++) if((d >> i)&1)
		a = par[i][a];
	if(a == b)
		return a;
	for(int i = lg - 1; i >= 0; i--) if(par[i][a] != par[i][b]){
		a = par[i][a];
		b = par[i][b];
	}
	return par[0][a];
}

void dfs_lca(int v){
	for(int i = 1; i < lg && par[i - 1][v] != -1; i++)
		par[i][v] = par[i - 1][par[i - 1][v]];
	st[v] = ++ti;
	for(auto [u, id] : adj[v]) if(u != par[0][v]){
		h[u] = h[v] + 1;
		hcnt[u] = hcnt[v] + cnt[id];
		par[0][u] = v;
		dfs_lca(u);
	}
	ft[v] = ti;
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);

	int n, m, q; cin >> n >> m >> q;
	for(int i = 0; i < n - 1; i++){
		cin >> a[i] >> b[i];
		a[i]--; b[i]--;
		adj[a[i]].pb({b[i], i});
		adj[b[i]].pb({a[i], i});
	}



	for(int i = 0; i < m; i++){
		cin >> p[i].se >> p[i].fi;
		p[i].se--;
		cnt[p[i].se]++;
	}
	sort(p, p + m);

	memset(par, -1, sizeof par);
	dfs_lca(0);


	for(int i = 0; i < n - 1; i++)
		if(h[a[i]] > h[b[i]])
			swap(a[i], b[i]);

	memset(lo, -1, sizeof lo);
	fill(hi, hi + q + 4, m);
	for(int i = 0; i < q; i++){
		cin >> s[i] >> t[i] >> x[i] >> y[i];
		s[i]--; t[i]--;
		c[i] = lca(s[i], t[i]);
	}

	bool con = true;
	while(con){
		con = false;
		fen::clear();
		for(int i = 0; i < q; i++) if(hi[i] - lo[i] > 1){
			con = true;
			req[(hi[i] + lo[i]) >> 1].pb(i);
		}
		for(int i = 0; i < m; i++){
			fen::add(st[b[p[i].se]], ft[b[p[i].se]], p[i].fi);
			//debug(b[p[i].se]);
			for(auto id : req[i]){
				//debug(st[s[id]]);
				//debug(st[t[id]]);
				//debug(fen::get(st[s[id]]).se);
				//debug(fen::get(st[t[id]]).se);
				pair <ll, int> val = fen::get(st[s[id]]) + fen::get(st[t[id]]) - (2 * fen::get(st[c[id]]));
				if(val.fi <= y[id]){
					//debug(i);
					//debug(id);
					//debug(val.fi);
					//debug(val.se);
					lo[id] = i;
					mx[id] = val.se;
				}
				else
					hi[id] = i;
			}
			req[i].clear();
		}
	}

	for(int i = 0; i < q; i++){
		//debug(mx[i]);
		cout << max(-1ll, x[i] - (hcnt[s[i]] + hcnt[t[i]] - 2 * hcnt[c[i]] - mx[i])) << '\n';
	}

}

Compilation message

currencies.cpp: In function 'void fen::clear()':
currencies.cpp:47:28: warning: 'void* memset(void*, int, size_t)' clearing an object of type 'struct std::pair<long long int, int>' with no trivial copy-assignment; use assignment instead [-Wclass-memaccess]
   47 |   memset(fen, 0, sizeof fen);
      |                            ^
In file included from /usr/include/c++/10/bits/stl_algobase.h:64,
                 from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from currencies.cpp:3:
/usr/include/c++/10/bits/stl_pair.h:211:12: note: 'struct std::pair<long long int, int>' declared here
  211 |     struct pair
      |            ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14804 KB Output is correct
2 Correct 6 ms 14804 KB Output is correct
3 Correct 6 ms 14804 KB Output is correct
4 Correct 6 ms 14804 KB Output is correct
5 Correct 10 ms 15160 KB Output is correct
6 Correct 10 ms 15316 KB Output is correct
7 Correct 11 ms 15160 KB Output is correct
8 Correct 11 ms 15316 KB Output is correct
9 Correct 11 ms 15316 KB Output is correct
10 Correct 14 ms 15284 KB Output is correct
11 Correct 10 ms 15316 KB Output is correct
12 Correct 14 ms 15316 KB Output is correct
13 Correct 14 ms 15444 KB Output is correct
14 Correct 10 ms 15316 KB Output is correct
15 Correct 11 ms 15316 KB Output is correct
16 Correct 15 ms 15316 KB Output is correct
17 Correct 12 ms 15316 KB Output is correct
18 Correct 11 ms 15268 KB Output is correct
19 Correct 11 ms 15348 KB Output is correct
20 Correct 10 ms 15316 KB Output is correct
21 Correct 11 ms 15316 KB Output is correct
22 Correct 11 ms 15316 KB Output is correct
23 Correct 10 ms 15316 KB Output is correct
24 Correct 10 ms 15292 KB Output is correct
25 Correct 10 ms 15316 KB Output is correct
26 Correct 9 ms 15316 KB Output is correct
27 Correct 9 ms 15248 KB Output is correct
28 Correct 10 ms 15316 KB Output is correct
29 Correct 9 ms 15188 KB Output is correct
30 Correct 11 ms 15316 KB Output is correct
31 Correct 11 ms 15316 KB Output is correct
32 Correct 10 ms 15316 KB Output is correct
33 Correct 10 ms 15444 KB Output is correct
34 Correct 11 ms 15412 KB Output is correct
35 Correct 13 ms 15412 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14804 KB Output is correct
2 Correct 11 ms 15316 KB Output is correct
3 Correct 11 ms 15316 KB Output is correct
4 Correct 11 ms 15316 KB Output is correct
5 Correct 275 ms 34480 KB Output is correct
6 Correct 341 ms 37544 KB Output is correct
7 Correct 303 ms 37192 KB Output is correct
8 Correct 264 ms 33592 KB Output is correct
9 Correct 265 ms 33028 KB Output is correct
10 Correct 390 ms 40796 KB Output is correct
11 Correct 394 ms 40792 KB Output is correct
12 Correct 365 ms 40768 KB Output is correct
13 Correct 393 ms 40772 KB Output is correct
14 Correct 413 ms 40784 KB Output is correct
15 Correct 420 ms 46916 KB Output is correct
16 Correct 425 ms 47308 KB Output is correct
17 Correct 429 ms 46564 KB Output is correct
18 Correct 420 ms 40728 KB Output is correct
19 Correct 423 ms 40700 KB Output is correct
20 Correct 446 ms 40852 KB Output is correct
21 Correct 314 ms 41052 KB Output is correct
22 Correct 452 ms 41252 KB Output is correct
23 Correct 437 ms 41368 KB Output is correct
24 Correct 335 ms 41252 KB Output is correct
25 Correct 350 ms 40836 KB Output is correct
26 Correct 348 ms 40708 KB Output is correct
27 Correct 324 ms 40864 KB Output is correct
28 Correct 279 ms 39252 KB Output is correct
29 Correct 272 ms 38780 KB Output is correct
30 Correct 303 ms 39360 KB Output is correct
31 Correct 300 ms 39156 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14804 KB Output is correct
2 Correct 12 ms 15444 KB Output is correct
3 Correct 12 ms 15412 KB Output is correct
4 Correct 11 ms 15444 KB Output is correct
5 Correct 306 ms 39860 KB Output is correct
6 Correct 287 ms 39528 KB Output is correct
7 Correct 380 ms 38928 KB Output is correct
8 Correct 446 ms 47376 KB Output is correct
9 Correct 461 ms 47392 KB Output is correct
10 Correct 555 ms 47424 KB Output is correct
11 Correct 365 ms 47400 KB Output is correct
12 Correct 359 ms 47480 KB Output is correct
13 Correct 568 ms 47416 KB Output is correct
14 Correct 516 ms 46756 KB Output is correct
15 Correct 288 ms 46412 KB Output is correct
16 Correct 341 ms 47164 KB Output is correct
17 Correct 323 ms 47008 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14804 KB Output is correct
2 Correct 6 ms 14804 KB Output is correct
3 Correct 6 ms 14804 KB Output is correct
4 Correct 6 ms 14804 KB Output is correct
5 Correct 10 ms 15160 KB Output is correct
6 Correct 10 ms 15316 KB Output is correct
7 Correct 11 ms 15160 KB Output is correct
8 Correct 11 ms 15316 KB Output is correct
9 Correct 11 ms 15316 KB Output is correct
10 Correct 14 ms 15284 KB Output is correct
11 Correct 10 ms 15316 KB Output is correct
12 Correct 14 ms 15316 KB Output is correct
13 Correct 14 ms 15444 KB Output is correct
14 Correct 10 ms 15316 KB Output is correct
15 Correct 11 ms 15316 KB Output is correct
16 Correct 15 ms 15316 KB Output is correct
17 Correct 12 ms 15316 KB Output is correct
18 Correct 11 ms 15268 KB Output is correct
19 Correct 11 ms 15348 KB Output is correct
20 Correct 10 ms 15316 KB Output is correct
21 Correct 11 ms 15316 KB Output is correct
22 Correct 11 ms 15316 KB Output is correct
23 Correct 10 ms 15316 KB Output is correct
24 Correct 10 ms 15292 KB Output is correct
25 Correct 10 ms 15316 KB Output is correct
26 Correct 9 ms 15316 KB Output is correct
27 Correct 9 ms 15248 KB Output is correct
28 Correct 10 ms 15316 KB Output is correct
29 Correct 9 ms 15188 KB Output is correct
30 Correct 11 ms 15316 KB Output is correct
31 Correct 11 ms 15316 KB Output is correct
32 Correct 10 ms 15316 KB Output is correct
33 Correct 10 ms 15444 KB Output is correct
34 Correct 11 ms 15412 KB Output is correct
35 Correct 13 ms 15412 KB Output is correct
36 Correct 6 ms 14804 KB Output is correct
37 Correct 11 ms 15316 KB Output is correct
38 Correct 11 ms 15316 KB Output is correct
39 Correct 11 ms 15316 KB Output is correct
40 Correct 275 ms 34480 KB Output is correct
41 Correct 341 ms 37544 KB Output is correct
42 Correct 303 ms 37192 KB Output is correct
43 Correct 264 ms 33592 KB Output is correct
44 Correct 265 ms 33028 KB Output is correct
45 Correct 390 ms 40796 KB Output is correct
46 Correct 394 ms 40792 KB Output is correct
47 Correct 365 ms 40768 KB Output is correct
48 Correct 393 ms 40772 KB Output is correct
49 Correct 413 ms 40784 KB Output is correct
50 Correct 420 ms 46916 KB Output is correct
51 Correct 425 ms 47308 KB Output is correct
52 Correct 429 ms 46564 KB Output is correct
53 Correct 420 ms 40728 KB Output is correct
54 Correct 423 ms 40700 KB Output is correct
55 Correct 446 ms 40852 KB Output is correct
56 Correct 314 ms 41052 KB Output is correct
57 Correct 452 ms 41252 KB Output is correct
58 Correct 437 ms 41368 KB Output is correct
59 Correct 335 ms 41252 KB Output is correct
60 Correct 350 ms 40836 KB Output is correct
61 Correct 348 ms 40708 KB Output is correct
62 Correct 324 ms 40864 KB Output is correct
63 Correct 279 ms 39252 KB Output is correct
64 Correct 272 ms 38780 KB Output is correct
65 Correct 303 ms 39360 KB Output is correct
66 Correct 300 ms 39156 KB Output is correct
67 Correct 7 ms 14804 KB Output is correct
68 Correct 12 ms 15444 KB Output is correct
69 Correct 12 ms 15412 KB Output is correct
70 Correct 11 ms 15444 KB Output is correct
71 Correct 306 ms 39860 KB Output is correct
72 Correct 287 ms 39528 KB Output is correct
73 Correct 380 ms 38928 KB Output is correct
74 Correct 446 ms 47376 KB Output is correct
75 Correct 461 ms 47392 KB Output is correct
76 Correct 555 ms 47424 KB Output is correct
77 Correct 365 ms 47400 KB Output is correct
78 Correct 359 ms 47480 KB Output is correct
79 Correct 568 ms 47416 KB Output is correct
80 Correct 516 ms 46756 KB Output is correct
81 Correct 288 ms 46412 KB Output is correct
82 Correct 341 ms 47164 KB Output is correct
83 Correct 323 ms 47008 KB Output is correct
84 Correct 471 ms 33768 KB Output is correct
85 Correct 324 ms 33228 KB Output is correct
86 Correct 358 ms 32720 KB Output is correct
87 Correct 427 ms 40860 KB Output is correct
88 Correct 429 ms 40796 KB Output is correct
89 Correct 520 ms 40736 KB Output is correct
90 Correct 479 ms 40888 KB Output is correct
91 Correct 526 ms 40780 KB Output is correct
92 Correct 814 ms 45076 KB Output is correct
93 Correct 926 ms 46356 KB Output is correct
94 Correct 496 ms 41024 KB Output is correct
95 Correct 565 ms 41000 KB Output is correct
96 Correct 501 ms 40832 KB Output is correct
97 Correct 496 ms 41128 KB Output is correct
98 Correct 486 ms 41324 KB Output is correct
99 Correct 578 ms 41116 KB Output is correct
100 Correct 426 ms 41440 KB Output is correct
101 Correct 374 ms 41324 KB Output is correct
102 Correct 635 ms 41608 KB Output is correct
103 Correct 538 ms 41660 KB Output is correct
104 Correct 466 ms 41692 KB Output is correct
105 Correct 310 ms 38880 KB Output is correct
106 Correct 408 ms 39916 KB Output is correct
107 Correct 334 ms 38924 KB Output is correct
108 Correct 534 ms 39048 KB Output is correct