oj.uz

Submission #856743

# Submission time Handle Problem Language Result Execution time Memory
856743 2023-10-04T12:10:03 Z bkhanh Two Currencies (JOI23_currencies) C++14
100 / 100
 3969 ms 51952 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
 
vector<int> prixs[100 * 1000 + 42];
vector<pair<int, int>> voisins[100 * 1000 + 42];
 
vector<tuple<int, int, int>> index_to_val;
 
int posSommet[100 * 1000 + 42];
vector<int> valRag;
 
void dfs(int u, int parent = -1) {
	posSommet[u] = valRag.size();
	
	for(pair<int, int> edge : voisins[u]) {
		if(edge.first == parent) continue;
		
		for(int prix : prixs[edge.second])
			valRag.push_back(prix);
		
		dfs(edge.first, u);
		
		for(int prix : prixs[edge.second])
			valRag.push_back(prix);
	}
}
 
struct Req {
	int batch;
	int id, x, y, z, w;
};
 
bool operator < (const Req& a, const Req& b) {
	if(a.batch != b.batch) return a.batch < b.batch;
	if(a.y != b.y) return a.y < b.y;
	return a.x < b.x;
}
 
int sommeSous[(1 << 20)];
int node[(1 << 20)];
 
void ajoute(int pos, int val) {
	pos += (1 << 19);
	
	while(pos != 0) {
		sommeSous[pos] += val;
		node[pos] += (val > 0)?1:-1;
		pos /= 2;
	}
}
 
int z_keep(int pos, int val) {
	if(pos >= (1 << 19)) {
		return 0;
	}
	
	if(sommeSous[2 * pos] <= val) 
		return z_keep(2 * pos + 1, val - sommeSous[2 * pos]) + node[2 * pos];
	return z_keep(2 * pos, val);
}
 
bool presents[100 * 1000 + 42];
 
void swp(int prix) {
	if(!presents[prix]) {
		ajoute(prix, get<0>(index_to_val[prix]));
	}
	else {
		ajoute(prix, -get<0>(index_to_val[prix]));
	}
	presents[prix] = !presents[prix];
}
 
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	
	int nbSommets, nbChecks, nbReqs;
	cin >> nbSommets >> nbChecks >> nbReqs;
	
	for(int iRoute = 0;iRoute < nbSommets - 1;iRoute++) {
		int x, y;
		cin >> x >> y;
		x--; y--;
		voisins[x].push_back({y, iRoute});
		voisins[y].push_back({x, iRoute});
	}
	
	for(int iCheck = 0;iCheck < nbChecks;iCheck++) {
		int route, prix;
		cin >> route >> prix;
		route--;
		index_to_val.push_back({prix, route, prixs[route].size()});
		prixs[route].push_back(prix);
	}
	
	// Réindexation
	
	index_to_val.push_back({0, -1, -1});
	sort(index_to_val.begin(), index_to_val.end());
	
	for(int iTuple = 1;iTuple < (int)index_to_val.size();iTuple++) {
		tuple<int, int, int> t = index_to_val[iTuple];
		prixs[get<1>(t)][get<2>(t)] = iTuple;
	}
	
	// Mo sur arbre
	dfs(0);
	
	const int SQR = sqrt(valRag.size());
	
	vector<Req> reqs;
	for(int iReq = 0;iReq < nbReqs;iReq++) {
		int x, y, z, w;
		cin >> x >> y >> z >> w;
		x--; y--;
		
		x = posSommet[x];
		y = posSommet[y];
		if(x > y) swap(x, y);
		
		reqs.push_back({x / SQR, iReq, x, y, z, w});
	}
	
	sort(reqs.begin(), reqs.end());
 
	vector<int> reponses(reqs.size(), 0);
	
	int d = 0, f = 0;
	for(Req r : reqs) {
		while(d < r.x) {
			swp(valRag[d]);
			d++;
		}
		
		while(r.x < d) {
			d--;
			swp(valRag[d]);
		}
		
		while(f < r.y) {
			swp(valRag[f]);
			f++;
		}
		
		while(r.y < f) {
			f--;
			swp(valRag[f]);
		}
		
		int gk = z_keep(1, r.w);
		
		if(node[1] > r.z + gk) reponses[r.id] = -1;
		else reponses[r.id] = r.z + gk - node[1];
	}
	
	for(int iReq = 0;iReq < nbReqs;iReq++) {
		cout << reponses[iReq] << "\n";		
	}
	
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18008 KB Output is correct
2 Correct 3 ms 18012 KB Output is correct
3 Correct 3 ms 8028 KB Output is correct
4 Correct 3 ms 18012 KB Output is correct
5 Correct 15 ms 18524 KB Output is correct
6 Correct 16 ms 18524 KB Output is correct
7 Correct 14 ms 18524 KB Output is correct
8 Correct 17 ms 18524 KB Output is correct
9 Correct 18 ms 18524 KB Output is correct
10 Correct 17 ms 18520 KB Output is correct
11 Correct 17 ms 18520 KB Output is correct
12 Correct 18 ms 18640 KB Output is correct
13 Correct 10 ms 19032 KB Output is correct
14 Correct 11 ms 18628 KB Output is correct
15 Correct 17 ms 18524 KB Output is correct
16 Correct 14 ms 18524 KB Output is correct
17 Correct 16 ms 18472 KB Output is correct
18 Correct 15 ms 18524 KB Output is correct
19 Correct 16 ms 18628 KB Output is correct
20 Correct 16 ms 18524 KB Output is correct
21 Correct 17 ms 18520 KB Output is correct
22 Correct 18 ms 18520 KB Output is correct
23 Correct 6 ms 18524 KB Output is correct
24 Correct 8 ms 18628 KB Output is correct
25 Correct 8 ms 18524 KB Output is correct
26 Correct 5 ms 18524 KB Output is correct
27 Correct 5 ms 18508 KB Output is correct
28 Correct 11 ms 18524 KB Output is correct
29 Correct 11 ms 18608 KB Output is correct
30 Correct 16 ms 18524 KB Output is correct
31 Correct 16 ms 18612 KB Output is correct
32 Correct 17 ms 18636 KB Output is correct
33 Correct 10 ms 18780 KB Output is correct
34 Correct 11 ms 18776 KB Output is correct
35 Correct 10 ms 18780 KB Output is correct

