oj.uz

Submission #900388

# Submission time Handle Problem Language Result Execution time Memory
900388 2024-01-08T08:20:09 Z abcvuitunggio Islands (IOI08_islands) C++17
80 / 100
 453 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxn=1000001;
const long long INF=1e18;
vector <int> ke[mxn],ve[mxn],V[mxn];
int n,p[mxn],l[mxn],vis[mxn],vis2[mxn],root[mxn],tmp[mxn],idx,sz,x,mx,mx2,id;
long long dp[mxn],dp2[mxn],d[mxn],val,res,a,b,sum,s;
void dfs(int u){
    for (int v:ke[u]){
        d[v]=d[u]+l[v];
        dfs(v);
        dp[u]=max(dp[u],dp[v]+l[v]);
    }
}
void dfs2(int u){
    mx=mx2=0;
    for (int v:ke[u]){
        if (dp[v]+l[v]>dp[mx]+l[mx]){
            mx2=mx;
            mx=v;
        }
        else if (dp[v]+l[v]>dp[mx2]+l[mx2])
            mx2=v;
    }
    for (int v:ke[u])
        dp2[v]=max(dp2[u],(mx==v?dp[mx2]+l[mx2]:dp[mx]+l[mx]))+l[v];
    for (int v:ke[u])
        dfs2(v);
}
int main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> n;
    for (int i=1;i<=n;i++)
        cin >> p[i] >> l[i];
    for (int i=1;i<=n;i++)
        if (!vis[i]){
            x=i;
            id=0;
            while (true){
                tmp[id]=i;
                vis2[i]=++id;
                i=p[i];
                if (vis[i]){
                    for (int j=0;j<id;j++){
                        root[tmp[j]]=root[i];
                        ke[p[tmp[j]]].push_back(tmp[j]);
                        vis[tmp[j]]=1;
                    }
                    break;
                }
                if (vis2[i]){
                    for (int j=vis2[i]-1;j<id;j++){
                        root[tmp[j]]=tmp[j];
                        ve[idx].push_back(tmp[j]);
                    }
                    for (int j=0;j<vis2[i]-1;j++){
                        root[tmp[j]]=i;
                        ke[tmp[j+1]].push_back(tmp[j]);
                    }
                    for (int j=0;j<id;j++)
                        vis[tmp[j]]=1;
                    idx++;
                    break;
                }
            }
            i=x;
        }
    for (int i=1;i<=n;i++)
        if (root[i]==i){
            dfs(i);
            dfs2(i);
        }
    for (int i=1;i<=n;i++){
        vector <int>().swap(ke[i]);
        V[root[i]].push_back(i);
    }
    for (int i=0;i<idx;i++){
        sz=ve[i].size(),sum=0,a=-INF,b=-INF;
        for (int j:ve[i])
            sum+=l[j];
        val=0,s=sum;
        for (int j=sz-1;j>=0;j--){
            for (int u:V[ve[i][j]])
                val=max(val,max(max(dp[u],dp2[u]),d[u]+max(a-s,b+sum+s)));
            a=max(a,dp[ve[i][j]]+s);
            b=max(b,dp[ve[i][j]]-s);
            s-=l[ve[i][(j?j:sz)-1]];
        }
        res+=val;
    }
    cout << res;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 82672 KB Output is correct
2 Correct 17 ms 82780 KB Output is correct
3 Correct 19 ms 82776 KB Output is correct
4 Correct 17 ms 82780 KB Output is correct
5 Correct 17 ms 82744 KB Output is correct
6 Correct 16 ms 83032 KB Output is correct
7 Correct 18 ms 82780 KB Output is correct
8 Correct 17 ms 82696 KB Output is correct
9 Correct 19 ms 82780 KB Output is correct
10 Correct 17 ms 82708 KB Output is correct
11 Correct 17 ms 82780 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 82776 KB Output is correct
2 Correct 18 ms 82776 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 82804 KB Output is correct
2 Correct 18 ms 82776 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 85596 KB Output is correct
2 Correct 27 ms 88504 KB Output is correct
3 Correct 23 ms 85852 KB Output is correct
4 Correct 21 ms 85184 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 88924 KB Output is correct
2 Correct 37 ms 91224 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 97620 KB Output is correct
2 Correct 59 ms 97140 KB Output is correct
3 Correct 70 ms 99784 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 107616 KB Output is correct
2 Correct 117 ms 112604 KB Output is correct
3 Correct 116 ms 111956 KB Output is correct
4 Correct 146 ms 125384 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 118976 KB Output is correct
2 Correct 453 ms 128456 KB Output is correct
3 Correct 176 ms 123988 KB Output is correct
4 Runtime error 185 ms 131072 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 184 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -