oj.uz

Submission #79842

# Submission time Handle Problem Language Result Execution time Memory
79842 2018-10-16T18:00:02 Z Pajaraja Hard route (IZhO17_road) C++17
52 / 100
 2000 ms 78108 KB 
#include <bits/stdc++.h>
#define MAXN 500007
using namespace std;
vector<int> g[MAXN];
int b,mb,u,v;
long long pot,cnt,d[MAXN],k[MAXN],ds[2][MAXN];
void dfsD(int s,int f,int di)
{
	d[s]=di;
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) dfsD(g[s][i],s,di+1);
}
void dfsd(int s,int f,int ka,int di)
{
	ds[ka][s]=di;
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) dfsD(g[s][i],s,di+1);
}
int dfsp(int s,int f)
{
	int mx=0;
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) mx=max(mx,dfsp(g[s][i],s));
	d[s]=mx+1;
	if(b==s) d[s]=-MAXN;
	return d[s];
}
void calc(int s,int f,long long mx,long long du)
{
	if(s!=f && g[s].size()==1)
	{
		if(s!=mb && du*mx==pot) cnt++;
		if(s!=mb && du*mx>pot) {pot=du*mx; cnt=1;}
		return;
	}
	int mxi=0;
	long long mx1=0,mx2=0;
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]>mx1) {mx1=d[g[s][i]]; mxi=i;}
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(i!=mxi) mx2=max(mx2,(long long)d[g[s][i]]);
	calc(g[s][mxi],s,max(mx,mx2),du+1);
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f && i!=mxi) calc(g[s][i],s,max(mx,mx1),du+1);
}
inline void dfs(int s,int f,long long du,int ka)
{
	if(s==v || s==u) {d[s]=-MAXN; return;}
	if(g[s].size()==1 && s!=f) {k[s]=1; d[s]=1; return;}
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) dfs(g[s][i],s,du+1,ka);
	int mxi=0;
	long long mx1=0,mx2=0;
	k[s]=0;
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]>mx1) {mx1=d[g[s][i]]; mxi=i;}
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]==mx1) k[s]+=k[g[s][i]];
	for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(i!=mxi) mx2=max(mx2,(long long)d[g[s][i]]);
	d[s]=mx1+1;
	long long tc=0;
	if(mx1==mx2)
	{
		tc=k[s]*k[s];
		for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]==mx1) tc-=k[g[s][i]]*k[g[s][i]];
		tc/=2;
	}
	else
	{
		for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]==mx2) tc+=k[g[s][i]];
		tc*=k[s];
	}
	if(mx2==0 || (ka==1 && ds[0][s]==ds[1][s])) return;
	if((mx1+mx2)*du>pot) {pot=(mx1+mx2)*du; cnt=0;}
	if((mx1+mx2)*du==pot) cnt+=tc;
}
int main()
{
	int n;
	u=1; v=1;
	scanf("%d",&n);
	for(int i=0;i<n-1;i++)
	{
		int t1,t2;
		scanf("%d%d",&t1,&t2);
		g[t1].push_back(t2);
		g[t2].push_back(t1);
	}
	dfsD(1,1,0);
	for(int i=1;i<=n;i++) if(d[i]>d[u]) u=i;
	dfsD(u,u,0);
	for(int i=1;i<=n;i++) if(d[i]>d[v]) v=i;
	dfsd(u,u,0,0);
	dfsd(v,v,1,0);
	dfsp(u,u);
	calc(u,u,0,0);
	mb=u;
	dfsp(v,v);
	calc(v,v,0,0);
	dfs(g[u][0],u,1,0);
	dfs(g[v][0],v,1,1);
	printf("%lld %lld",pot,cnt);
}

Compilation message

road.cpp: In function 'void dfsD(int, int, int)':
road.cpp:10:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) dfsD(g[s][i],s,di+1);
              ~^~~~~~~~~~~~
road.cpp: In function 'void dfsd(int, int, int, int)':
road.cpp:15:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) dfsD(g[s][i],s,di+1);
              ~^~~~~~~~~~~~
road.cpp: In function 'int dfsp(int, int)':
road.cpp:20:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) mx=max(mx,dfsp(g[s][i],s));
              ~^~~~~~~~~~~~
road.cpp: In function 'void calc(int, int, long long int, long long int)':
road.cpp:35:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]>mx1) {mx1=d[g[s][i]]; mxi=i;}
              ~^~~~~~~~~~~~
