oj.uz

Submission #990413

# Submission time Handle Problem Language Result Execution time Memory
990413 2024-05-30T11:19:30 Z huutuan Islands (IOI08_islands) C++14
0 / 100
 158 ms 82008 KB 
#include<bits/stdc++.h>

using namespace std;

const int N=1e6+10;
int n, vis[N], par[N], wpar[N], on_cycle[N];
vector<pair<int, int>> g[N];
long long pf[N], f[N][2];

void dfs(int u){
   vis[u]=1;
   long long mx1=-1e18, mx2=-1e18;
   for (auto &e:g[u]){
      int v=e.first, w=e.second;
      if (on_cycle[v]) continue;
      dfs(v);
      long long val=f[v][0]+w;
      f[u][0]=max(f[u][0], val);
      f[u][1]=max(f[u][1], f[v][1]);
      if (mx1<val) mx2=mx1, mx1=val;
      else mx2=max(mx2, val);
   }
   f[u][1]=max({f[u][1], f[u][0], mx1+mx2});
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   cin >> n;
   for (int i=1; i<=n; ++i){
      int j, k; cin >> j >> k;
      g[j].emplace_back(i, k);
      par[i]=j;
      wpar[i]=k;
   }
   // vector<int> cycle;
   // long long ans=0;
   // for (int i=1; i<=n; ++i) if (!vis[i]){
   //    cycle.clear();
   //    long long cur=0;
   //    int u=i;
   //    while (1){
   //       if (vis[u]) break;
   //       vis[u]=1;
   //       cycle.push_back(u);
   //       u=par[u];
   //    }
   //    cycle.erase(cycle.begin(), find(cycle.begin(), cycle.end(), u));
   //    for (int v:cycle) on_cycle[v]=1;
   //    for (int v:cycle){
   //       dfs(v);
   //       cur=max(cur, f[v][1]);
   //    }
   //    for (int j=1; j<=(int)cycle.size(); ++j){
   //       pf[j]=pf[j-1]+wpar[cycle[j-1]];
   //    }
   //    long long sum=pf[(int)cycle.size()];
   //    long long mx1=-1e18, mx2=-1e18;
   //    for (int j=0; j<(int)cycle.size(); ++j){
   //       cur=max(cur, f[cycle[j]][0]+pf[j]+mx1);
   //       cur=max(cur, f[cycle[j]][0]-pf[j]+mx2);
   //       mx1=max(mx1, f[cycle[j]][0]-pf[j]);
   //       mx2=max(mx2, f[cycle[j]][0]+sum+pf[j]);
   //    }
   //    ans+=cur;
   // }
   // cout << ans << '\n';
   return 0;
}

Subtask #1
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 29020 KB Output isn't correct
2 Incorrect 4 ms 29020 KB Output isn't correct
3 Incorrect 4 ms 29020 KB Output isn't correct
4 Incorrect 4 ms 29148 KB Output isn't correct
5 Incorrect 5 ms 29020 KB Output isn't correct
6 Incorrect 4 ms 29020 KB Output isn't correct
7 Incorrect 4 ms 29020 KB Output isn't correct
8 Incorrect 4 ms 29020 KB Output isn't correct
9 Incorrect 5 ms 29020 KB Output isn't correct
10 Incorrect 4 ms 29020 KB Output isn't correct
11 Incorrect 4 ms 29020 KB Output isn't correct

Subtask #2
0 / 3.0

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

Subtask #3
0 / 4.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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