oj.uz

답안 #1038033

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1038033 2024-07-29T12:19:54 Z 8pete8 Islands (IOI08_islands) C++17
80 / 100
 524 ms 131072 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
//#define int long long
using namespace std;
const int mod=1e9+7,mxn=1e6+5,inf=1e9,minf=-1e9,lg=25;
int n,m,k,x,y,z=0;
vector<pair<int,ll>>adj[mxn+10];
int have=0;
pii up[mxn+10];
ll dp1[mxn+10],mx;
bitset<mxn+10>on,vis;
queue<pii>q;
void dfs(int cur,int p){//fake dfs
    q.push({cur,-1});
    while(!q.empty()){
        cur=q.front().f,p=q.front().s;
        q.pop();
        if(vis[cur])continue;
        vis[cur]=1;
        for(auto i:adj[cur]){
            if(i.f==p)continue;
            if(vis[i.f]&&!have){
                x=cur,y=i.f,z=i.s;
                have++;
            }
            if(!vis[i.f])q.push({i.f,cur});
        }
    }
}
//vector<pii>cycle;
pii cycle[mxn+10];
int pointer=0;
/*
void dfs1(int cur,int p){//dont take edge x,y
    ll m1=0,m2=0;
    //vector<ll>take;
    for(auto i:adj[cur]){
        if(i.f==p)continue;
        if(cur==x&&i.f==y)continue;
        if(cur==y&&i.f==x)continue;
        up[i.f]={cur,i.s};
        dfs1(i.f,cur);
        dp1[cur]=max(dp1[cur],dp1[i.f]+i.s);
        if(dp1[i.f]+i.s>=m1)m2=m1,m1=dp1[i.f]+i.s;
        else if(dp1[i.f]+i.s>=m2)m2=dp1[i.f]+i.s;
    }
    mx=max(mx,dp1[cur]);
    mx=max(mx,m1+m2);
}*/
ll m1=0,m2=0;
void dfs1(int cur,int p){//dont take edge x,y
    q.push({cur,-1});
    while(!q.empty()){
        cur=q.front().f,p=q.front().s;
        q.pop();
        for(auto i:adj[cur]){
            if(i.f==p)continue;
            if(cur==x&&i.f==y)continue;
            if(cur==y&&i.f==x)continue;
            up[i.f]={cur,i.s};
            dp1[i.f]=dp1[cur]+1;
            q.push({i.f,cur});
        }
        cycle[pointer++]={dp1[cur],cur};
        //cycle.pb({dp1[cur],cur});
        dp1[cur]=0;
    }
}
map<pii,int>mp;
//find diameter 
ll suf[mxn+10];
int32_t main(){
    fastio
    cin>>n;
    for(int i=1;i<=n;i++){
        int a,b;cin>>a>>b;
        pii x={min(a,i),max(a,i)};
        if(mp.find(x)==mp.end())mp[x]=b;
        else mp[x]=max(mp[x],b);
    }
    for(auto i:mp){
        adj[i.f.f].pb({i.f.s,i.s});
        adj[i.f.s].pb({i.f.f,i.s});
    }
    ll ans=0;
    ll pref=0,prefmx=0;
    for(int i=1;i<=n;i++){
        if(vis[i])continue;
        have=0,z=0,x=i,mx=0;
        if(have>1)assert(0);//we should only have atmost 1 cycle?
        dfs(i,-1);
        pointer=0;
        //cycle.clear();
        dfs1(x,-1);
        //sort(rall(cycle));
        sort(cycle,cycle+pointer);
        reverse(cycle,cycle+pointer);
        for(int j=0;j<pointer;j++){
            dp1[up[cycle[j].s].f]=max(dp1[up[cycle[j].s].f],dp1[cycle[j].s]+up[cycle[j].s].s);
            mx=max(mx,dp1[cycle[j].s]);
            m1=m2=0;
            for(auto k:adj[cycle[j].s]){
                if(k.f==up[cycle[j].s].f)continue;
                if(cycle[j].s==x&&k.f==y)continue;
                if(cycle[j].s==y&&k.f==x)continue;
                if(dp1[k.f]+k.s>=m1)m2=m1,m1=dp1[k.f]+k.s;
                else if(dp1[k.f]+k.s>=m2)m2=dp1[k.f]+k.s;
            }
            mx=max(mx,m1+m2);
        }
        if(have){
            //passing through edge x,y
            //cycle.clear();
            pointer=0;
            while(y!=x){
                //cycle.pb({y,up[y].s});
                cycle[pointer++]={y,up[y].s};
                on[y]=1;
                y=up[y].f;
            }
            //cycle.pb({x,0});
            cycle[pointer++]={x,0};
            on[x]=1;
            reverse(cycle,cycle+pointer);
            suf[pointer-1]=0;
            pref=0,prefmx=0;
            for(int i=pointer-2;i>=0;i--)suf[i]=cycle[i+1].s+suf[i+1];
            for(int i=0;i<pointer;i++){
                dp1[cycle[i].f]=0;
                for(auto j:adj[cycle[i].f])if(!on[j.f])dp1[cycle[i].f]=max(dp1[cycle[i].f],dp1[j.f]+j.s);
            }
            for(int i=pointer-1;i>=0;i--){
                suf[i]=suf[i]+dp1[cycle[i].f];
                if(i+1<pointer)suf[i]=max(suf[i],suf[i+1]);
            }
            for(int i=0;i<pointer;i++){
                pref+=cycle[i].s;
                prefmx=max(prefmx,pref+dp1[cycle[i].f]);
                if(i+1<pointer)mx=max(mx,prefmx+suf[i+1]+z);
            }
        }
        ans+=mx;
    }
    cout<<ans<<'\n';
}

Compilation message

islands.cpp:32:40: warning: bad option '-funroll-lopps' to pragma 'optimize' [-Wpragmas]
   32 | #pragma GCC optimize ("03,unroll-lopps")
      |                                        ^
islands.cpp:43:23: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   43 | void dfs(int cur,int p){//fake dfs
      |                       ^
islands.cpp:81:24: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
   81 | void dfs1(int cur,int p){//dont take edge x,y
      |                        ^
islands.cpp:102:14: warning: bad option '-funroll-lopps' to attribute 'optimize' [-Wattributes]
  102 | int32_t main(){
      |              ^

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 30556 KB Output is correct
2 Correct 6 ms 30664 KB Output is correct
3 Correct 6 ms 30556 KB Output is correct
4 Correct 6 ms 30556 KB Output is correct
5 Correct 6 ms 30568 KB Output is correct
6 Correct 5 ms 30556 KB Output is correct
7 Correct 5 ms 30556 KB Output is correct
8 Correct 5 ms 30556 KB Output is correct
9 Correct 5 ms 30556 KB Output is correct
10 Correct 8 ms 30664 KB Output is correct
11 Correct 5 ms 30556 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 30812 KB Output is correct
2 Correct 7 ms 30556 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 30812 KB Output is correct
2 Correct 8 ms 31036 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 32424 KB Output is correct
2 Correct 28 ms 34652 KB Output is correct
3 Correct 18 ms 32860 KB Output is correct
4 Correct 11 ms 31836 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 36332 KB Output is correct
2 Correct 67 ms 44264 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 58284 KB Output is correct
2 Correct 119 ms 64400 KB Output is correct
3 Correct 154 ms 67156 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 208 ms 84104 KB Output is correct
2 Correct 279 ms 102440 KB Output is correct
3 Correct 343 ms 108828 KB Output is correct
4 Correct 416 ms 127316 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 524 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 519 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -