oj.uz

Submission #925539

# Submission time Handle Problem Language Result Execution time Memory
925539 2024-02-12T01:34:42 Z NK_ Putovanje (COCI20_putovanje) C++17
110 / 110
 128 ms 28756 KB 
// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define pb push_back
#define f first
#define s second
#define mp make_pair

using ll = long long;
template<class T> using V = vector<T>;
using pi = pair<int,int>;
using vi = V<int>;
using vpi = V<pi>;

const int MOD = 1e9 + 7;
const int LG = 19;

int main() {
	cin.tie(0)->sync_with_stdio(0);

	int N; cin >> N;

	vi W(N - 1), MW(N - 1);
	V<vpi> adj(N); for(int i = 0; i < N - 1; i++) {
		int u, v; cin >> u >> v; --u, --v; 
		cin >> W[i] >> MW[i];
		adj[u].pb(mp(v, i));
		adj[v].pb(mp(u, i));
	}

	V<vi> up(N, vi(LG)); vi idx(N, -1), dep(N, 0);
	function<void(int, int)> gen = [&](int u, int p) {
		up[u][0] = p;

		for(int i = 1; i < LG; i++) up[u][i] = up[up[u][i-1]][i-1];

		for(auto& e : adj[u]) {
			int v, i; tie(v, i) = e; 
			if (v == p) continue;

			idx[v] = i; dep[v] = dep[u] + 1; 
			gen(v, u);
		}
	};

	gen(0, 0);

	auto jmp = [&](int u, int d) {
		for(int i = 0; i < LG; i++) if ((d >> i) & 1) u = up[u][i];
		return u;
	};

	auto lca = [&](int a, int b) {
		if (dep[a] < dep[b]) swap(a, b);
		
		a = jmp(a, dep[a] - dep[b]);
		if (a == b) return a;

		for(int i = LG - 1; i >= 0; i--) {
			if (up[a][i] != up[b][i]) {
				a = up[a][i], b = up[b][i];
			}
		}
		
		return up[a][0];
	};


	vi BAL(N);
	for(int i = 0; i + 1 < N; i++) {
		// path from i to i + 1
		int l = lca(i, i + 1);

		// cerr << i << " " << i + 1 << " ==> " << l << endl;
		BAL[i]++, BAL[i + 1]++;
		BAL[l] -= 2;
	}

	ll ans = 0;
	function<int(int, int)> dfs = [&](int u, int p) {
		int bal = 0;

		for(auto& e : adj[u]) {
			int v, i; tie(v, i) = e;
			if (v == p) continue;
			bal += dfs(v, u);
		}

		bal += BAL[u];

		// cerr << u << " => " << bal << endl;
		if (idx[u] != -1) {
			int i = idx[u];
			ans += min(W[i] * 1LL * bal, MW[i] + 0LL);
		}

		return bal;
	};

	dfs(0, -1);

	cout << ans << nl;

	exit(0-0);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 848 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 24144 KB Output is correct
2 Correct 105 ms 25968 KB Output is correct
3 Correct 121 ms 28756 KB Output is correct
4 Correct 128 ms 28232 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 97 ms 23632 KB Output is correct
7 Correct 56 ms 17488 KB Output is correct
8 Correct 113 ms 24260 KB Output is correct
9 Correct 60 ms 25168 KB Output is correct
10 Correct 56 ms 24400 KB Output is correct
11 Correct 72 ms 26824 KB Output is correct
12 Correct 64 ms 26724 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 848 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 103 ms 24144 KB Output is correct
11 Correct 105 ms 25968 KB Output is correct
12 Correct 121 ms 28756 KB Output is correct
13 Correct 128 ms 28232 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 97 ms 23632 KB Output is correct
16 Correct 56 ms 17488 KB Output is correct
17 Correct 113 ms 24260 KB Output is correct
18 Correct 60 ms 25168 KB Output is correct
19 Correct 56 ms 24400 KB Output is correct
20 Correct 72 ms 26824 KB Output is correct
21 Correct 64 ms 26724 KB Output is correct
22 Correct 85 ms 21584 KB Output is correct
23 Correct 67 ms 19028 KB Output is correct
24 Correct 76 ms 21076 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 29 ms 9820 KB Output is correct
27 Correct 66 ms 18240 KB Output is correct
28 Correct 51 ms 22328 KB Output is correct
29 Correct 62 ms 26960 KB Output is correct
30 Correct 78 ms 26520 KB Output is correct
31 Correct 1 ms 604 KB Output is correct