Subtask #2
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18012 KB Output is correct
2 Correct 16 ms 18640 KB Output is correct
3 Correct 16 ms 18636 KB Output is correct
4 Correct 16 ms 18520 KB Output is correct
5 Correct 2643 ms 36616 KB Output is correct
6 Correct 2787 ms 36696 KB Output is correct
7 Correct 1915 ms 38020 KB Output is correct
8 Correct 1752 ms 35616 KB Output is correct
9 Correct 1968 ms 35720 KB Output is correct
10 Correct 3799 ms 39348 KB Output is correct
11 Correct 3502 ms 39620 KB Output is correct
12 Correct 3328 ms 39652 KB Output is correct
13 Correct 3340 ms 39728 KB Output is correct
14 Correct 3245 ms 41368 KB Output is correct
15 Correct 3000 ms 49148 KB Output is correct
16 Correct 3028 ms 50992 KB Output is correct
17 Correct 1451 ms 49716 KB Output is correct
18 Correct 3409 ms 39404 KB Output is correct
19 Correct 3314 ms 40936 KB Output is correct
20 Correct 3427 ms 39492 KB Output is correct
21 Correct 2615 ms 40556 KB Output is correct
22 Correct 2643 ms 39832 KB Output is correct
23 Correct 2660 ms 38744 KB Output is correct
24 Correct 2628 ms 38848 KB Output is correct
25 Correct 500 ms 38868 KB Output is correct
26 Correct 402 ms 39028 KB Output is correct
27 Correct 212 ms 40432 KB Output is correct
28 Correct 119 ms 41220 KB Output is correct
29 Correct 121 ms 41276 KB Output is correct
30 Correct 2696 ms 39516 KB Output is correct
31 Correct 2738 ms 39332 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Correct 9 ms 18780 KB Output is correct
3 Correct 10 ms 18780 KB Output is correct
4 Correct 10 ms 18780 KB Output is correct
5 Correct 834 ms 45308 KB Output is correct
6 Correct 708 ms 45036 KB Output is correct
7 Correct 1473 ms 44124 KB Output is correct
8 Correct 1697 ms 51560 KB Output is correct
9 Correct 1726 ms 50764 KB Output is correct
10 Correct 1695 ms 49844 KB Output is correct
11 Correct 415 ms 50036 KB Output is correct
12 Correct 540 ms 49560 KB Output is correct
13 Correct 494 ms 50300 KB Output is correct
14 Correct 117 ms 51952 KB Output is correct
15 Correct 117 ms 50548 KB Output is correct
16 Correct 1095 ms 51824 KB Output is correct
17 Correct 1200 ms 49836 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18008 KB Output is correct
2 Correct 3 ms 18012 KB Output is correct
3 Correct 3 ms 8028 KB Output is correct
4 Correct 3 ms 18012 KB Output is correct
5 Correct 15 ms 18524 KB Output is correct
6 Correct 16 ms 18524 KB Output is correct
7 Correct 14 ms 18524 KB Output is correct
8 Correct 17 ms 18524 KB Output is correct
9 Correct 18 ms 18524 KB Output is correct
10 Correct 17 ms 18520 KB Output is correct
11 Correct 17 ms 18520 KB Output is correct
12 Correct 18 ms 18640 KB Output is correct
13 Correct 10 ms 19032 KB Output is correct
14 Correct 11 ms 18628 KB Output is correct
15 Correct 17 ms 18524 KB Output is correct
16 Correct 14 ms 18524 KB Output is correct
17 Correct 16 ms 18472 KB Output is correct
18 Correct 15 ms 18524 KB Output is correct
19 Correct 16 ms 18628 KB Output is correct
20 Correct 16 ms 18524 KB Output is correct
21 Correct 17 ms 18520 KB Output is correct
22 Correct 18 ms 18520 KB Output is correct
23 Correct 6 ms 18524 KB Output is correct
24 Correct 8 ms 18628 KB Output is correct
25 Correct 8 ms 18524 KB Output is correct
26 Correct 5 ms 18524 KB Output is correct
27 Correct 5 ms 18508 KB Output is correct
28 Correct 11 ms 18524 KB Output is correct
29 Correct 11 ms 18608 KB Output is correct
30 Correct 16 ms 18524 KB Output is correct
31 Correct 16 ms 18612 KB Output is correct
32 Correct 17 ms 18636 KB Output is correct
33 Correct 10 ms 18780 KB Output is correct
34 Correct 11 ms 18776 KB Output is correct
35 Correct 10 ms 18780 KB Output is correct
36 Correct 3 ms 18012 KB Output is correct
37 Correct 16 ms 18640 KB Output is correct
38 Correct 16 ms 18636 KB Output is correct
39 Correct 16 ms 18520 KB Output is correct
40 Correct 2643 ms 36616 KB Output is correct
41 Correct 2787 ms 36696 KB Output is correct
42 Correct 1915 ms 38020 KB Output is correct
43 Correct 1752 ms 35616 KB Output is correct
44 Correct 1968 ms 35720 KB Output is correct
45 Correct 3799 ms 39348 KB Output is correct
46 Correct 3502 ms 39620 KB Output is correct
47 Correct 3328 ms 39652 KB Output is correct
48 Correct 3340 ms 39728 KB Output is correct
49 Correct 3245 ms 41368 KB Output is correct
50 Correct 3000 ms 49148 KB Output is correct
51 Correct 3028 ms 50992 KB Output is correct
52 Correct 1451 ms 49716 KB Output is correct
53 Correct 3409 ms 39404 KB Output is correct
54 Correct 3314 ms 40936 KB Output is correct
55 Correct 3427 ms 39492 KB Output is correct
56 Correct 2615 ms 40556 KB Output is correct
57 Correct 2643 ms 39832 KB Output is correct
58 Correct 2660 ms 38744 KB Output is correct
59 Correct 2628 ms 38848 KB Output is correct
60 Correct 500 ms 38868 KB Output is correct
61 Correct 402 ms 39028 KB Output is correct
62 Correct 212 ms 40432 KB Output is correct
63 Correct 119 ms 41220 KB Output is correct
64 Correct 121 ms 41276 KB Output is correct
65 Correct 2696 ms 39516 KB Output is correct
66 Correct 2738 ms 39332 KB Output is correct
67 Correct 2 ms 8024 KB Output is correct
68 Correct 9 ms 18780 KB Output is correct
69 Correct 10 ms 18780 KB Output is correct
70 Correct 10 ms 18780 KB Output is correct
71 Correct 834 ms 45308 KB Output is correct
72 Correct 708 ms 45036 KB Output is correct
73 Correct 1473 ms 44124 KB Output is correct
74 Correct 1697 ms 51560 KB Output is correct
75 Correct 1726 ms 50764 KB Output is correct
76 Correct 1695 ms 49844 KB Output is correct
77 Correct 415 ms 50036 KB Output is correct
78 Correct 540 ms 49560 KB Output is correct
79 Correct 494 ms 50300 KB Output is correct
80 Correct 117 ms 51952 KB Output is correct
81 Correct 117 ms 50548 KB Output is correct
82 Correct 1095 ms 51824 KB Output is correct
83 Correct 1200 ms 49836 KB Output is correct
84 Correct 3245 ms 36004 KB Output is correct
85 Correct 2782 ms 35444 KB Output is correct
86 Correct 1679 ms 33404 KB Output is correct
87 Correct 3733 ms 41256 KB Output is correct
88 Correct 3747 ms 39752 KB Output is correct
89 Correct 3777 ms 41408 KB Output is correct
90 Correct 3652 ms 39344 KB Output is correct
91 Correct 3653 ms 39324 KB Output is correct
92 Correct 1957 ms 47680 KB Output is correct
93 Correct 1736 ms 48332 KB Output is correct
94 Correct 3960 ms 40696 KB Output is correct
95 Correct 3963 ms 39404 KB Output is correct
96 Correct 3969 ms 40600 KB Output is correct
97 Correct 3915 ms 41048 KB Output is correct
98 Correct 3536 ms 39112 KB Output is correct
99 Correct 3597 ms 38704 KB Output is correct
100 Correct 3609 ms 38644 KB Output is correct
101 Correct 3599 ms 38672 KB Output is correct
102 Correct 289 ms 38924 KB Output is correct
103 Correct 309 ms 40380 KB Output is correct
104 Correct 965 ms 40312 KB Output is correct
105 Correct 116 ms 39800 KB Output is correct
106 Correct 116 ms 41324 KB Output is correct
107 Correct 3012 ms 39328 KB Output is correct
108 Correct 2937 ms 40000 KB Output is correct