oj.uz

답안 #913448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
913448 2024-01-20T07:59:40 Z MilosMilutinovic Hard route (IZhO17_road) C++14
52 / 100
 2000 ms 33476 KB 
#include<bits/stdc++.h>
 
#define pb push_back
#define fi first
#define se second
#define mp make_pair
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;
 
template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}
 
ll readint(){
	ll x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int n,tot;
int v[1000005],nxt[1000005],h[500005],mx[500005],cnt[500005];

void addedge(int x,int y){
	v[++tot]=y; nxt[tot]=h[x]; h[x]=tot;
	v[++tot]=x; nxt[tot]=h[y]; h[y]=tot;
}

void dfs(int x,int px,int d){
	mx[x]=d;
	cnt[x]=1;
	for(int p=h[x];p;p=nxt[p]){
		if(v[p]==px) continue;
		dfs(v[p],x,d+1);
		if(mx[v[p]]==mx[x]) cnt[x]+=cnt[v[p]];
		else if(mx[x]<mx[v[p]]) cnt[x]=cnt[v[p]];
		mx[x]=max(mx[x],mx[v[p]]);
	}
}

int main(){
	n=readint();
	for(int i=1;i<n;i++) addedge(readint(),readint());
	ll res=0,c=1;
	for(int i=1;i<=n;i++){
		dfs(i,i,0);
		vector<pii> f;
		for(int p=h[i];p;p=nxt[p]) f.pb(mp(mx[v[p]],cnt[v[p]]));
		sort(f.rbegin(),f.rend());
		if((int)f.size()<=2) continue;
		ll cur=0,cc=0;
		cur=f[0].fi*(f[1].fi+f[2].fi);
		ll s=0;
		for(int j=0;j<f.size();j++){
			if(f[j].fi==f[2].fi) cc+=s*f[2].se;
			if(f[j].fi==f[1].fi) s+=f[j].se;
		}
		if(res<cur) res=cur,c=cc;
		else if(res==cur) c+=cc;
	}
	printf("%lld %lld\n",res,c);
	return 0;
}

Compilation message

road.cpp: In function 'int main()':
road.cpp:59:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   for(int j=0;j<f.size();j++){
      |               ~^~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6648 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6740 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6496 KB Output is correct
12 Correct 1 ms 6600 KB Output is correct
13 Correct 2 ms 6660 KB Output is correct
14 Correct 2 ms 6660 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6512 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct

Subtask #2
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6648 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6740 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6496 KB Output is correct
12 Correct 1 ms 6600 KB Output is correct
13 Correct 2 ms 6660 KB Output is correct
14 Correct 2 ms 6660 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6512 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 270 ms 6812 KB Output is correct
26 Correct 262 ms 6816 KB Output is correct
27 Correct 286 ms 6812 KB Output is correct
28 Correct 279 ms 6812 KB Output is correct
29 Correct 226 ms 6812 KB Output is correct
30 Correct 227 ms 6748 KB Output is correct
31 Correct 217 ms 6808 KB Output is correct
32 Correct 249 ms 6808 KB Output is correct
33 Correct 306 ms 7092 KB Output is correct
34 Correct 268 ms 6904 KB Output is correct
35 Correct 270 ms 6928 KB Output is correct
36 Correct 270 ms 6748 KB Output is correct
37 Correct 423 ms 7008 KB Output is correct
38 Correct 438 ms 7160 KB Output is correct
39 Correct 432 ms 6768 KB Output is correct
40 Correct 408 ms 6488 KB Output is correct
41 Correct 407 ms 6664 KB Output is correct
42 Correct 389 ms 6632 KB Output is correct
43 Correct 367 ms 6624 KB Output is correct
44 Correct 395 ms 6644 KB Output is correct
45 Correct 309 ms 6620 KB Output is correct
46 Correct 190 ms 6488 KB Output is correct
47 Correct 191 ms 6492 KB Output is correct
48 Correct 164 ms 6620 KB Output is correct

Subtask #3
0 / 48.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 6648 KB Output is correct
2 Correct 3 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6740 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6496 KB Output is correct
12 Correct 1 ms 6600 KB Output is correct
13 Correct 2 ms 6660 KB Output is correct
14 Correct 2 ms 6660 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6512 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6488 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 270 ms 6812 KB Output is correct
26 Correct 262 ms 6816 KB Output is correct
27 Correct 286 ms 6812 KB Output is correct
28 Correct 279 ms 6812 KB Output is correct
29 Correct 226 ms 6812 KB Output is correct
30 Correct 227 ms 6748 KB Output is correct
31 Correct 217 ms 6808 KB Output is correct
32 Correct 249 ms 6808 KB Output is correct
33 Correct 306 ms 7092 KB Output is correct
34 Correct 268 ms 6904 KB Output is correct
35 Correct 270 ms 6928 KB Output is correct
36 Correct 270 ms 6748 KB Output is correct
37 Correct 423 ms 7008 KB Output is correct
38 Correct 438 ms 7160 KB Output is correct
39 Correct 432 ms 6768 KB Output is correct
40 Correct 408 ms 6488 KB Output is correct
41 Correct 407 ms 6664 KB Output is correct
42 Correct 389 ms 6632 KB Output is correct
43 Correct 367 ms 6624 KB Output is correct
44 Correct 395 ms 6644 KB Output is correct
45 Correct 309 ms 6620 KB Output is correct
46 Correct 190 ms 6488 KB Output is correct
47 Correct 191 ms 6492 KB Output is correct
48 Correct 164 ms 6620 KB Output is correct
49 Execution timed out 2045 ms 33476 KB Time limit exceeded
50 Halted 0 ms 0 KB -