oj.uz

Submission #913956

# Submission time Handle Problem Language Result Execution time Memory
913956 2024-01-20T16:16:40 Z MilosMilutinovic Hard route (IZhO17_road) C++14
52 / 100
 606 ms 262144 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];
ll res=0,c=1;
 
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]]);
	}
}
 
void reroot(int x,int px,int d){
	vector<pii> f;
	for(int p=h[x];p;p=nxt[p]){
		if(v[p]!=px) mx[v[p]]-=d;
		f.pb(mp(mx[v[p]],cnt[v[p]]));
	}
	sort(f.rbegin(),f.rend());
	if((int)f.size()>=3){
		ll cur=0,cc=0;
		cur=f[0].fi*1ll*(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[j].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;
	}
	int mx_bef=mx[x],cnt_bef=cnt[x];
	multiset<int> st;
	map<int,int> c;
	for(int p=h[x];p;p=nxt[p]){
		st.insert(mx[v[p]]);
		c[mx[v[p]]]+=cnt[v[p]];
	}
	st.insert(0);
	c[0]+=1;
	for(int p=h[x];p;p=nxt[p]){
		if(v[p]==px) continue;
		st.erase(st.find(mx[v[p]]));
		c[mx[v[p]]]-=cnt[v[p]];
		mx[x]=*prev(st.end())+1;
		cnt[x]=c[mx[x]-1];
		reroot(v[p],x,d+1);
		st.emplace(mx[v[p]]);
		c[mx[v[p]]]+=cnt[v[p]];
	}
	mx[x]=mx_bef;
	cnt[x]=cnt_bef;
}
 
int main(){
	n=readint();
	for(int i=1;i<n;i++) addedge(readint(),readint());
	dfs(1,1,0);
	reroot(1,1,0);
	printf("%lld %lld\n",res,c);
	return 0;
}

Compilation message

road.cpp: In function 'void reroot(int, int, int)':
road.cpp:58: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]
   58 |   for(int j=0;j<f.size();j++){
      |               ~^~~~~~~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 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 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 1 ms 6588 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 1 ms 6584 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct

Subtask #2
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 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 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 1 ms 6588 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 1 ms 6584 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 4 ms 7256 KB Output is correct
26 Correct 4 ms 7768 KB Output is correct
27 Correct 4 ms 8028 KB Output is correct
28 Correct 6 ms 8136 KB Output is correct
29 Correct 4 ms 7772 KB Output is correct
30 Correct 4 ms 8140 KB Output is correct
31 Correct 4 ms 8168 KB Output is correct
32 Correct 4 ms 7768 KB Output is correct
33 Correct 4 ms 7772 KB Output is correct
34 Correct 4 ms 8184 KB Output is correct
35 Correct 4 ms 8028 KB Output is correct
36 Correct 4 ms 7876 KB Output is correct
37 Correct 5 ms 8284 KB Output is correct
38 Correct 5 ms 9564 KB Output is correct
39 Correct 4 ms 7516 KB Output is correct
40 Correct 4 ms 7256 KB Output is correct
41 Correct 3 ms 6748 KB Output is correct
42 Correct 3 ms 6748 KB Output is correct
43 Correct 3 ms 6492 KB Output is correct
44 Correct 3 ms 6492 KB Output is correct
45 Correct 3 ms 6488 KB Output is correct
46 Correct 3 ms 6492 KB Output is correct
47 Correct 3 ms 6748 KB Output is correct
48 Correct 5 ms 6748 KB Output is correct

Subtask #3
0 / 48.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6488 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 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 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 1 ms 6588 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 2 ms 6492 KB Output is correct
21 Correct 1 ms 6584 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 4 ms 7256 KB Output is correct
26 Correct 4 ms 7768 KB Output is correct
27 Correct 4 ms 8028 KB Output is correct
28 Correct 6 ms 8136 KB Output is correct
29 Correct 4 ms 7772 KB Output is correct
30 Correct 4 ms 8140 KB Output is correct
31 Correct 4 ms 8168 KB Output is correct
32 Correct 4 ms 7768 KB Output is correct
33 Correct 4 ms 7772 KB Output is correct
34 Correct 4 ms 8184 KB Output is correct
35 Correct 4 ms 8028 KB Output is correct
36 Correct 4 ms 7876 KB Output is correct
37 Correct 5 ms 8284 KB Output is correct
38 Correct 5 ms 9564 KB Output is correct
39 Correct 4 ms 7516 KB Output is correct
40 Correct 4 ms 7256 KB Output is correct
41 Correct 3 ms 6748 KB Output is correct
42 Correct 3 ms 6748 KB Output is correct
43 Correct 3 ms 6492 KB Output is correct
44 Correct 3 ms 6492 KB Output is correct
45 Correct 3 ms 6488 KB Output is correct
46 Correct 3 ms 6492 KB Output is correct
47 Correct 3 ms 6748 KB Output is correct
48 Correct 5 ms 6748 KB Output is correct
49 Correct 410 ms 128304 KB Output is correct
50 Correct 453 ms 148464 KB Output is correct
51 Correct 444 ms 165492 KB Output is correct
52 Correct 454 ms 104392 KB Output is correct
53 Correct 497 ms 161188 KB Output is correct
54 Correct 421 ms 183652 KB Output is correct
55 Correct 406 ms 128036 KB Output is correct
56 Correct 414 ms 152404 KB Output is correct
57 Correct 545 ms 179480 KB Output is correct
58 Correct 542 ms 156592 KB Output is correct
59 Correct 540 ms 156320 KB Output is correct
60 Correct 498 ms 145492 KB Output is correct
61 Runtime error 606 ms 262144 KB Execution killed with signal 9
62 Halted 0 ms 0 KB -