oj.uz

Submission #653713

# Submission time Handle Problem Language Result Execution time Memory
653713 2022-10-27T19:11:44 Z Koful123 Putovanje (COCI20_putovanje) C++17
0 / 110
 118 ms 41320 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define pb push_back
#define ff first
#define ss second
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

const int N = 2e5 + 5;
int n;
vector<int> cnt(N),sum(N),vis(N),depth(N);
vector<pair<int,int>> adj[N],val(N);
int par[N][20];

void dfs(int node,int p){
	for(auto[go,who] : adj[node]){
		if(go == p) continue;
		dfs(go,node);
	}
	for(auto[go,who] : adj[node]){
		if(go == p) continue;
		cnt[who] = sum[go],sum[node] += sum[go];
	}
	sum[node] += (node > 1), sum[node] += (node < n);
}

void find(int node,int p){
	par[node][0] = p,depth[node] = depth[p] + 1;
	for(auto[go,who] : adj[node]){
		if(go == p) continue;
		find(go,node);
	}
}

int lca(int x,int y){
	if(depth[x] < depth[y]) swap(x,y);
	int d = depth[x] - depth[y];
	for(int i=19;i>=0;i--){
		if(d & 1ll<<i){
			x = par[x][i];
		}
	}
	if(x == y) return x;
	for(int i=19;i>=0;i--){
		if(par[x][i] != par[y][i]){
			x = par[x][i],y = par[y][i];
		}
	}
	return par[x][0];
}

void solve(){

	cin >> n;
	for(int i=1;i<n;i++){
		int a,b; cin >> a >> b >> val[i].ff >> val[i].ss;
		adj[a].pb({b,i});
		adj[b].pb({a,i});
	}

	find(1,0);
	for(int i=1;i<20;i++){
		for(int j=1;j<=n;j++){
			par[j][i] = par[par[j][j-1]][j-1];
		}
	}

	for(int i=1;i<n;i++){
		--sum[lca(i,i+1)];
	}

	dfs(1,0);
	
	int ans = 0;
	for(int i=1;i<n;i++){
		ans += min(cnt[i] * val[i].ff,val[i].ss);
	}

	cout << ans << endl;
}	

signed main(){

	ios::sync_with_stdio(0);
	cin.tie(0);

	int t = 1;
//	cin >> t;

	while(t--)
		solve();

	return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Incorrect 10 ms 14676 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 105 ms 35640 KB Output is correct
2 Correct 109 ms 38620 KB Output is correct
3 Correct 105 ms 41320 KB Output is correct
4 Correct 118 ms 41292 KB Output is correct
5 Correct 7 ms 14548 KB Output is correct
6 Correct 108 ms 36836 KB Output is correct
7 Incorrect 72 ms 30692 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14420 KB Output is correct
2 Incorrect 10 ms 14676 KB Output isn't correct
3 Halted 0 ms 0 KB -