Submission #826895

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
826895	2023-08-16T06:07:42 Z	khshg	Two Currencies (JOI23_currencies)	C++14	10 / 100	5000 ms	37660 KB

currencies

#include<bits/stdc++.h>
using namespace std;
#define int long long

const int LG = 20;
int N, M, Q;
vector<pair<int, int>> e;
vector<vector<pair<int, int>>> adj;
vector<array<int, LG>> par;
vector<int> lvl;
vector<vector<int>> pp;

void dfs(int s) {
	for(auto& v : adj[s]) {
		int u = v.first;
		if(u == par[s][0]) continue;
		lvl[u] = lvl[s] + 1;
		par[u][0] = s;
		for(int i = 1; i < LG; ++i) {
			par[u][i] = par[par[u][i - 1]][i - 1];
		}
		dfs(u);
	}
}

int lca(int s, int t) {
	if(lvl[t] > lvl[s]) swap(s, t);
	for(int i = LG - 1; i >= 0; --i) {
		if(lvl[par[s][i]] >= lvl[t]) {
			s = par[s][i];
		}
	}
	if(s == t) return s;
	for(int i = LG - 1; i >= 0; --i) {
		if(par[s][i] != par[t][i]) {
			s = par[s][i];
			t = par[t][i];
		}
	}
	return par[s][0];
}
 
int32_t main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> N >> M >>  Q;
	adj.resize(N);
	for(int i = 1; i < N; ++i) {
		int u, v; cin >> u >> v;
		--u; --v;
		e.emplace_back(u, v);
		adj[u].push_back({v, i});
		adj[v].push_back({u, i});
	}
	lvl.resize(N);
	par.resize(N);
	dfs(0);
	for(int i = 0; i + 1 < N; ++i) {
		if(par[e[i].second][0] == e[i].first) {
			swap(e[i].first, e[i].second);
		}
	}
	pp.resize(N);
	for(int i = 0; i < M; ++i) {
		int p, c; cin >> p >> c;
		--p;
		pp[e[p].first].push_back(c);
	}
	while(Q--) {
		int S, T, X;
		long long Y;
		cin >> S >> T >> X >> Y;
		--S; --T;
		int L = lca(S, T);
		vector<int> cur;
		while(S != L) {
			for(auto& u : pp[S]) {
				cur.push_back(u);
			}
			S = par[S][0];
		}
		while(T != L) {
			for(auto& u : pp[T]) {
				cur.push_back(u);
			}
			T = par[T][0];
		}
		sort(begin(cur), end(cur));
		int ans = X;
		for(int i = 0; i < (int)cur.size(); ++i) {
			if(Y - cur[i] >= 0) {
				Y -= cur[i];
			} else {
				ans = X - ((int)cur.size() - i);
				break;
			}
		}
		if(ans < 0) {
			cout << "-1\n";
		} else {
			cout << ans << '\n';
		}
	}
	return 0;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	2 ms	852 KB	Output is correct
6	Correct	3 ms	852 KB	Output is correct
7	Correct	3 ms	724 KB	Output is correct
8	Correct	3 ms	940 KB	Output is correct
9	Correct	3 ms	852 KB	Output is correct
10	Correct	3 ms	852 KB	Output is correct
11	Correct	3 ms	852 KB	Output is correct
12	Correct	3 ms	852 KB	Output is correct
13	Correct	68 ms	980 KB	Output is correct
14	Correct	69 ms	1036 KB	Output is correct
15	Correct	28 ms	980 KB	Output is correct
16	Correct	22 ms	852 KB	Output is correct
17	Correct	18 ms	852 KB	Output is correct
18	Correct	29 ms	976 KB	Output is correct
19	Correct	2 ms	852 KB	Output is correct
20	Correct	2 ms	852 KB	Output is correct
21	Correct	3 ms	928 KB	Output is correct
22	Correct	2 ms	852 KB	Output is correct
23	Correct	43 ms	852 KB	Output is correct
24	Correct	39 ms	852 KB	Output is correct
25	Correct	39 ms	944 KB	Output is correct
26	Correct	3 ms	852 KB	Output is correct
27	Correct	2 ms	852 KB	Output is correct
28	Correct	3 ms	852 KB	Output is correct
29	Correct	2 ms	852 KB	Output is correct
30	Correct	3 ms	852 KB	Output is correct
31	Correct	3 ms	852 KB	Output is correct
32	Correct	3 ms	852 KB	Output is correct
33	Correct	70 ms	1080 KB	Output is correct
34	Correct	63 ms	1080 KB	Output is correct
35	Correct	71 ms	1080 KB	Output is correct

