제출 #124733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
124733		vex	Designated Cities (JOI19_designated_cities)	C++14	7 / 100	301 ms	31480 KiB

designated_cities

#include <bits/stdc++.h>
#define maxn    200005
#define INF (long long)1e18
#define pii pair<int,int>
#define sus first
#define w second
using namespace std;
 
/*** 20:50***/
 
int n;
vector<pii>adj[maxn];
long long dp[maxn];
 
long long down[maxn],up[maxn];
void dfs(int v,int p)
{
	down[v]=0LL;
	for(auto x:adj[v])
	{
		if(x.sus!=p)
		{
			down[v]+=x.w;
			dfs(x.sus,v);
			down[v]+=down[x.sus];
		}
	}
}
void dfs2(int v,int p,int tez)
{
	up[v]=0LL;	
	for(auto x:adj[v])
	{
		if(x.sus==p)
		{
			up[v]+=up[p];
			up[v]+=x.w;
			up[v]+=down[p]-tez-down[v];
		}
	}
	for(auto x:adj[v])
	{
		if(x.sus!=p)dfs2(x.sus,v,x.w);
	}
}
 
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	
	cin>>n;
	long long SUM=0LL;
	for(int i=1;i<n;i++)
	{
		int a,b,c,d;
		cin>>a>>b>>c>>d;
		
		adj[a].push_back({b,c});
		adj[b].push_back({a,d});
		
		SUM+=c+d;
	}
	
	dfs(1,1);
	dfs2(1,1,0);
	
	dp[1]=INF;
	for(int i=1;i<=n;i++)
	{
		dp[1]=min(dp[1],up[i]+down[i]);
	}
	
	
	
	//for(int i=1;i<=n;i++)cout<<i<<": "<<up[i]<<" "<<down[i]<<endl;
	
	
	int q;
	cin>>q;
	while(q>0)
	{
		int e;
		cin>>e;
		cout<<dp[e]<<endl;
		q--;
	}
	
	return 0;
}

• Subtask 1: 0 / 6
• Subtask 2: 7 / 7
• Subtask 3: 0 / 9
• Subtask 4: 0 / 17
• Subtask 5: 0 / 17
• Subtask 6: 0 / 44