oj.uz

답안 #856731

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856731 2023-10-04T12:01:00 Z bkhanh Two Currencies (JOI23_currencies) C++14
100 / 100
 4030 ms 56700 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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 18012 KB Output is correct
2 Correct 3 ms 18160 KB Output is correct
3 Correct 2 ms 8024 KB Output is correct
4 Correct 3 ms 18008 KB Output is correct
5 Correct 15 ms 18776 KB Output is correct
6 Correct 17 ms 18524 KB Output is correct
7 Correct 16 ms 18524 KB Output is correct
8 Correct 17 ms 18520 KB Output is correct
9 Correct 17 ms 18524 KB Output is correct
10 Correct 18 ms 18720 KB Output is correct
11 Correct 18 ms 18524 KB Output is correct
12 Correct 19 ms 18520 KB Output is correct
13 Correct 10 ms 18776 KB Output is correct
14 Correct 11 ms 18780 KB Output is correct
15 Correct 14 ms 18780 KB Output is correct
16 Correct 15 ms 18780 KB Output is correct
17 Correct 15 ms 18524 KB Output is correct
18 Correct 15 ms 18780 KB Output is correct
19 Correct 17 ms 18520 KB Output is correct
20 Correct 17 ms 18524 KB Output is correct
21 Correct 20 ms 18520 KB Output is correct
22 Correct 18 ms 18700 KB Output is correct
23 Correct 6 ms 18772 KB Output is correct
24 Correct 8 ms 18776 KB Output is correct
25 Correct 9 ms 18816 KB Output is correct
26 Correct 5 ms 18520 KB Output is correct
27 Correct 5 ms 18688 KB Output is correct
28 Correct 11 ms 18524 KB Output is correct
29 Correct 11 ms 18676 KB Output is correct
30 Correct 16 ms 18696 KB Output is correct
31 Correct 17 ms 18520 KB Output is correct
32 Correct 18 ms 18520 KB Output is correct
33 Correct 11 ms 18780 KB Output is correct
34 Correct 10 ms 18780 KB Output is correct
35 Correct 9 ms 18780 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 18012 KB Output is correct
2 Correct 16 ms 18524 KB Output is correct
3 Correct 17 ms 18680 KB Output is correct
4 Correct 19 ms 18524 KB Output is correct
5 Correct 2698 ms 41808 KB Output is correct
6 Correct 2457 ms 41236 KB Output is correct
7 Correct 1914 ms 41164 KB Output is correct
8 Correct 1662 ms 39376 KB Output is correct
9 Correct 1810 ms 38520 KB Output is correct
10 Correct 3215 ms 45828 KB Output is correct
11 Correct 3259 ms 44568 KB Output is correct
12 Correct 3221 ms 46276 KB Output is correct
13 Correct 3209 ms 44516 KB Output is correct
14 Correct 3210 ms 46204 KB Output is correct
15 Correct 2799 ms 55536 KB Output is correct
16 Correct 2993 ms 56224 KB Output is correct
17 Correct 1454 ms 55492 KB Output is correct
18 Correct 3304 ms 44984 KB Output is correct
19 Correct 3288 ms 44952 KB Output is correct
20 Correct 3469 ms 44916 KB Output is correct
21 Correct 2623 ms 44192 KB Output is correct
22 Correct 2601 ms 43364 KB Output is correct
23 Correct 2636 ms 45352 KB Output is correct
24 Correct 2622 ms 43364 KB Output is correct
25 Correct 506 ms 45068 KB Output is correct
26 Correct 408 ms 45436 KB Output is correct
27 Correct 196 ms 44400 KB Output is correct
28 Correct 112 ms 44148 KB Output is correct
29 Correct 127 ms 44660 KB Output is correct
30 Correct 2602 ms 45124 KB Output is correct
31 Correct 2629 ms 44908 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8024 KB Output is correct
2 Correct 10 ms 18776 KB Output is correct
3 Correct 10 ms 18928 KB Output is correct
4 Correct 12 ms 18856 KB Output is correct
5 Correct 805 ms 49536 KB Output is correct
6 Correct 635 ms 48760 KB Output is correct
7 Correct 1448 ms 46932 KB Output is correct
8 Correct 1646 ms 55600 KB Output is correct
9 Correct 1654 ms 55728 KB Output is correct
10 Correct 1693 ms 56256 KB Output is correct
11 Correct 429 ms 55668 KB Output is correct
12 Correct 498 ms 56700 KB Output is correct
13 Correct 548 ms 55672 KB Output is correct
14 Correct 115 ms 55924 KB Output is correct
15 Correct 122 ms 55412 KB Output is correct
16 Correct 1099 ms 56248 KB Output is correct
17 Correct 1114 ms 55800 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 18012 KB Output is correct
2 Correct 3 ms 18160 KB Output is correct
3 Correct 2 ms 8024 KB Output is correct
4 Correct 3 ms 18008 KB Output is correct
5 Correct 15 ms 18776 KB Output is correct
6 Correct 17 ms 18524 KB Output is correct
7 Correct 16 ms 18524 KB Output is correct
8 Correct 17 ms 18520 KB Output is correct
9 Correct 17 ms 18524 KB Output is correct
10 Correct 18 ms 18720 KB Output is correct
11 Correct 18 ms 18524 KB Output is correct
12 Correct 19 ms 18520 KB Output is correct
13 Correct 10 ms 18776 KB Output is correct
14 Correct 11 ms 18780 KB Output is correct
15 Correct 14 ms 18780 KB Output is correct
16 Correct 15 ms 18780 KB Output is correct
17 Correct 15 ms 18524 KB Output is correct
18 Correct 15 ms 18780 KB Output is correct
19 Correct 17 ms 18520 KB Output is correct
20 Correct 17 ms 18524 KB Output is correct
21 Correct 20 ms 18520 KB Output is correct
22 Correct 18 ms 18700 KB Output is correct
23 Correct 6 ms 18772 KB Output is correct
24 Correct 8 ms 18776 KB Output is correct
25 Correct 9 ms 18816 KB Output is correct
26 Correct 5 ms 18520 KB Output is correct
27 Correct 5 ms 18688 KB Output is correct
28 Correct 11 ms 18524 KB Output is correct
29 Correct 11 ms 18676 KB Output is correct
30 Correct 16 ms 18696 KB Output is correct
31 Correct 17 ms 18520 KB Output is correct
32 Correct 18 ms 18520 KB Output is correct
33 Correct 11 ms 18780 KB Output is correct
34 Correct 10 ms 18780 KB Output is correct
35 Correct 9 ms 18780 KB Output is correct
36 Correct 3 ms 18012 KB Output is correct
37 Correct 16 ms 18524 KB Output is correct
38 Correct 17 ms 18680 KB Output is correct
39 Correct 19 ms 18524 KB Output is correct
40 Correct 2698 ms 41808 KB Output is correct
41 Correct 2457 ms 41236 KB Output is correct
42 Correct 1914 ms 41164 KB Output is correct
43 Correct 1662 ms 39376 KB Output is correct
44 Correct 1810 ms 38520 KB Output is correct
45 Correct 3215 ms 45828 KB Output is correct
46 Correct 3259 ms 44568 KB Output is correct
47 Correct 3221 ms 46276 KB Output is correct
48 Correct 3209 ms 44516 KB Output is correct
49 Correct 3210 ms 46204 KB Output is correct
50 Correct 2799 ms 55536 KB Output is correct
51 Correct 2993 ms 56224 KB Output is correct
52 Correct 1454 ms 55492 KB Output is correct
53 Correct 3304 ms 44984 KB Output is correct
54 Correct 3288 ms 44952 KB Output is correct
55 Correct 3469 ms 44916 KB Output is correct
56 Correct 2623 ms 44192 KB Output is correct
57 Correct 2601 ms 43364 KB Output is correct
58 Correct 2636 ms 45352 KB Output is correct
59 Correct 2622 ms 43364 KB Output is correct
60 Correct 506 ms 45068 KB Output is correct
61 Correct 408 ms 45436 KB Output is correct
62 Correct 196 ms 44400 KB Output is correct
63 Correct 112 ms 44148 KB Output is correct
64 Correct 127 ms 44660 KB Output is correct
65 Correct 2602 ms 45124 KB Output is correct
66 Correct 2629 ms 44908 KB Output is correct
67 Correct 2 ms 8024 KB Output is correct
68 Correct 10 ms 18776 KB Output is correct
69 Correct 10 ms 18928 KB Output is correct
70 Correct 12 ms 18856 KB Output is correct
71 Correct 805 ms 49536 KB Output is correct
72 Correct 635 ms 48760 KB Output is correct
73 Correct 1448 ms 46932 KB Output is correct
74 Correct 1646 ms 55600 KB Output is correct
75 Correct 1654 ms 55728 KB Output is correct
76 Correct 1693 ms 56256 KB Output is correct
77 Correct 429 ms 55668 KB Output is correct
78 Correct 498 ms 56700 KB Output is correct
79 Correct 548 ms 55672 KB Output is correct
80 Correct 115 ms 55924 KB Output is correct
81 Correct 122 ms 55412 KB Output is correct
82 Correct 1099 ms 56248 KB Output is correct
83 Correct 1114 ms 55800 KB Output is correct
84 Correct 3142 ms 40512 KB Output is correct
85 Correct 2770 ms 40904 KB Output is correct
86 Correct 1703 ms 38816 KB Output is correct
87 Correct 3610 ms 45464 KB Output is correct
88 Correct 3611 ms 45504 KB Output is correct
89 Correct 3627 ms 44500 KB Output is correct
90 Correct 3733 ms 44652 KB Output is correct
91 Correct 3947 ms 45472 KB Output is correct
92 Correct 2048 ms 52024 KB Output is correct
93 Correct 1738 ms 54332 KB Output is correct
94 Correct 3948 ms 45024 KB Output is correct
95 Correct 4030 ms 45164 KB Output is correct
96 Correct 4013 ms 44860 KB Output is correct
97 Correct 3955 ms 44820 KB Output is correct
98 Correct 3549 ms 43976 KB Output is correct
99 Correct 3583 ms 43388 KB Output is correct
100 Correct 3620 ms 43440 KB Output is correct
101 Correct 3638 ms 44044 KB Output is correct
102 Correct 278 ms 44980 KB Output is correct
103 Correct 322 ms 44236 KB Output is correct
104 Correct 1004 ms 44400 KB Output is correct
105 Correct 117 ms 44408 KB Output is correct
106 Correct 118 ms 44400 KB Output is correct
107 Correct 3053 ms 44400 KB Output is correct
108 Correct 3012 ms 45132 KB Output is correct