oj.uz

Submission #126475

# Submission time Handle Problem Language Result Execution time Memory
126475 2019-07-07T20:04:54 Z TadijaSebez Designated Cities (JOI19_designated_cities) C++11
100 / 100
 641 ms 50864 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int N=200050;
vector<pair<int,int>> E[N];
ll sum[N],all_up;
int up[N],down[N];
ll dep[N];
int lid[N],rid[N],tid,nod[N],par[N],my[N],rt,n;
ll mxd[N],sol[N];
void DFS(int u, int p)
{
	for(auto e:E[u])
	{
		int v=e.first,w=e.second;
		if(v==p) up[u]=w,all_up+=w;
	}
	if(p) sum[u]=sum[p]+down[u]-up[u];
	mxd[u]=0;
	for(auto e:E[u])
	{
		int v=e.first,w=e.second;
		if(v!=p)
		{
			down[v]=w;
			dep[v]=dep[u]+w;
			DFS(v,u);
			mxd[u]=max(mxd[u],mxd[v]+w);
		}
	}
}
void Solve(int u, int p, ll hi)
{
	ll fir=0,sec=0;
	int t=-1;
	sol[u]=max(hi,mxd[u])+sum[u];
	for(auto e:E[u]) if(e.first!=p)
	{
		int v=e.first,w=e.second;
		if(fir<mxd[v]+w) sec=fir,fir=mxd[v]+w,t=v;
		else if(sec<mxd[v]+w) sec=mxd[v]+w;
	}
	for(auto e:E[u]) if(e.first!=p)
	{
		int v=e.first,w=e.second;
		ll best=hi;
		if(t==v) best=max(best,sec);
		else best=max(best,fir);
		Solve(v,u,best+up[v]);
	}
}
void DFS2(int u, int p)
{
	lid[u]=++tid;
	nod[tid]=u;
	par[u]=p;
	my[u]=u;
	for(auto e:E[u]) if(e.first!=p)
	{
		int v=e.first;
		dep[v]=dep[u]+e.second;
		DFS2(v,u);
		if(dep[my[u]]<dep[my[v]]) my[u]=my[v];
	}
	rid[u]=tid;
}
const int M=2*N;
int ls[M],rs[M],tsz,root,id[M];
ll mx[M],lzy[M];
void Build(int &c, int ss, int se)
{
	c=++tsz;
	if(ss==se){ mx[c]=dep[nod[ss]];id[c]=nod[ss];return;}
	int mid=ss+se>>1;
	Build(ls[c],ss,mid);
	Build(rs[c],mid+1,se);
	mx[c]=max(mx[ls[c]],mx[rs[c]]);
	if(mx[c]==mx[ls[c]]) id[c]=id[ls[c]];
	else id[c]=id[rs[c]];
	//printf("%i %lld %i\n",c,mx[c],id[c]);
}
void Add(int c, int ss, int se, int qs, int qe, ll x)
{
	if(qs>qe || qs>se || ss>qe) return;
	if(qs<=ss && qe>=se){ mx[c]+=x;lzy[c]+=x;return;}
	int mid=ss+se>>1;
	Add(ls[c],ss,mid,qs,qe,x);
	Add(rs[c],mid+1,se,qs,qe,x);
	mx[c]=max(mx[ls[c]],mx[rs[c]]);
	if(mx[c]==mx[ls[c]]) id[c]=id[ls[c]];
	else id[c]=id[rs[c]];
	mx[c]+=lzy[c];
}
bool was[N];
ll ans[N],cur;
void Add(int x)
{
	for(;!was[x];x=par[x])
	{
		was[x]=1;
		Add(root,1,n,lid[x],rid[x],-dep[x]+dep[par[x]]);
		cur+=dep[x]-dep[par[x]];
	}
}
int main()
{
	int q,u,v,c,d;
	scanf("%i",&n);
	ll z=0;
	for(int i=1;i<n;i++)
	{
		scanf("%i %i %i %i",&u,&v,&c,&d);
		E[u].pb({v,c});
		E[v].pb({u,d});
		z+=c;
		z+=d;
	}
	DFS(1,0);
	rt=1;
	for(int i=1;i<=n;i++)
	{
		sum[i]+=all_up;
		if(sum[i]>sum[rt]) rt=i;
	}
	ans[1]=sum[rt];
	Solve(1,0,0);
	for(int i=1;i<=n;i++) if(sol[i]>sol[rt]) rt=i;
	//ans[2]=sol[rt];
	for(int i=1;i<=n;i++) dep[i]=0;
	DFS2(rt,0);
	Build(root,1,n);
	cur=sum[rt];
	//printf("cur:%lld\n",cur);
	/*int fir=0,sec=0;
	for(auto e:E[rt])
	{
		v=e.first;
		if(dep[my[v]]>dep[fir]) sec=fir,fir=my[v];
		else if(dep[my[v]]>dep[sec]) sec=my[v];
	}
	Add(fir);
	if(sec) Add(sec);*/
	was[rt]=1;
	for(int i=2;i<=n;i++)
	{
		//printf("%i: %i\n",i,id[root]);
		if(id[root]!=rt) Add(id[root]);
		ans[i]=max(ans[i],cur);
	}
	scanf("%i",&q);
	while(q--)
	{
		int x;
		scanf("%i",&x);
		printf("%lld\n",z-ans[x]);
	}
	return 0;
}

