제출 #1170757

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170757		Dan4Life	Islands (IOI08_islands)	C++20	90 / 100	717 ms	145368 KiB

islands

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
using ll = long long;
using ar2 = array<int,2>;
using ar3 = array<int,3>;
using vi = vector<int>;
const int mxN = (int)1e6+2;

vi w;
ll n, far, SS;
bitset<mxN> cyc;
int adj[mxN*2][3];
int adjH[mxN], vis[mxN];
int allowed_S, curCnt = 0;
vi xd;

pair<ll,int> dfs2(int s){
	pair<ll,int> ans = {0,s}; vis[s]++;
	for(int x = adjH[s]; x; x=adj[x][1]){
		int u = adj[x][0]; ll w = adj[x][2];
		if(vis[u]!=curCnt) continue;
		auto [xx,y] = dfs2(u);
		ans = max(ans, {xx+w,y});
	}
	return ans;
}

ll dfs(int s, int p){
	ll ans = 0;
	for(int x = adjH[s]; x; x=adj[x][1]){
		int u = adj[x][0]; ll w = adj[x][2];
		if(u==p or cyc[u]) continue;
		ans = max(ans, dfs(u,s)+w);
	}
	return ans;
}

ll compute_diam(int s){
	allowed_S = s; curCnt = 0;
	int a = dfs2(s).second; curCnt++;
	return dfs2(a).first;
}

int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n; ll ans = 0;
	for(int i = 1; i <= n; i++){
		int x, w; cin >> x >> w;
		adj[i*2-1][0]=i, adj[i*2-1][1]=adjH[x],adj[i*2-1][2]=w; adjH[x]=i*2-1;
		adj[i*2][0]=x, adj[i*2][1]=adjH[i],adj[i*2][2]=w; adjH[i]=i*2;
	}
	for(int i = 1; i <= n; i++){ 
		if(vis[i]) continue;
		int x = i; vi v; v.clear(); v.shrink_to_fit();
		ll sum = 0, totP=0;
		while(!vis[x]) vis[x]=1,v.pb(x),x=adj[x*2][0];
		for(auto u : v) vis[u]=0; v.clear(); v.shrink_to_fit();
		while(!cyc[x]) cyc[x]=1,v.pb(x),x=adj[x*2][0];
		for(auto u : v) sum = max(sum, compute_diam(u));
		int m = sz(v); multiset<ll> S; S.clear();
		for(int i = 0; i < m; i++){
			ll dis = dfs(v[i],0);
			sum=max(sum,dis); S.insert(dis-totP);	
			totP+=(ll)adj[v[i]*2][2];
		}
		ll ss = 0;
		for(int i = 0; i < m; i++){
			ll dis = dfs(v[i],0); 
			S.erase(S.find(dis-ss));
			if(sz(S)) sum=max(sum, dis+totP+ss+*prev(end(S))); 
			S.insert(dis-(totP+ss)); ss+=(ll)adj[v[i]*2][2];
		}
		ans+=sum;
	}
	cout << ans << "\n";
}

• Subtask 1: 33 / 33
• Subtask 2: 3 / 3
• Subtask 3: 4 / 4
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 0 / 10