Subtask #2
0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	3 ms	852 KB	Output is correct
3	Correct	5 ms	852 KB	Output is correct
4	Correct	3 ms	852 KB	Output is correct
5	Correct	195 ms	30376 KB	Output is correct
6	Correct	235 ms	20704 KB	Output is correct
7	Correct	209 ms	25084 KB	Output is correct
8	Correct	162 ms	25968 KB	Output is correct
9	Correct	159 ms	25992 KB	Output is correct
10	Correct	305 ms	30544 KB	Output is correct
11	Correct	309 ms	30448 KB	Output is correct
12	Correct	293 ms	30488 KB	Output is correct
13	Correct	293 ms	30524 KB	Output is correct
14	Correct	239 ms	30548 KB	Output is correct
15	Execution timed out	5058 ms	37660 KB	Time limit exceeded
16	Halted	0 ms	0 KB	-

Subtask #3
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	64 ms	980 KB	Output is correct
3	Correct	67 ms	1080 KB	Output is correct
4	Correct	63 ms	1076 KB	Output is correct
5	Execution timed out	5047 ms	35128 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #4
0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	2 ms	852 KB	Output is correct
6	Correct	3 ms	852 KB	Output is correct
7	Correct	3 ms	724 KB	Output is correct
8	Correct	3 ms	940 KB	Output is correct
9	Correct	3 ms	852 KB	Output is correct
10	Correct	3 ms	852 KB	Output is correct
11	Correct	3 ms	852 KB	Output is correct
12	Correct	3 ms	852 KB	Output is correct
13	Correct	68 ms	980 KB	Output is correct
14	Correct	69 ms	1036 KB	Output is correct
15	Correct	28 ms	980 KB	Output is correct
16	Correct	22 ms	852 KB	Output is correct
17	Correct	18 ms	852 KB	Output is correct
18	Correct	29 ms	976 KB	Output is correct
19	Correct	2 ms	852 KB	Output is correct
20	Correct	2 ms	852 KB	Output is correct
21	Correct	3 ms	928 KB	Output is correct
22	Correct	2 ms	852 KB	Output is correct
23	Correct	43 ms	852 KB	Output is correct
24	Correct	39 ms	852 KB	Output is correct
25	Correct	39 ms	944 KB	Output is correct
26	Correct	3 ms	852 KB	Output is correct
27	Correct	2 ms	852 KB	Output is correct
28	Correct	3 ms	852 KB	Output is correct
29	Correct	2 ms	852 KB	Output is correct
30	Correct	3 ms	852 KB	Output is correct
31	Correct	3 ms	852 KB	Output is correct
32	Correct	3 ms	852 KB	Output is correct
33	Correct	70 ms	1080 KB	Output is correct
34	Correct	63 ms	1080 KB	Output is correct
35	Correct	71 ms	1080 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	3 ms	852 KB	Output is correct
38	Correct	5 ms	852 KB	Output is correct
39	Correct	3 ms	852 KB	Output is correct
40	Correct	195 ms	30376 KB	Output is correct
41	Correct	235 ms	20704 KB	Output is correct
42	Correct	209 ms	25084 KB	Output is correct
43	Correct	162 ms	25968 KB	Output is correct
44	Correct	159 ms	25992 KB	Output is correct
45	Correct	305 ms	30544 KB	Output is correct
46	Correct	309 ms	30448 KB	Output is correct
47	Correct	293 ms	30488 KB	Output is correct
48	Correct	293 ms	30524 KB	Output is correct
49	Correct	239 ms	30548 KB	Output is correct
50	Execution timed out	5058 ms	37660 KB	Time limit exceeded
51	Halted	0 ms	0 KB	-

Submission #826895

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 0 / 28.0

Subtask #3 0 / 30.0

Subtask #4 0 / 32.0

Subtask #1
10.0 / 10.0

Subtask #2
0 / 28.0

Subtask #3
0 / 30.0

Subtask #4
0 / 32.0