제출 #637455

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
637455		vovamr	Putovanje (COCI20_putovanje)	C++17	110 / 110	134 ms	20240 KiB

putovanje

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

const int N = 2e5 + 10;
ve<int> gr[N];
int in[N], out[N];
const int lg = 18;
int up[N][lg];

int timer = 0;
inline void dfs(int v, int p) {
	in[v] = timer++; up[v][0] = p;
	for (int i = 1; i < lg; ++i) up[v][i] = up[up[v][i - 1]][i - 1];
	for (auto &to : gr[v]) if (to ^ p) dfs(to, v);
	out[v] = timer++;
}
inline bool anc(int a, int b) { return in[a] <= in[b] && out[b] <= out[a]; }
inline int lca(int a, int b) {
	if (anc(a, b)) return a;
	if (anc(b, a)) return b;
	for (int i = lg - 1; ~i; --i) {
		if (!anc(up[a][i], b)) {
			a = up[a][i];
		}
	} return up[a][0];
}

int s[N];
inline void add(int a, int b) {
	int l = lca(a, b);
	++s[a], ++s[b], ----s[l];
}
inline void dfs1(int v, int p) {
	for (auto &to : gr[v]) if (to ^ p) {
		dfs1(to, v);
		s[v] += s[to];
	}
}

inline void solve() {
	int n;
	cin >> n;
	ve<array<int,4>> e(n - 1);
	for (int i = 1; i < n; ++i) {
		int v, u, a, b;
		cin >> v >> u >> a >> b;
		e[i - 1] = {--v, --u, a, b};

		gr[v].pb(u), gr[u].pb(v);
	}

	dfs(0, 0);
	for (int i = 0; i + 1 < n; ++i) add(i, i + 1);
	dfs1(0, 0);

	ll ans = 0;
	for (auto &[v, u, a, b] : e) {
		if (in[v] < in[u]) swap(v, u);
		ans += min(a * 1ll * s[v], b * 1ll);
	}

	cout << ans;
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

• Subtask 1: 20 / 20
• Subtask 2: 25 / 25
• Subtask 3: 65 / 65