oj.uz

Submission #900376

# Submission time Handle Problem Language Result Execution time Memory
900376 2024-01-08T08:08:06 Z abcvuitunggio Islands (IOI08_islands) C++17
50 / 100
 491 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],tmp;
int n,p[mxn],l[mxn],vis[mxn],vis2[mxn],root[mxn],idx,sz,x;
long long dp[mxn],dp2[mxn],d[mxn],mx,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){
    pair <long long, int> 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];
        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;
            tmp.clear();
            while (true){
                tmp.push_back(i);
                vis2[i]=tmp.size();
                i=p[i];
                if (vis[i]){
                    for (int j:tmp){
                        root[j]=root[i];
                        ke[p[j]].push_back(j);
                        vis[j]=1;
                    }
                    break;
                }
                if (vis2[i]){
                    for (int j=vis2[i]-1;j<tmp.size();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:tmp)
                        vis[j]=1;
                    idx++;
                    break;
                }
            }
            vector <int>().swap(tmp);
            i=x;
        }
    for (int i=1;i<=n;i++){
        if (root[i]==i){
            dfs(i);
            dfs2(i);
        }
        vector <int>().swap(ke[i]);
    }
    for (int i=1;i<=n;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];
        mx=0,s=sum;
        for (int j=sz-1;j>=0;j--){
            for (int u:V[ve[i][j]])
                mx=max(mx,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+=mx;
    }
    cout << res;
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:53:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |                     for (int j=vis2[i]-1;j<tmp.size();j++){
      |                                          ~^~~~~~~~~~~

Subtask #1
27.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 80732 KB Output is correct
2 Incorrect 17 ms 80984 KB Output isn't correct
3 Correct 17 ms 80900 KB Output is correct
4 Correct 18 ms 80888 KB Output is correct
5 Correct 17 ms 80732 KB Output is correct
6 Correct 17 ms 80976 KB Output is correct
7 Correct 17 ms 80732 KB Output is correct
8 Incorrect 17 ms 80728 KB Output isn't correct
9 Correct 18 ms 80988 KB Output is correct
10 Correct 20 ms 80988 KB Output is correct
11 Correct 19 ms 80988 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 80984 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 83544 KB Output is correct
2 Correct 29 ms 86364 KB Output is correct
3 Incorrect 22 ms 84056 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 35 ms 87012 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 93776 KB Output is correct
2 Correct 57 ms 92736 KB Output is correct
3 Correct 73 ms 95976 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 103712 KB Output is correct
2 Correct 128 ms 109084 KB Output is correct
3 Correct 121 ms 108652 KB Output is correct
4 Correct 151 ms 120140 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 189 ms 114892 KB Output is correct
2 Correct 483 ms 131072 KB Output is correct
3 Correct 192 ms 131072 KB Output is correct
4 Correct 240 ms 131072 KB Output is correct
5 Correct 235 ms 131072 KB Output is correct
6 Incorrect 491 ms 131072 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 215 ms 131072 KB Output isn't correct
2 Halted 0 ms 0 KB -