제출 #298770

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
298770		super_j6	Putovanje (COCI20_putovanje)	C++14	20 / 110	87 ms	18680 KiB

putovanje

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
using namespace std;
#define endl '\n'
#define ll long long
#define pi pair<int, int>
#define f first
#define s second

const int mxn = 200000;
int n;
int u[mxn], v[mxn], w[mxn], z[mxn];
int vis[mxn], par[mxn], rnk[mxn], p[mxn], dp[mxn];
vector<int> g[mxn];

int fnd(int x){
	return x == par[x] ? x : par[x] = fnd(par[x]);
}

void dfs(int c){
	vis[c] = 1, p[c] = par[c] = c;
	
	for(int i = c - 1; i <= c + 1; i += 2) if(i >= 0 && i < n && vis[i]){
		dp[p[fnd(i)]] -= 2, dp[c]++, dp[i]++;
	}
	
	for(int i : g[c]) if(!vis[c ^ u[i] ^ v[i]]){
		if(u[i] != c) swap(u[i], v[i]);
		dfs(v[i]);
		
		int x = fnd(c), y = fnd(v[i]);
		if(rnk[x] < rnk[y]) swap(x, y);
		rnk[x] += rnk[x] == rnk[y];
		par[y] = x, p[x] = c;
	}
}

ll dfs2(int c){
	ll ret = 0;
	for(int i : g[c]) if(u[i] == c){
		ret += dfs2(v[i]);
		
		dp[c] += dp[v[i]];
		ret += min(w[i] * dp[v[i]], z[i]);
	}
	return ret;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	cin >> n;
	
	for(int i = 0; i < n - 1; i++){
		cin >> u[i] >> v[i] >> w[i] >> z[i];
		g[--u[i]].push_back(i);
		g[--v[i]].push_back(i);
	}
	
	dfs(0);
	
	cout << dfs2(0) << endl;

	return 0;
}

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