Submission #1062411

#	Time	Username	Problem	Language	Result	Execution time	Memory
1062411		tamir1	Islands (IOI08_islands)	C++17	36 / 100	2040 ms	131072 KiB

islands

#include<bits/stdc++.h>
#define ll long long
#define ff first
#define ss second
using namespace std;
int n,x,p;
vector<pair<int,ll>> v[1000005];
vector<int> com[1000005];
ll ans,l,dis[1000005];
bitset<1000005> ok;
priority_queue<pair<ll,int>> q;
void dfs(int x){
	if(ok[x]) return;
	ok[x]=1;
	com[p].push_back(x);
	for(pair<int,ll> i:v[x]){
		dfs(i.ff);
	}
}
void dijk(){
	while(!q.empty()){
		ll d=q.top().ff;
		int x=q.top().ss;
		q.pop();
		if(ok[x]) continue;
		ok[x]=1;
		dis[x]=d;
		for(pair<int,ll> i:v[x]){
			if(!ok[i.ff]) q.push({d+i.ss,i.ff});
		}
	}
}
ll solve(int p){
	ll mx=0,m;
	for(int i:com[p]){
		q.push({0,i});
		dijk();
		m=0;
		for(int j:com[p]){
			m=max(m,dis[j]);
			dis[j]=0;
			ok[j]=0;
		}
		mx=max(mx,m);
	}
	return mx;
}
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> x >> l;
		v[i].push_back({x,l});
		v[x].push_back({i,l});
	}
	for(int i=1;i<=n;i++){
		if(!ok[i]){
			p++;
			dfs(i);
		}
	}
	ok.reset();
	for(int i=1;i<=p;i++) ans+=solve(i);
	cout << ans;
}

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