Compilation message

designated_cities.cpp: In function 'void Solve(int, int, long long int)':
designated_cities.cpp:46:17: warning: unused variable 'w' [-Wunused-variable]
   int v=e.first,w=e.second;
                 ^
designated_cities.cpp: In function 'void Build(int&, int, int)':
designated_cities.cpp:75:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
designated_cities.cpp: In function 'void Add(int, int, int, int, int, long long int)':
designated_cities.cpp:87:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=ss+se>>1;
          ~~^~~
designated_cities.cpp: In function 'int main()':
designated_cities.cpp:109:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&n);
  ~~~~~^~~~~~~~~
designated_cities.cpp:113:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%i %i %i %i",&u,&v,&c,&d);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
designated_cities.cpp:151:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i",&q);
  ~~~~~^~~~~~~~~
designated_cities.cpp:155:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%i",&x);
   ~~~~~^~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 7 ms 5112 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 450 ms 36924 KB Output is correct
3 Correct 471 ms 48436 KB Output is correct
4 Correct 390 ms 36884 KB Output is correct
5 Correct 456 ms 36848 KB Output is correct
6 Correct 641 ms 38648 KB Output is correct
7 Correct 469 ms 37096 KB Output is correct
8 Correct 517 ms 48988 KB Output is correct
9 Correct 433 ms 37476 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 546 ms 36812 KB Output is correct
3 Correct 487 ms 50712 KB Output is correct
4 Correct 428 ms 36856 KB Output is correct
5 Correct 520 ms 36916 KB Output is correct
6 Correct 627 ms 38860 KB Output is correct
7 Correct 416 ms 37228 KB Output is correct
8 Correct 502 ms 44908 KB Output is correct
9 Correct 490 ms 37420 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 7 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 9 ms 5496 KB Output is correct
14 Correct 8 ms 5496 KB Output is correct
15 Correct 8 ms 5496 KB Output is correct
16 Correct 9 ms 5624 KB Output is correct
17 Correct 9 ms 5496 KB Output is correct
18 Correct 9 ms 5496 KB Output is correct
19 Correct 9 ms 5496 KB Output is correct
20 Correct 9 ms 5496 KB Output is correct
21 Correct 9 ms 5496 KB Output is correct
22 Correct 9 ms 5496 KB Output is correct
23 Correct 9 ms 5496 KB Output is correct
24 Correct 9 ms 5496 KB Output is correct
25 Correct 9 ms 5496 KB Output is correct
26 Correct 10 ms 5496 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 450 ms 36924 KB Output is correct
3 Correct 471 ms 48436 KB Output is correct
4 Correct 390 ms 36884 KB Output is correct
5 Correct 456 ms 36848 KB Output is correct
6 Correct 641 ms 38648 KB Output is correct
7 Correct 469 ms 37096 KB Output is correct
8 Correct 517 ms 48988 KB Output is correct
9 Correct 433 ms 37476 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 546 ms 36812 KB Output is correct
12 Correct 487 ms 50712 KB Output is correct
13 Correct 428 ms 36856 KB Output is correct
14 Correct 520 ms 36916 KB Output is correct
15 Correct 627 ms 38860 KB Output is correct
16 Correct 416 ms 37228 KB Output is correct
17 Correct 502 ms 44908 KB Output is correct
18 Correct 490 ms 37420 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 483 ms 36924 KB Output is correct
21 Correct 490 ms 50864 KB Output is correct
22 Correct 439 ms 36856 KB Output is correct
23 Correct 622 ms 37012 KB Output is correct
24 Correct 620 ms 36860 KB Output is correct
25 Correct 473 ms 36856 KB Output is correct
26 Correct 464 ms 36932 KB Output is correct
27 Correct 488 ms 36728 KB Output is correct
28 Correct 495 ms 38452 KB Output is correct
29 Correct 464 ms 36848 KB Output is correct
30 Correct 425 ms 37012 KB Output is correct
31 Correct 450 ms 36972 KB Output is correct
32 Correct 504 ms 45220 KB Output is correct
33 Correct 507 ms 37480 KB Output is correct

