Submission #989499

#	Time	Username	Problem	Language	Result	Execution time	Memory
989499		huutuan	Fish (IOI08_fish)	C++14	0 / 100	45 ms	49756 KiB

fish

#include<bits/stdc++.h>

using namespace std;

// #pragma GCC optimize("trapv")

// #define int long long

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, mx1);
   }
   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<long long> ans;
   for (int i=1; i<=n; ++i) if (!vis[i]){
      long long cur=0;
      vector<int> cycle;
      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.push_back(cur);
   }
   cout << accumulate(ans.begin(), ans.end(), 0ll) << '\n';
   return 0;
}

• Subtask 1: 0 / 4
• Subtask 2: 0 / 4
• Subtask 3: 0 / 4
• Subtask 4: 0 / 4
• Subtask 5: 0 / 4
• Subtask 6: 0 / 5
• Subtask 7: 0 / 6
• Subtask 8: 0 / 6
• Subtask 9: 0 / 6
• Subtask 10: 0 / 6
• Subtask 11: 0 / 7
• Subtask 12: 0 / 7
• Subtask 13: 0 / 7
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5