Submission #223249

#	Time	Username	Problem	Language	Result	Execution time	Memory
223249		jamielim	Putovanje (COCI20_putovanje)	C++14	110 / 110	484 ms	46584 KiB

putovanje

#include <bits/stdc++.h>
using namespace std;

#define mp make_pair
const int MAXN=200005;
int n;
vector<int> adj[MAXN];
pair<pair<int,int>,pair<long long,long long> > edge[MAXN];

int sub[MAXN];
int depth[MAXN];
int heavy[MAXN];
int pos[MAXN];
int head[MAXN];
int par[MAXN][20];
int cur=1;

struct node{
	int s,e,m;long long v,lazy;
	node *l,*r;
	node(int S,int E){
		s=S;e=E;m=(s+e)/2;v=lazy=0;
		if(s!=e){
			l=new node(s,m);
			r=new node(m+1,e);
		}
	}
	void laze(){
		if(s==e){v+=lazy;lazy=0;return;}
		v+=lazy;
		l->lazy+=lazy;r->lazy+=lazy;
		lazy=0;return;
	}
	void upd(int x,int y){
		//printf("u %d %d\n",x,y);
		if(x>y)return;
		if((s==x&&e==y)||s==e){
			lazy++;laze();return;
		}
		if(y<=m)l->upd(x,y);
		else if(x>m)r->upd(x,y);
		else{l->upd(x,m);r->upd(m+1,y);}
		laze();
		v=l->v+r->v;
	}
	long long qry(int x,int y){
		//printf("q %d %d\n",x,y);
		if(x>y)return 0;
		laze();
		if(s==x&&e==y)return v;
		if(y<=m)return l->qry(x,y);
		if(x>m)return r->qry(x,y);
		return l->qry(x,m)+r->qry(m+1,y);
	}
}*root;

void dfs(int x,int p){
	sub[x]=1;par[x][0]=p;int maxc=0;
	for(int i=0;i<(int)adj[x].size();i++){
		if(adj[x][i]!=p){
			depth[adj[x][i]]=depth[x]+1;
			dfs(adj[x][i],x);
			sub[x]+=sub[adj[x][i]];
			if(sub[adj[x][i]]>maxc){maxc=sub[adj[x][i]];heavy[x]=adj[x][i];}
		}
	}
}
void dcmp(int x,int h){
	head[x]=h;pos[x]=cur++;
	if(heavy[x]!=-1)dcmp(heavy[x],h);
	for(int i=0;i<(int)adj[x].size();i++){
		if(heavy[x]==adj[x][i])continue;
		if(par[x][0]==adj[x][i])continue;
		dcmp(adj[x][i],adj[x][i]);
	}
}
void upd(int a,int b){
	//printf("%d %d\n",a,b);
	if(depth[a]>depth[b])swap(a,b);
	for(;head[a]!=head[b];b=par[head[b]][0]){
		if(depth[head[a]]>depth[head[b]])swap(a,b);
		root->upd(pos[head[b]],pos[b]);
	}
	if(depth[a]>depth[b])swap(a,b);
	root->upd(pos[a]+1,pos[b]);
}
long long qry(int a,int b){
	long long res=0;
	if(depth[a]>depth[b])swap(a,b);
	for(;head[a]!=head[b];b=par[head[b]][0]){
		if(depth[head[a]]>depth[head[b]])swap(a,b);
		res+=root->qry(pos[head[b]],pos[b]);
	}
	if(depth[a]>depth[b])swap(a,b);
	res+=root->qry(pos[a]+1,pos[b]);
	return res;
}
int lca(int a,int b){
	if(a==b)return a;
	if(depth[a]<depth[b])swap(a,b);
	for(int i=19;i>=0;i--){
		if(par[a][i]!=-1&&depth[par[a][i]]>=depth[b])a=par[a][i];
	}
	if(a==b)return a;
	for(int i=19;i>=0;i--){
		if(par[a][i]!=par[b][i]){a=par[a][i];b=par[b][i];}
	}
	return par[a][0];
}

int main(){
	scanf("%d",&n);
	int a,b,c1,c2;
	for(int i=0;i<n-1;i++){
		scanf("%d%d%d%d",&a,&b,&c1,&c2);a--;b--;
		adj[a].push_back(b);adj[b].push_back(a);
		edge[i]=mp(mp(a,b),mp(c1,c2));
	}
	root=new node(0,n);
	memset(heavy,-1,sizeof(heavy));
	memset(par,-1,sizeof(par));
	dfs(0,-1);
	dcmp(0,0);
	for (int i =1; i <20; i ++) {
		for (int j =0; j < n ; j ++) {
			if( par[ j ][i-1]== -1) par[ j ][ i ]= -1;
			else par[ j ][ i ]= par[ par[ j ][i-1]][i-1];
		}
	}
	//for(int i=0;i<n;i++)printf("%d ",pos[i]);printf("\n");
	for(int i=0;i<n-1;i++){
		upd(i,lca(i,i+1));
		upd(i+1,lca(i,i+1));
	}
	long long ans=0;
	for(int i=0;i<n-1;i++){
		int a=edge[i].first.first,b=edge[i].first.second;
		long long cur=qry(a,b);
		//printf("%d %d %lld\n",a,b,cur);
		ans+=min(cur*edge[i].second.first,edge[i].second.second);
	}
	printf("%lld",ans);
}

Compilation message (stderr)

putovanje.cpp: In function 'int main()':
putovanje.cpp:112:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
putovanje.cpp:115:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d",&a,&b,&c1,&c2);a--;b--;
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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