Subtask #6
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 7 ms 5112 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 5112 KB Output is correct
11 Correct 7 ms 5112 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 450 ms 36924 KB Output is correct
14 Correct 471 ms 48436 KB Output is correct
15 Correct 390 ms 36884 KB Output is correct
16 Correct 456 ms 36848 KB Output is correct
17 Correct 641 ms 38648 KB Output is correct
18 Correct 469 ms 37096 KB Output is correct
19 Correct 517 ms 48988 KB Output is correct
20 Correct 433 ms 37476 KB Output is correct
21 Correct 6 ms 5112 KB Output is correct
22 Correct 546 ms 36812 KB Output is correct
23 Correct 487 ms 50712 KB Output is correct
24 Correct 428 ms 36856 KB Output is correct
25 Correct 520 ms 36916 KB Output is correct
26 Correct 627 ms 38860 KB Output is correct
27 Correct 416 ms 37228 KB Output is correct
28 Correct 502 ms 44908 KB Output is correct
29 Correct 490 ms 37420 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 9 ms 5496 KB Output is correct
32 Correct 8 ms 5496 KB Output is correct
33 Correct 8 ms 5496 KB Output is correct
34 Correct 9 ms 5624 KB Output is correct
35 Correct 9 ms 5496 KB Output is correct
36 Correct 9 ms 5496 KB Output is correct
37 Correct 9 ms 5496 KB Output is correct
38 Correct 9 ms 5496 KB Output is correct
39 Correct 9 ms 5496 KB Output is correct
40 Correct 9 ms 5496 KB Output is correct
41 Correct 9 ms 5496 KB Output is correct
42 Correct 9 ms 5496 KB Output is correct
43 Correct 9 ms 5496 KB Output is correct
44 Correct 10 ms 5496 KB Output is correct
45 Correct 6 ms 5112 KB Output is correct
46 Correct 483 ms 36924 KB Output is correct
47 Correct 490 ms 50864 KB Output is correct
48 Correct 439 ms 36856 KB Output is correct
49 Correct 622 ms 37012 KB Output is correct
50 Correct 620 ms 36860 KB Output is correct
51 Correct 473 ms 36856 KB Output is correct
52 Correct 464 ms 36932 KB Output is correct
53 Correct 488 ms 36728 KB Output is correct
54 Correct 495 ms 38452 KB Output is correct
55 Correct 464 ms 36848 KB Output is correct
56 Correct 425 ms 37012 KB Output is correct
57 Correct 450 ms 36972 KB Output is correct
58 Correct 504 ms 45220 KB Output is correct
59 Correct 507 ms 37480 KB Output is correct
60 Correct 6 ms 5112 KB Output is correct
61 Correct 549 ms 38336 KB Output is correct
62 Correct 542 ms 48928 KB Output is correct
63 Correct 500 ms 38264 KB Output is correct
64 Correct 545 ms 38256 KB Output is correct
65 Correct 527 ms 38036 KB Output is correct
66 Correct 518 ms 38264 KB Output is correct
67 Correct 516 ms 38108 KB Output is correct
68 Correct 558 ms 38256 KB Output is correct
69 Correct 575 ms 39928 KB Output is correct
70 Correct 529 ms 38156 KB Output is correct
71 Correct 514 ms 38636 KB Output is correct
72 Correct 551 ms 39020 KB Output is correct
73 Correct 568 ms 45788 KB Output is correct
74 Correct 468 ms 40312 KB Output is correct