oj.uz

답안 #920195

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920195 2024-02-02T08:42:25 Z ting39 Cat Exercise (JOI23_ho_t4) C++17
0 / 100
 1 ms 344 KB 
#include<bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define F first
#define S second
using namespace std;
vector<vector<int>> g,jump;
vector<int> dep;
struct DSU{
	int n;
	vector<int> rt,sz,mx,val;
	DSU(int _n):n(_n){
		rt.resize(n);
		sz.resize(n,1);
		val.resize(n);
		mx.resize(n);
		for(int i=0;i<n;i++){
			rt[i]=i;
			mx[i]=i;
		}
	}
	int fnd(int p){
		if(rt[p]==p) return p;
		rt[p]=fnd(rt[p]);
		return rt[p];
	}
	void conn(int a,int b){
		a=fnd(a);
		b=fnd(b);
		if(a==b) return;
		if(sz[a]>sz[b]) swap(a,b);
		rt[a]=b;
		sz[b]+=sz[a];
		mx[b]=max(mx[b],mx[a]);
	}
};
void dfs(int pre,int pos){
	for(int i:g[pos]){
		if(i==pre) continue;
		dep[i]=dep[pos]+1;
		jump[i][0]=pos;
		dfs(pos,i);
	}
}
int lca(int a,int b){
	if(dep[a]<dep[b]) swap(a,b);
	int dif=dep[a]-dep[b],c=0;
	while(dif){
		if(dif&1){
			a=jump[a][c];
		}
		c++;
		dif>>=1;
	}
	if(a==b) return a;
	for(int i=20;i>=0;i--){
		if(jump[a][i]!=jump[b][i]){
			a=jump[a][i];
			b=jump[b][i];
		}
	}
	return jump[a][0];
}
int dis(int a,int b){
	int c=lca(a,b);
	return dep[a]+dep[b]-2*dep[c];
}
signed main(){
	int n;
	cin>>n;
	g.resize(n);
	jump.resize(n,vector<int>(21));
	dep.resize(n);
	vector<vector<int>> gg(n);
	vector<int> v(n);
	for(int &i:v){
		cin>>i;
		i--;
	}
	for(int i=0;i<n-1;i++){
		int a,b;
		cin>>a>>b;
		a--;
		b--;
		a=v[a];
		b=v[b];
		g[a].push_back(b);
		g[b].push_back(a);
		gg[max(a,b)].push_back(min(a,b));
	}
	dfs(0,0);
	for(int j=1;j<21;j++){
		for(int i=0;i<n;i++){
			jump[i][j]=jump[jump[i][j-1]][j-1];
		}
	}
	DSU dsu(n);
	
	for(int i=0;i<n;i++){
		int tmp=0,p=-1;
		for(int j:gg[i]){
			int a=dis(i,dsu.mx[dsu.fnd(j)])+dsu.val[dsu.fnd(j)];
			if(a>tmp){
				tmp=a;
				p=j;
			}
		}
		if(p==-1) continue;
		dsu.conn(i,p);
		dsu.val[dsu.fnd(i)]=tmp;
	}
	cout<<dsu.val[dsu.fnd(n-1)]<<endl;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Halted 0 ms 0 KB -