제출 #1008411

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1008411		vjudge1	Islands (IOI08_islands)	C++17	3 / 100	598 ms	131072 KiB

islands

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define int long long
const long long inf=1e18;
const int MOD=1e9+7;
const int N=1e6+1;
vector<pair<int,int>> adj[N];
int low[N],sum=0,mn=inf,ans=0;
map<pair<int,int>,int> mp;
void dfs(int node,int depth,int par){
    low[node]=depth;
    for(auto i:adj[node]){
        if(i.first==par)continue;
        if(low[i.first]==0){
            dfs(i.first,depth+1,node);
            sum+=mp[{min(i.first,node),max(i.first,node)}];
            if(low[i.first]<low[node])mn=min(mn,mp[{min(i.first,node),max(i.first,node)}]);
            low[node]=min(low[node],low[i.first]);
        }
        else{
            low[node]=min(low[node],low[i.first]);
        }
    }
}
signed main()
{
   int n; cin>>n;
   for(int i=1;i<=n;i++){
       int x,l; cin>>x>>l;
       mp[{min(i,x),max(i,x)}]=l;
   }
   for(auto i:mp){
       adj[i.first.first].pb({i.first.second,i.second});
       adj[i.first.second].pb({i.first.first,i.second});
   }
   for(int i=1;i<=n;i++){
       if(low[i]==0){
           dfs(i,1,0);
           if(mn==inf)mn=0;
           ans+=sum-mn;
           sum=0; mn=inf;
       }
   }
   cout<<ans;
}

• Subtask 1: 3 / 33
• Subtask 2: 0 / 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