oj.uz

Submission #796754

# Submission time Handle Problem Language Result Execution time Memory
796754 2023-07-28T17:15:42 Z GusterGoose27 Two Currencies (JOI23_currencies) C++17
10 / 100
 5000 ms 129440 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) 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5024 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 6 ms 6580 KB Output is correct
6 Correct 6 ms 6576 KB Output is correct
7 Correct 5 ms 6228 KB Output is correct
8 Correct 6 ms 6704 KB Output is correct
9 Correct 6 ms 6740 KB Output is correct
10 Correct 7 ms 6740 KB Output is correct
11 Correct 7 ms 6664 KB Output is correct
12 Correct 7 ms 6740 KB Output is correct
13 Correct 14 ms 6996 KB Output is correct
14 Correct 14 ms 6884 KB Output is correct
15 Correct 12 ms 6868 KB Output is correct
16 Correct 11 ms 6832 KB Output is correct
17 Correct 10 ms 6740 KB Output is correct
18 Correct 12 ms 6740 KB Output is correct
19 Correct 5 ms 6704 KB Output is correct
20 Correct 5 ms 6740 KB Output is correct
21 Correct 5 ms 6704 KB Output is correct
22 Correct 5 ms 6740 KB Output is correct
23 Correct 8 ms 6704 KB Output is correct
24 Correct 8 ms 6740 KB Output is correct
25 Correct 8 ms 6756 KB Output is correct
26 Correct 6 ms 6740 KB Output is correct
27 Correct 6 ms 6764 KB Output is correct
28 Correct 6 ms 6740 KB Output is correct
29 Correct 6 ms 6700 KB Output is correct
30 Correct 6 ms 6740 KB Output is correct
31 Correct 6 ms 6752 KB Output is correct
32 Correct 6 ms 6740 KB Output is correct
33 Correct 14 ms 7060 KB Output is correct
34 Correct 15 ms 6960 KB Output is correct
35 Correct 15 ms 6996 KB Output is correct

Subtask #2
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5076 KB Output is correct
2 Correct 6 ms 6768 KB Output is correct
3 Correct 6 ms 6740 KB Output is correct
4 Correct 6 ms 6740 KB Output is correct
5 Correct 332 ms 106752 KB Output is correct
6 Correct 384 ms 95740 KB Output is correct
7 Correct 307 ms 80704 KB Output is correct
8 Correct 243 ms 77336 KB Output is correct
9 Correct 267 ms 82396 KB Output is correct
10 Correct 512 ms 117924 KB Output is correct
11 Correct 500 ms 118100 KB Output is correct
12 Correct 493 ms 117956 KB Output is correct
13 Correct 503 ms 118052 KB Output is correct
14 Correct 518 ms 117996 KB Output is correct
15 Execution timed out 5064 ms 129440 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 15 ms 7072 KB Output is correct
3 Correct 17 ms 6996 KB Output is correct
4 Correct 15 ms 6996 KB Output is correct
5 Execution timed out 5074 ms 93552 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 5024 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 6 ms 6580 KB Output is correct
6 Correct 6 ms 6576 KB Output is correct
7 Correct 5 ms 6228 KB Output is correct
8 Correct 6 ms 6704 KB Output is correct
9 Correct 6 ms 6740 KB Output is correct
10 Correct 7 ms 6740 KB Output is correct
11 Correct 7 ms 6664 KB Output is correct
12 Correct 7 ms 6740 KB Output is correct
13 Correct 14 ms 6996 KB Output is correct
14 Correct 14 ms 6884 KB Output is correct
15 Correct 12 ms 6868 KB Output is correct
16 Correct 11 ms 6832 KB Output is correct
17 Correct 10 ms 6740 KB Output is correct
18 Correct 12 ms 6740 KB Output is correct
19 Correct 5 ms 6704 KB Output is correct
20 Correct 5 ms 6740 KB Output is correct
21 Correct 5 ms 6704 KB Output is correct
22 Correct 5 ms 6740 KB Output is correct
23 Correct 8 ms 6704 KB Output is correct
24 Correct 8 ms 6740 KB Output is correct
25 Correct 8 ms 6756 KB Output is correct
26 Correct 6 ms 6740 KB Output is correct
27 Correct 6 ms 6764 KB Output is correct
28 Correct 6 ms 6740 KB Output is correct
29 Correct 6 ms 6700 KB Output is correct
30 Correct 6 ms 6740 KB Output is correct
31 Correct 6 ms 6752 KB Output is correct
32 Correct 6 ms 6740 KB Output is correct
33 Correct 14 ms 7060 KB Output is correct
34 Correct 15 ms 6960 KB Output is correct
35 Correct 15 ms 6996 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 6 ms 6768 KB Output is correct
38 Correct 6 ms 6740 KB Output is correct
39 Correct 6 ms 6740 KB Output is correct
40 Correct 332 ms 106752 KB Output is correct
41 Correct 384 ms 95740 KB Output is correct
42 Correct 307 ms 80704 KB Output is correct
43 Correct 243 ms 77336 KB Output is correct
44 Correct 267 ms 82396 KB Output is correct
45 Correct 512 ms 117924 KB Output is correct
46 Correct 500 ms 118100 KB Output is correct
47 Correct 493 ms 117956 KB Output is correct
48 Correct 503 ms 118052 KB Output is correct
49 Correct 518 ms 117996 KB Output is correct
50 Execution timed out 5064 ms 129440 KB Time limit exceeded
51 Halted 0 ms 0 KB -