road.cpp:36:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(i!=mxi) mx2=max(mx2,(long long)d[g[s][i]]);
              ~^~~~~~~~~~~~
road.cpp:38:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f && i!=mxi) calc(g[s][i],s,max(mx,mx1),du+1);
              ~^~~~~~~~~~~~
road.cpp: In function 'void dfs(int, int, long long int, int)':
road.cpp:44:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) dfs(g[s][i],s,du+1,ka);
              ~^~~~~~~~~~~~
road.cpp:48:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]>mx1) {mx1=d[g[s][i]]; mxi=i;}
              ~^~~~~~~~~~~~
road.cpp:49:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]==mx1) k[s]+=k[g[s][i]];
              ~^~~~~~~~~~~~
road.cpp:50:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(i!=mxi) mx2=max(mx2,(long long)d[g[s][i]]);
              ~^~~~~~~~~~~~
road.cpp:56:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]==mx1) tc-=k[g[s][i]]*k[g[s][i]];
               ~^~~~~~~~~~~~
road.cpp:61:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<g[s].size();i++) if(g[s][i]!=f) if(d[g[s][i]]==mx2) tc+=k[g[s][i]];
               ~^~~~~~~~~~~~
road.cpp: In function 'int main()':
road.cpp:72:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
road.cpp:76:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&t1,&t2);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12152 KB Output is correct
2 Correct 12 ms 12260 KB Output is correct
3 Correct 13 ms 12320 KB Output is correct
4 Correct 13 ms 12320 KB Output is correct
5 Correct 13 ms 12320 KB Output is correct
6 Correct 12 ms 12320 KB Output is correct
7 Correct 15 ms 12324 KB Output is correct
8 Correct 12 ms 12368 KB Output is correct
9 Correct 13 ms 12388 KB Output is correct
10 Correct 13 ms 12404 KB Output is correct
11 Correct 12 ms 12408 KB Output is correct
12 Correct 14 ms 12408 KB Output is correct
13 Correct 13 ms 12408 KB Output is correct
14 Correct 12 ms 12408 KB Output is correct
15 Correct 17 ms 12408 KB Output is correct
16 Correct 16 ms 12408 KB Output is correct
17 Correct 16 ms 12408 KB Output is correct
18 Correct 12 ms 12452 KB Output is correct
19 Correct 15 ms 12452 KB Output is correct
20 Correct 23 ms 12460 KB Output is correct
21 Correct 12 ms 12460 KB Output is correct
22 Correct 14 ms 12468 KB Output is correct
23 Correct 13 ms 12468 KB Output is correct
24 Correct 12 ms 12468 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12152 KB Output is correct
2 Correct 12 ms 12260 KB Output is correct
3 Correct 13 ms 12320 KB Output is correct
4 Correct 13 ms 12320 KB Output is correct
5 Correct 13 ms 12320 KB Output is correct
6 Correct 12 ms 12320 KB Output is correct
7 Correct 15 ms 12324 KB Output is correct
8 Correct 12 ms 12368 KB Output is correct
9 Correct 13 ms 12388 KB Output is correct
10 Correct 13 ms 12404 KB Output is correct
11 Correct 12 ms 12408 KB Output is correct
12 Correct 14 ms 12408 KB Output is correct
13 Correct 13 ms 12408 KB Output is correct
14 Correct 12 ms 12408 KB Output is correct
15 Correct 17 ms 12408 KB Output is correct
16 Correct 16 ms 12408 KB Output is correct
17 Correct 16 ms 12408 KB Output is correct
18 Correct 12 ms 12452 KB Output is correct
19 Correct 15 ms 12452 KB Output is correct
20 Correct 23 ms 12460 KB Output is correct
21 Correct 12 ms 12460 KB Output is correct
22 Correct 14 ms 12468 KB Output is correct
23 Correct 13 ms 12468 KB Output is correct
24 Correct 12 ms 12468 KB Output is correct
25 Correct 41 ms 12864 KB Output is correct
26 Correct 21 ms 12916 KB Output is correct
27 Correct 17 ms 12968 KB Output is correct
28 Correct 17 ms 13020 KB Output is correct
29 Correct 20 ms 13072 KB Output is correct
30 Correct 21 ms 13124 KB Output is correct
31 Correct 15 ms 13176 KB Output is correct
32 Correct 17 ms 13228 KB Output is correct
33 Correct 15 ms 13408 KB Output is correct
34 Correct 16 ms 13440 KB Output is correct
35 Correct 16 ms 13512 KB Output is correct
36 Correct 16 ms 13564 KB Output is correct
37 Correct 18 ms 13744 KB Output is correct
38 Correct 18 ms 13796 KB Output is correct
39 Correct 16 ms 13796 KB Output is correct
40 Correct 16 ms 13796 KB Output is correct
41 Correct 16 ms 13796 KB Output is correct
42 Correct 17 ms 13796 KB Output is correct
43 Correct 17 ms 13796 KB Output is correct
44 Correct 20 ms 13796 KB Output is correct
45 Correct 16 ms 13796 KB Output is correct
46 Correct 16 ms 13796 KB Output is correct
47 Correct 15 ms 13868 KB Output is correct
48 Correct 15 ms 13920 KB Output is correct

