제출 #500167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500167		inksamurai	Putovanje (COCI20_putovanje)	C++17	20 / 110	1087 ms	14248 KiB

putovanje

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;


struct treelca{
	int n;
	int timer=0;
	vec(vi) adj;
	vi tin,tout,tour,tourid;
	vi segtree;
	vi depth;
	treelca(int m,int root,vec(vi) neadj){
		init(m,root,neadj);
	}
	void init(int m,int root,vec(vi) neadj){
		n=m;
		tin.clear();
		tout.clear();
		tour.clear();
		tourid.clear();
		depth.clear();
		tin.resize(n,0);
		tout.resize(n,0);
		tourid.resize(n,0);
		depth.resize(n,0);
		adj=neadj;
		dfs(root,-1);
		segtree.resize(4*sz(tour));
		build(1,0,sz(tour)-1);
	}
	void dfs(int v,int par){
		tour.pb(v);
		tourid[v]=sz(tour)-1;
		tin[v]=timer++;
		for(auto u : adj[v]){
			if(u==par) continue;
			depth[u]=depth[v]+1;
			dfs(u,v);
			tour.pb(v);
		}
		tout[v]=timer++;
	}
	void build(int node,int l,int r){
		if(l==r){
			segtree[node]=tour[l];
		}else{
			int m=(l+r)>>1;
			build(node*2,l,m);
			build(node*2+1,m+1,r);
			segtree[node]=(tin[segtree[node*2]]<tin[segtree[node*2+1]]?segtree[node*2]:segtree[node*2+1]);
		}
	}
	int query(int node,int l,int r,int _l,int _r){
		if(l>_r or r<_l) return -1;
		if(l>=_l and r<=_r) return segtree[node];
		int m=(l+r)>>1;
		int vl=query(node*2,l,m,_l,_r);
		int vr=query(node*2+1,m+1,r,_l,_r);
		if(min(vl,vr)==-1) return max(vl,vr);
		return (tin[vl]<tin[vr]?vl:vr);
	}
	int ancestor(int from,int to){
		int tinfrom=tin[from],tinto=tin[to];
		if(tinfrom>tinto) swap(tinfrom,tinto);
		return query(1,0,sz(tour)-1,tinfrom,tinto);
	}
	int dist(int u,int v){
		return depth[u]+depth[v]-depth[ancestor(u,v)]*2;
	}
};

int main(){
_3qplfh5;
	int n;
	cin>>n;
	vec(vec(pii)) adj(n);
	vec(pii) edgecost(n);
	vec(vi) gadj(n);
	rep(i,n-1){
		int u,v,c1,c2;
		cin>>u>>v>>c1>>c2;
		u--,v--;
		adj[u].pb({v,i});
		adj[v].pb({u,i});
		edgecost[i]={c1,c2};
		gadj[u].pb(v);
		gadj[v].pb(u);
	}
	int need;
	vi cnt(n-1,0);
	auto dfs=[&](auto self,int v,int par)->bool{
		if(v==need){
			return true;
		}
		bool gok=0;
		for(auto e : adj[v]){
			int u=e.fi,id=e.se;
			if(u!=par){
				bool pok=self(self,u,v);
				if(pok){
					cnt[id]++;
				}
				gok=gok or pok;
			}
		}
		return gok;
	};
	rep(v,n){
		need=v+1;
		dfs(dfs,v,-1);
	}
	treelca lca(n,0,gadj);
	vi psum(n,0);
	crep(v,1,n){
		int up=lca.ancestor(v,v-1);
		psum[up]-=2;
		psum[v]++;
		psum[v-1]++;
	}
	vi nowcnt(n-1,0),rbe(n,0);
	auto magicaldfs=[&](auto self,int v,int par)->void{
		rbe[v]=0;
		for(auto p : adj[v]){
			int u=p.fi,id=p.se;
			if(u!=par){
				self(self,u,v);
				nowcnt[id]=rbe[u];
				rbe[v]+=rbe[u];
			}
		}
		rbe[v]+=psum[v];
		// cout<<v<<" "<<psum[v]<<"\n";
	};
	magicaldfs(magicaldfs,0,-1);
	rep(i,n-1){
		if(nowcnt[i]!=cnt[i]){
			cout<<i<<" "<<nowcnt[i]<<" "<<cnt[i]<<"\n";
			assert(false);
		}
	}
	ll ans=0;
	rep(i,n-1){
		ans+=min(edgecost[i].fi*cnt[i],edgecost[i].se);
	}
	cout<<ans<<"\n";
//	
	return 0;
}

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