oj.uz

답안 #796755

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
796755 2023-07-28T17:18:13 Z GusterGoose27 Two Currencies (JOI23_currencies) C++17
100 / 100
 626 ms 133920 KB 
#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;

const int MAXN = 1e5+5;
const int MAXB = 17;
int n, m, q;

vector<pii> edges[MAXN];
vector<int> at_edge[MAXN];
int cost[MAXN];
int pos[MAXN];
int lca[MAXN][MAXB];
int depth[MAXN];

class stree {
public:
	int lp, rp;
	stree *l = nullptr;
	stree *r = nullptr;
	ll sum = 0;
	int num = 0;
	stree(int lv, int rv) {
		lp = lv;
		rp = rv;
		if (lp < rp) {
			int mid = (lp+rp)/2;
			l = new stree(lp, mid);
			r = new stree(mid+1, rp);
		}
	}
	stree(stree *prev, int v) {
		assert(!prev->l);
		sum = prev->sum+v;
		num = prev->num+1;
		lp = prev->lp;
		rp = prev->rp;
	}
	stree(stree *l, stree *r) : l(l), r(r) {
		sum = l->sum+r->sum;
		num = l->num+r->num;
		lp = l->lp;
		rp = r->rp;
	}
	stree *upd(int p, int v) {
		if (lp > p || rp < p) return this;
		if (lp == rp) return new stree(this, v);
		return new stree(l->upd(p, v), r->upd(p, v));
	}
};

stree *trees[MAXN];

void dfs(int cur, int p = -1) {
	for (pii e: edges[cur]) {
		int nxt = e.first;
		if (nxt == p) continue;
		trees[nxt] = trees[cur];
		for (int v: at_edge[e.second]) {
			trees[nxt] = trees[nxt]->upd(pos[v], cost[v]);
		}
		lca[nxt][0] = cur;
		depth[nxt] = 1+depth[cur];
		dfs(nxt, cur);
	}
}

int get_lca(int s, int t) {
	if (depth[s] < depth[t]) swap(s, t);
	for (int i = MAXB-1; i >= 0 && depth[s] > depth[t]; i--) {
		if ((1<<i) <= depth[s]-depth[t]) s = lca[s][i];
	}
	if (s == t) return s;
	for (int i = MAXB-1; i >= 0; i--) {
		if (lca[s][i] != lca[t][i]) {
			s = lca[s][i];
			t = lca[t][i];
		}
	}
	assert(s != t);
	assert(lca[s][0] == lca[t][0]);
	return lca[s][0];
}

