oj.uz

Submission #799687

# Submission time Handle Problem Language Result Execution time Memory
799687 2023-07-31T20:12:48 Z vjudge1 Putovanje (COCI20_putovanje) C++17
110 / 110
 414 ms 93816 KB 
#include <bits/stdc++.h>

using namespace std;

#define endl "\n"
#define int long long
#define all(x) (x).begin(), (x).end()
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define rep(i,a,b) for(int i=(int)(a); i < (int)(b); i++)

typedef long long ll;

using iiii = array<int, 4>;

const int oo = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 2e5+2;

vector<vector<int>> g(MAXN);
map<pair<int,int>, int> cost_each, cost_free;
vector<int> tin(2*MAXN), tout(2*MAXN);
vector<vector<int>> up(MAXN, vector<int>(20));
int TIMER = 0;
vector<int> ans(MAXN, 0);
vector<int> cost_each_vertex(MAXN), cost_free_vertex(MAXN);
int res = 0;

void dfs(int u=0, int p=0) {
	tin[u] = TIMER++;

	cost_each_vertex[u] = cost_each[{u, p}];
	cost_free_vertex[u] = cost_free[{u, p}];

	up[u][0] = p;
	for(int i = 1; i < 20; i++)
		up[u][i] = up[up[u][i-1]][i-1];
	
	for(auto v: g[u]) if(v != p)
		dfs(v, u);

	tout[u] = TIMER++;

	/*
	cout << "---------- db -----------\n";
	cout << "u = " << u << endl;
	cout << "tin[u] = " << tin[u] << endl;
	cout << "set " << query(tin[u], tin[u]) << endl;
	cout << "tout[u] = " << tout[u] << endl;
	cout << "set " << query(tout[u], tout[u]) << endl;
	*/
}

int is_ancestor(int u, int v) {
	return tin[u] <= tin[v] && tout[u] >= tout[v];
}

int lca(int u, int v) {
	
	if(is_ancestor(u, v)) {
		ans[u]--;
		ans[v]++;
		return u;
	}

	if(is_ancestor(v, u)) {
		ans[v]--;
		ans[u]++;
		return v;
	}

	ans[u]++;
	ans[v]++;
	for(int i = 19; i >= 0; i--) {
		if(!is_ancestor(up[u][i], v))
			u = up[u][i];
	}
	ans[up[u][0]] -= 2;
	return up[u][0];
}

void compute_ans(int u=1, int p=0) {
	for(auto v: g[u]) if(v != p) {
		compute_ans(v, u);
		ans[u] += ans[v];
	}
	res += min(ans[u]*cost_each_vertex[u], cost_free_vertex[u]);
}

void solve() {
	int n;
	cin >> n;
	vector<iiii> edges(n-1);

	for(auto& [a, b, c, d]: edges) {
		cin >> a >> b >> c >> d;
		g[a].push_back(b);
		g[b].push_back(a);
		cost_each[{a, b}] = c;
		cost_each[{b, a}] = c;
		cost_free[{a, b}] = d;
		cost_free[{b, a}] = d;
	}

	g[0].push_back(1);
	dfs();

	for(int i = 1; i+1 <= n; i++) {
		lca(i, i+1);
	}
	compute_ans();
	cout << res << '\n';
}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 55068 KB Output is correct
2 Correct 28 ms 55616 KB Output is correct
3 Correct 28 ms 55764 KB Output is correct
4 Correct 29 ms 55724 KB Output is correct
5 Correct 28 ms 55756 KB Output is correct
6 Correct 25 ms 55124 KB Output is correct
7 Correct 25 ms 55244 KB Output is correct
8 Correct 27 ms 55544 KB Output is correct
9 Correct 28 ms 55688 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 89548 KB Output is correct
2 Correct 359 ms 91168 KB Output is correct
3 Correct 389 ms 93816 KB Output is correct
4 Correct 400 ms 92944 KB Output is correct
5 Correct 27 ms 55252 KB Output is correct
6 Correct 316 ms 86976 KB Output is correct
7 Correct 223 ms 78308 KB Output is correct
8 Correct 340 ms 87776 KB Output is correct
9 Correct 179 ms 89432 KB Output is correct
10 Correct 185 ms 88452 KB Output is correct
11 Correct 188 ms 91128 KB Output is correct
12 Correct 190 ms 91044 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 55068 KB Output is correct
2 Correct 28 ms 55616 KB Output is correct
3 Correct 28 ms 55764 KB Output is correct
4 Correct 29 ms 55724 KB Output is correct
5 Correct 28 ms 55756 KB Output is correct
6 Correct 25 ms 55124 KB Output is correct
7 Correct 25 ms 55244 KB Output is correct
8 Correct 27 ms 55544 KB Output is correct
9 Correct 28 ms 55688 KB Output is correct
10 Correct 319 ms 89548 KB Output is correct
11 Correct 359 ms 91168 KB Output is correct
12 Correct 389 ms 93816 KB Output is correct
13 Correct 400 ms 92944 KB Output is correct
14 Correct 27 ms 55252 KB Output is correct
15 Correct 316 ms 86976 KB Output is correct
16 Correct 223 ms 78308 KB Output is correct
17 Correct 340 ms 87776 KB Output is correct
18 Correct 179 ms 89432 KB Output is correct
19 Correct 185 ms 88452 KB Output is correct
20 Correct 188 ms 91128 KB Output is correct
21 Correct 190 ms 91044 KB Output is correct
22 Correct 414 ms 87976 KB Output is correct
23 Correct 340 ms 84076 KB Output is correct
24 Correct 406 ms 87404 KB Output is correct
25 Correct 28 ms 55428 KB Output is correct
26 Correct 163 ms 69916 KB Output is correct
27 Correct 370 ms 82788 KB Output is correct
28 Correct 159 ms 87260 KB Output is correct
29 Correct 192 ms 93648 KB Output is correct
30 Correct 188 ms 93164 KB Output is correct
31 Correct 29 ms 55628 KB Output is correct