oj.uz

답안 #79837

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
79837 2018-10-16T17:23:58 Z Pajaraja Hard route (IZhO17_road) C++17
52 / 100
 2000 ms 85004 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;
	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);
}
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:34: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: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(i!=mxi) mx2=max(mx2,(long long)d[g[s][i]]);
              ~^~~~~~~~~~~~
road.cpp:37: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:43: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:47: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: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) k[s]+=k[g[s][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(i!=mxi) mx2=max(mx2,(long long)d[g[s][i]]);
              ~^~~~~~~~~~~~
road.cpp:55: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:60: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:71:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
road.cpp:75: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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12152 KB Output is correct
3 Correct 12 ms 12192 KB Output is correct
4 Correct 12 ms 12272 KB Output is correct
5 Correct 13 ms 12272 KB Output is correct
6 Correct 12 ms 12272 KB Output is correct
7 Correct 16 ms 12360 KB Output is correct
8 Correct 13 ms 12408 KB Output is correct
9 Correct 12 ms 12408 KB Output is correct
10 Correct 12 ms 12408 KB Output is correct
11 Correct 12 ms 12408 KB Output is correct
12 Correct 12 ms 12408 KB Output is correct
13 Correct 12 ms 12408 KB Output is correct
14 Correct 12 ms 12436 KB Output is correct
15 Correct 12 ms 12452 KB Output is correct
16 Correct 12 ms 12472 KB Output is correct
17 Correct 12 ms 12472 KB Output is correct
18 Correct 12 ms 12480 KB Output is correct
19 Correct 13 ms 12484 KB Output is correct
20 Correct 13 ms 12484 KB Output is correct
21 Correct 12 ms 12488 KB Output is correct
22 Correct 13 ms 12488 KB Output is correct
23 Correct 16 ms 12500 KB Output is correct
24 Correct 12 ms 12500 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12152 KB Output is correct
3 Correct 12 ms 12192 KB Output is correct
4 Correct 12 ms 12272 KB Output is correct
5 Correct 13 ms 12272 KB Output is correct
6 Correct 12 ms 12272 KB Output is correct
7 Correct 16 ms 12360 KB Output is correct
8 Correct 13 ms 12408 KB Output is correct
9 Correct 12 ms 12408 KB Output is correct
10 Correct 12 ms 12408 KB Output is correct
11 Correct 12 ms 12408 KB Output is correct
12 Correct 12 ms 12408 KB Output is correct
13 Correct 12 ms 12408 KB Output is correct
14 Correct 12 ms 12436 KB Output is correct
15 Correct 12 ms 12452 KB Output is correct
16 Correct 12 ms 12472 KB Output is correct
17 Correct 12 ms 12472 KB Output is correct
18 Correct 12 ms 12480 KB Output is correct
19 Correct 13 ms 12484 KB Output is correct
20 Correct 13 ms 12484 KB Output is correct
21 Correct 12 ms 12488 KB Output is correct
22 Correct 13 ms 12488 KB Output is correct
23 Correct 16 ms 12500 KB Output is correct
24 Correct 12 ms 12500 KB Output is correct
25 Correct 16 ms 12892 KB Output is correct
26 Correct 17 ms 12944 KB Output is correct
27 Correct 16 ms 12996 KB Output is correct
28 Correct 16 ms 13048 KB Output is correct
29 Correct 20 ms 13100 KB Output is correct
30 Correct 16 ms 13152 KB Output is correct
31 Correct 17 ms 13332 KB Output is correct
32 Correct 15 ms 13332 KB Output is correct
33 Correct 15 ms 13480 KB Output is correct
34 Correct 16 ms 13488 KB Output is correct
35 Correct 16 ms 13540 KB Output is correct
36 Correct 16 ms 13640 KB Output is correct
37 Correct 19 ms 13892 KB Output is correct
38 Correct 20 ms 13892 KB Output is correct
39 Correct 16 ms 13892 KB Output is correct
40 Correct 20 ms 13892 KB Output is correct
41 Correct 17 ms 13892 KB Output is correct
42 Correct 17 ms 13892 KB Output is correct
43 Correct 17 ms 13892 KB Output is correct
44 Correct 16 ms 13892 KB Output is correct
45 Correct 18 ms 13892 KB Output is correct
46 Correct 15 ms 13892 KB Output is correct
47 Correct 15 ms 13900 KB Output is correct
48 Correct 15 ms 13924 KB Output is correct

Subtask #3
0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12024 KB Output is correct
2 Correct 12 ms 12152 KB Output is correct
3 Correct 12 ms 12192 KB Output is correct
4 Correct 12 ms 12272 KB Output is correct
5 Correct 13 ms 12272 KB Output is correct
6 Correct 12 ms 12272 KB Output is correct
7 Correct 16 ms 12360 KB Output is correct
8 Correct 13 ms 12408 KB Output is correct
9 Correct 12 ms 12408 KB Output is correct
10 Correct 12 ms 12408 KB Output is correct
11 Correct 12 ms 12408 KB Output is correct
12 Correct 12 ms 12408 KB Output is correct
13 Correct 12 ms 12408 KB Output is correct
14 Correct 12 ms 12436 KB Output is correct
15 Correct 12 ms 12452 KB Output is correct
16 Correct 12 ms 12472 KB Output is correct
17 Correct 12 ms 12472 KB Output is correct
18 Correct 12 ms 12480 KB Output is correct
19 Correct 13 ms 12484 KB Output is correct
20 Correct 13 ms 12484 KB Output is correct
21 Correct 12 ms 12488 KB Output is correct
22 Correct 13 ms 12488 KB Output is correct
23 Correct 16 ms 12500 KB Output is correct
24 Correct 12 ms 12500 KB Output is correct
25 Correct 16 ms 12892 KB Output is correct
26 Correct 17 ms 12944 KB Output is correct
27 Correct 16 ms 12996 KB Output is correct
28 Correct 16 ms 13048 KB Output is correct
29 Correct 20 ms 13100 KB Output is correct
30 Correct 16 ms 13152 KB Output is correct
31 Correct 17 ms 13332 KB Output is correct
32 Correct 15 ms 13332 KB Output is correct
33 Correct 15 ms 13480 KB Output is correct
34 Correct 16 ms 13488 KB Output is correct
35 Correct 16 ms 13540 KB Output is correct
36 Correct 16 ms 13640 KB Output is correct
37 Correct 19 ms 13892 KB Output is correct
38 Correct 20 ms 13892 KB Output is correct
39 Correct 16 ms 13892 KB Output is correct
40 Correct 20 ms 13892 KB Output is correct
41 Correct 17 ms 13892 KB Output is correct
42 Correct 17 ms 13892 KB Output is correct
43 Correct 17 ms 13892 KB Output is correct
44 Correct 16 ms 13892 KB Output is correct
45 Correct 18 ms 13892 KB Output is correct
46 Correct 15 ms 13892 KB Output is correct
47 Correct 15 ms 13900 KB Output is correct
48 Correct 15 ms 13924 KB Output is correct
49 Correct 1227 ms 64152 KB Output is correct
50 Correct 1272 ms 65836 KB Output is correct
51 Correct 1223 ms 65984 KB Output is correct
52 Correct 1297 ms 65984 KB Output is correct
53 Correct 1180 ms 65984 KB Output is correct
54 Correct 1110 ms 65984 KB Output is correct
55 Correct 1116 ms 65984 KB Output is correct
56 Correct 1092 ms 65984 KB Output is correct
57 Correct 1294 ms 75220 KB Output is correct
58 Correct 1150 ms 75360 KB Output is correct
59 Correct 1219 ms 75408 KB Output is correct
60 Correct 1456 ms 75408 KB Output is correct
61 Execution timed out 2059 ms 85004 KB Time limit exceeded
62 Halted 0 ms 0 KB -