int walk(stree *a, stree *b, stree *c, ll &amt) { // return max num you can buy with this amt
	if (amt == 0) return 0;
	if (a->sum+b->sum-2*c->sum <= amt) {
		amt -= (a->sum+b->sum-2*c->sum);
		return (a->num+b->num-2*c->num);
	}
	else if (!a->l) {
		amt = 0;
		return 0;
	}
	int v = walk(a->l, b->l, c->l, amt);
	return v + walk(a->r, b->r, c->r, amt);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	cin >> n >> m >> q;
	for (int i = 0; i < n-1; i++) {
		int x, y; cin >> x >> y; x--; y--;
		edges[x].push_back(pii(y, i));
		edges[y].push_back(pii(x, i));
	}
	vector<pii> sortable;
	for (int i = 0; i < m; i++) {
		int p, w; cin >> p >> w;
		p--;
		at_edge[p].push_back(i);
		cost[i] = w;
		sortable.push_back(pii(w, i));
	}
	sort(sortable.begin(), sortable.end());
	for (int i = 0; i < m; i++) pos[sortable[i].second] = i;
	trees[0] = new stree(0, m-1);
	dfs(0);
	for (int j = 1; j < MAXB; j++) {
		for (int i = 0; i < n; i++) lca[i][j] = lca[lca[i][j-1]][j-1];
	}
	for (int i = 0; i < q; i++) {
		int s, t, x; ll y; cin >> s >> t >> x >> y;
		s--; t--;
		int l = get_lca(s, t);
		int rem = trees[s]->num+trees[t]->num-2*trees[l]->num-walk(trees[s], trees[t], trees[l], y);
		if (rem <= x) cout << x-rem << '\n';
		else cout << "-1\n";
	}
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 5 ms 6504 KB Output is correct
6 Correct 5 ms 6484 KB Output is correct
7 Correct 5 ms 6100 KB Output is correct
8 Correct 6 ms 6612 KB Output is correct
9 Correct 5 ms 6612 KB Output is correct
10 Correct 6 ms 6680 KB Output is correct
11 Correct 6 ms 6612 KB Output is correct
12 Correct 6 ms 6560 KB Output is correct
13 Correct 7 ms 6868 KB Output is correct
14 Correct 6 ms 6756 KB Output is correct
15 Correct 6 ms 6740 KB Output is correct
16 Correct 7 ms 6744 KB Output is correct
17 Correct 6 ms 6612 KB Output is correct
18 Correct 6 ms 6740 KB Output is correct
19 Correct 5 ms 6612 KB Output is correct
20 Correct 5 ms 6612 KB Output is correct
21 Correct 5 ms 6612 KB Output is correct
22 Correct 5 ms 6612 KB Output is correct
23 Correct 5 ms 6612 KB Output is correct
24 Correct 5 ms 6612 KB Output is correct
25 Correct 6 ms 6612 KB Output is correct
26 Correct 5 ms 6612 KB Output is correct
27 Correct 6 ms 6612 KB Output is correct
28 Correct 5 ms 6612 KB Output is correct
29 Correct 5 ms 6612 KB Output is correct
30 Correct 5 ms 6612 KB Output is correct
31 Correct 5 ms 6656 KB Output is correct
32 Correct 5 ms 6612 KB Output is correct
33 Correct 6 ms 6868 KB Output is correct
34 Correct 6 ms 6868 KB Output is correct
35 Correct 6 ms 6868 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 6 ms 6612 KB Output is correct
3 Correct 13 ms 6592 KB Output is correct
4 Correct 7 ms 6612 KB Output is correct
5 Correct 252 ms 102468 KB Output is correct
6 Correct 268 ms 90860 KB Output is correct
7 Correct 229 ms 76060 KB Output is correct
8 Correct 227 ms 73416 KB Output is correct
9 Correct 207 ms 78528 KB Output is correct
10 Correct 324 ms 112832 KB Output is correct
11 Correct 327 ms 112800 KB Output is correct
12 Correct 330 ms 112840 KB Output is correct
13 Correct 327 ms 112860 KB Output is correct
14 Correct 335 ms 112868 KB Output is correct
15 Correct 582 ms 129548 KB Output is correct
16 Correct 620 ms 133516 KB Output is correct
17 Correct 621 ms 131848 KB Output is correct
18 Correct 488 ms 118288 KB Output is correct
19 Correct 517 ms 118096 KB Output is correct
20 Correct 518 ms 118228 KB Output is correct
21 Correct 270 ms 117464 KB Output is correct
22 Correct 269 ms 117720 KB Output is correct
23 Correct 262 ms 117684 KB Output is correct
24 Correct 268 ms 117632 KB Output is correct
25 Correct 309 ms 117860 KB Output is correct
26 Correct 299 ms 117912 KB Output is correct
27 Correct 312 ms 117860 KB Output is correct
28 Correct 275 ms 117776 KB Output is correct
29 Correct 239 ms 118016 KB Output is correct
30 Correct 254 ms 117996 KB Output is correct
31 Correct 254 ms 118092 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 6 ms 6964 KB Output is correct
3 Correct 8 ms 6996 KB Output is correct
4 Correct 6 ms 6928 KB Output is correct
5 Correct 288 ms 92768 KB Output is correct
6 Correct 265 ms 81476 KB Output is correct
7 Correct 386 ms 113148 KB Output is correct
8 Correct 525 ms 133876 KB Output is correct
9 Correct 559 ms 133856 KB Output is correct
10 Correct 529 ms 133780 KB Output is correct
11 Correct 448 ms 133336 KB Output is correct
12 Correct 433 ms 133292 KB Output is correct
13 Correct 492 ms 133248 KB Output is correct
14 Correct 289 ms 133720 KB Output is correct
15 Correct 315 ms 133620 KB Output is correct
16 Correct 352 ms 133920 KB Output is correct
17 Correct 321 ms 133824 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 5 ms 6504 KB Output is correct
6 Correct 5 ms 6484 KB Output is correct
7 Correct 5 ms 6100 KB Output is correct
8 Correct 6 ms 6612 KB Output is correct
9 Correct 5 ms 6612 KB Output is correct
10 Correct 6 ms 6680 KB Output is correct
11 Correct 6 ms 6612 KB Output is correct
12 Correct 6 ms 6560 KB Output is correct
13 Correct 7 ms 6868 KB Output is correct
14 Correct 6 ms 6756 KB Output is correct
15 Correct 6 ms 6740 KB Output is correct
16 Correct 7 ms 6744 KB Output is correct
17 Correct 6 ms 6612 KB Output is correct
18 Correct 6 ms 6740 KB Output is correct
19 Correct 5 ms 6612 KB Output is correct
20 Correct 5 ms 6612 KB Output is correct
21 Correct 5 ms 6612 KB Output is correct
22 Correct 5 ms 6612 KB Output is correct
23 Correct 5 ms 6612 KB Output is correct
24 Correct 5 ms 6612 KB Output is correct
25 Correct 6 ms 6612 KB Output is correct
26 Correct 5 ms 6612 KB Output is correct
27 Correct 6 ms 6612 KB Output is correct
28 Correct 5 ms 6612 KB Output is correct
29 Correct 5 ms 6612 KB Output is correct
30 Correct 5 ms 6612 KB Output is correct
31 Correct 5 ms 6656 KB Output is correct
32 Correct 5 ms 6612 KB Output is correct
33 Correct 6 ms 6868 KB Output is correct
34 Correct 6 ms 6868 KB Output is correct
35 Correct 6 ms 6868 KB Output is correct
36 Correct 3 ms 4948 KB Output is correct
37 Correct 6 ms 6612 KB Output is correct
38 Correct 13 ms 6592 KB Output is correct
39 Correct 7 ms 6612 KB Output is correct
40 Correct 252 ms 102468 KB Output is correct
41 Correct 268 ms 90860 KB Output is correct
42 Correct 229 ms 76060 KB Output is correct
43 Correct 227 ms 73416 KB Output is correct
44 Correct 207 ms 78528 KB Output is correct
45 Correct 324 ms 112832 KB Output is correct
46 Correct 327 ms 112800 KB Output is correct
47 Correct 330 ms 112840 KB Output is correct
48 Correct 327 ms 112860 KB Output is correct
49 Correct 335 ms 112868 KB Output is correct
50 Correct 582 ms 129548 KB Output is correct
51 Correct 620 ms 133516 KB Output is correct
52 Correct 621 ms 131848 KB Output is correct
53 Correct 488 ms 118288 KB Output is correct
54 Correct 517 ms 118096 KB Output is correct
55 Correct 518 ms 118228 KB Output is correct
56 Correct 270 ms 117464 KB Output is correct
57 Correct 269 ms 117720 KB Output is correct
58 Correct 262 ms 117684 KB Output is correct
59 Correct 268 ms 117632 KB Output is correct
60 Correct 309 ms 117860 KB Output is correct
61 Correct 299 ms 117912 KB Output is correct
62 Correct 312 ms 117860 KB Output is correct
63 Correct 275 ms 117776 KB Output is correct
64 Correct 239 ms 118016 KB Output is correct
65 Correct 254 ms 117996 KB Output is correct
66 Correct 254 ms 118092 KB Output is correct
67 Correct 2 ms 4948 KB Output is correct
68 Correct 6 ms 6964 KB Output is correct
69 Correct 8 ms 6996 KB Output is correct
70 Correct 6 ms 6928 KB Output is correct
71 Correct 288 ms 92768 KB Output is correct
72 Correct 265 ms 81476 KB Output is correct
73 Correct 386 ms 113148 KB Output is correct
74 Correct 525 ms 133876 KB Output is correct
75 Correct 559 ms 133856 KB Output is correct
76 Correct 529 ms 133780 KB Output is correct
77 Correct 448 ms 133336 KB Output is correct
78 Correct 433 ms 133292 KB Output is correct
79 Correct 492 ms 133248 KB Output is correct
80 Correct 289 ms 133720 KB Output is correct
81 Correct 315 ms 133620 KB Output is correct
82 Correct 352 ms 133920 KB Output is correct
83 Correct 321 ms 133824 KB Output is correct
84 Correct 251 ms 108344 KB Output is correct
85 Correct 271 ms 95832 KB Output is correct
86 Correct 192 ms 69316 KB Output is correct
87 Correct 330 ms 117964 KB Output is correct
88 Correct 342 ms 117960 KB Output is correct
89 Correct 328 ms 117924 KB Output is correct
90 Correct 343 ms 117960 KB Output is correct
91 Correct 335 ms 117924 KB Output is correct
92 Correct 621 ms 127996 KB Output is correct
93 Correct 626 ms 131264 KB Output is correct
94 Correct 512 ms 118208 KB Output is correct
95 Correct 499 ms 118176 KB Output is correct
96 Correct 486 ms 118164 KB Output is correct
97 Correct 528 ms 118128 KB Output is correct
98 Correct 295 ms 117688 KB Output is correct
99 Correct 273 ms 117508 KB Output is correct
100 Correct 265 ms 117592 KB Output is correct
101 Correct 307 ms 117620 KB Output is correct
102 Correct 339 ms 117824 KB Output is correct
103 Correct 378 ms 117928 KB Output is correct
104 Correct 328 ms 117804 KB Output is correct
105 Correct 308 ms 118088 KB Output is correct
106 Correct 264 ms 117936 KB Output is correct
107 Correct 295 ms 117820 KB Output is correct
108 Correct 304 ms 117944 KB Output is correct