Subtask #3
0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 12152 KB Output is correct
2 Correct 12 ms 12260 KB Output is correct
3 Correct 13 ms 12320 KB Output is correct
4 Correct 13 ms 12320 KB Output is correct
5 Correct 13 ms 12320 KB Output is correct
6 Correct 12 ms 12320 KB Output is correct
7 Correct 15 ms 12324 KB Output is correct
8 Correct 12 ms 12368 KB Output is correct
9 Correct 13 ms 12388 KB Output is correct
10 Correct 13 ms 12404 KB Output is correct
11 Correct 12 ms 12408 KB Output is correct
12 Correct 14 ms 12408 KB Output is correct
13 Correct 13 ms 12408 KB Output is correct
14 Correct 12 ms 12408 KB Output is correct
15 Correct 17 ms 12408 KB Output is correct
16 Correct 16 ms 12408 KB Output is correct
17 Correct 16 ms 12408 KB Output is correct
18 Correct 12 ms 12452 KB Output is correct
19 Correct 15 ms 12452 KB Output is correct
20 Correct 23 ms 12460 KB Output is correct
21 Correct 12 ms 12460 KB Output is correct
22 Correct 14 ms 12468 KB Output is correct
23 Correct 13 ms 12468 KB Output is correct
24 Correct 12 ms 12468 KB Output is correct
25 Correct 41 ms 12864 KB Output is correct
26 Correct 21 ms 12916 KB Output is correct
27 Correct 17 ms 12968 KB Output is correct
28 Correct 17 ms 13020 KB Output is correct
29 Correct 20 ms 13072 KB Output is correct
30 Correct 21 ms 13124 KB Output is correct
31 Correct 15 ms 13176 KB Output is correct
32 Correct 17 ms 13228 KB Output is correct
33 Correct 15 ms 13408 KB Output is correct
34 Correct 16 ms 13440 KB Output is correct
35 Correct 16 ms 13512 KB Output is correct
36 Correct 16 ms 13564 KB Output is correct
37 Correct 18 ms 13744 KB Output is correct
38 Correct 18 ms 13796 KB Output is correct
39 Correct 16 ms 13796 KB Output is correct
40 Correct 16 ms 13796 KB Output is correct
41 Correct 16 ms 13796 KB Output is correct
42 Correct 17 ms 13796 KB Output is correct
43 Correct 17 ms 13796 KB Output is correct
44 Correct 20 ms 13796 KB Output is correct
45 Correct 16 ms 13796 KB Output is correct
46 Correct 16 ms 13796 KB Output is correct
47 Correct 15 ms 13868 KB Output is correct
48 Correct 15 ms 13920 KB Output is correct
49 Correct 1241 ms 57164 KB Output is correct
50 Correct 1296 ms 58872 KB Output is correct
51 Correct 1221 ms 58872 KB Output is correct
52 Correct 1179 ms 58888 KB Output is correct
53 Correct 1083 ms 58888 KB Output is correct
54 Correct 1062 ms 58888 KB Output is correct
55 Correct 1060 ms 58888 KB Output is correct
56 Correct 1090 ms 58888 KB Output is correct
57 Correct 1356 ms 68156 KB Output is correct
58 Correct 1409 ms 68316 KB Output is correct
59 Correct 1480 ms 68316 KB Output is correct
60 Correct 1293 ms 68348 KB Output is correct
61 Execution timed out 2068 ms 78108 KB Time limit exceeded
62 Halted 0 ms 0 KB -