oj.uz

Submission #900412

# Submission time Handle Problem Language Result Execution time Memory
900412 2024-01-08T09:09:52 Z abcvuitunggio Islands (IOI08_islands) C++17
90 / 100
 762 ms 131072 KB 
#include <iostream>
#include <bitset>
#include <vector>
#include <queue>
using namespace std;
const int mxn=1000001;
const long long INF=1e18;
vector <int> ke[mxn],V[mxn];
queue <int> q;
int n,p[mxn],l[mxn],last[mxn],r[mxn],idx,x;
bitset <mxn> ch;
long long dp[mxn],dp2[mxn],d[mxn],val,res,a,b,sum,s;
pair <long long, int> mx={-1,0},mx2={-1,0};
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={-1,0},mx2={-1,0};
    for (int v:ke[u]){
        auto tmp=make_pair(dp[v]+l[v],v);
        if (tmp>mx){
            mx2=mx;
            mx=tmp;
        }
        else
            mx2=max(mx2,tmp);
    }
    for (int v:ke[u])
        dp2[v]=max(dp2[u],(mx.second==v?mx2.first:mx.first))+l[v];
    for (int v:ke[u])
        dfs2(v);
}
int f(int i){
    return (r[i]==i?i:r[i]=f(r[i]));
}
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];
        last[p[i]]++;
        r[i]=i;
    }
    for (int i=1;i<=n;i++)
        if (!last[i])
            q.push(i);
    while (!q.empty()){
        int u=q.front();
        q.pop();
        ch[u]=1;
        ke[p[u]].push_back(u);
        r[f(u)]=f(p[u]);
        if (!--last[p[u]])
            q.push(p[u]);
    }
    for (int i=1;i<=n;i++)
        if (f(i)==i){
            dfs(i);
            dfs2(i);
        }
    for (int i=1;i<=n;i++){
        last[i]=0;
        vector <int>().swap(ke[i]);
        V[f(i)].push_back(i);
    }
    for (int i=1;i<=n;i++){
        if (ch[i])
            continue;
        sum=0,a=-INF,b=-INF;
        int j=i;
        while (true){
            sum+=l[j];
            ch[j]=1;
            last[p[j]]=j;
            j=p[j];
            if (j==i)
                break;
        }
        val=0,s=sum;
        for (j=last[i];;j=last[j]){
            for (int u:V[j])
                val=max(val,max(max(dp[u],dp2[u]),d[u]+max(a-s,b+sum+s)));
            a=max(a,dp[j]+s);
            b=max(b,dp[j]-s);
            s-=l[last[j]];
            if (j==i)
                break;
        }
        res+=val;
    }
    cout << res;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 55640 KB Output is correct
2 Correct 13 ms 55644 KB Output is correct
3 Correct 12 ms 55644 KB Output is correct
4 Correct 12 ms 55720 KB Output is correct
5 Correct 12 ms 55644 KB Output is correct
6 Correct 12 ms 55896 KB Output is correct
7 Correct 12 ms 55644 KB Output is correct
8 Correct 12 ms 55644 KB Output is correct
9 Correct 12 ms 55644 KB Output is correct
10 Correct 11 ms 55644 KB Output is correct
11 Correct 12 ms 55644 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 55664 KB Output is correct
2 Correct 12 ms 55684 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 55644 KB Output is correct
2 Correct 13 ms 55900 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 56156 KB Output is correct
2 Correct 25 ms 59036 KB Output is correct
3 Correct 19 ms 56664 KB Output is correct
4 Correct 15 ms 56156 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 59484 KB Output is correct
2 Correct 31 ms 59484 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 65664 KB Output is correct
2 Correct 54 ms 64592 KB Output is correct
3 Correct 65 ms 67084 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 77136 KB Output is correct
2 Correct 117 ms 84304 KB Output is correct
3 Correct 112 ms 82328 KB Output is correct
4 Correct 149 ms 92864 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 93384 KB Output is correct
2 Correct 485 ms 95664 KB Output is correct
3 Correct 175 ms 94104 KB Output is correct
4 Correct 227 ms 104684 KB Output is correct
5 Correct 220 ms 102428 KB Output is correct
6 Correct 762 ms 112708 KB Output is correct
7 Correct 214 ms 105040 KB Output is correct

Subtask #9
0 / 10.0

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