oj.uz

Submission #548266

# Submission time Handle Problem Language Result Execution time Memory
548266 2022-04-12T20:36:02 Z lorenzoferrari Islands (IOI08_islands) C++17
44 / 100
 2000 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
using LL = long long;

#define watch(x) cerr << (#x) << " is " << x << endl

vector<bool> vis, cycle;
vector<array<LL, 2>> prv, nxt;
vector<LL> dl, dr;
vector<LL> f;

LL max_path(const vector<int>& c, const vector<vector<array<LL, 3>>>& adj) {
  // return 42; //////////////
  auto find_cycle = [&](auto&& self, int v, int pid = -1) -> bool {
    if (vis[v]) return cycle[v] = true;
    vis[v] = true;
    for (auto [u, w, eid] : adj[v]) {
      if (eid == pid) continue;
      bool works = self(self, u, eid);
      if (works) {
        nxt[v] = {u, w};
        prv[u] = {v, w};
        return cycle[v] ? false : cycle[v] = true;
      }
    }
    return false;
  };
  find_cycle(find_cycle, c[0]);
  LL dep = 0;
  auto path_in_tree = [&](auto&& self, int v, int p = -1) -> LL {
    while (dep++ >= 1e7) ;
    LL ans = 0;
    for (auto [u, w, eid] : adj[v]) {
      if (u == p || cycle[u]) continue;
      ans = max(ans, w + self(self, u, v));
    }
    return ans;
  };
  int start = -1;
  for (int i : c) {
    watch(i);
    watch(cycle[i]);
    if (cycle[i]) {
      start = i;
      f[i] = path_in_tree(path_in_tree, i);
    }
  }
  multiset<LL> L, R;
  {
    int v = start;
    int u = start;
    dl[v] = dr[u] = 0;
    do {
      auto [nv, lw] = nxt[v];
      auto [nu, rw] = prv[u];
      if (v != start) L.insert(f[v] + dl[v]);
      if (u != start) R.insert(f[u] + dr[u]);
      if (nv != start) dl[nv] = dl[v] + lw;
      dr[nu] = dr[u] + rw;
      v = nv;
      u = nu;
    } while (v != start);
  }
  assert(dl[start] == 0);
  LL len = dr[start];
  LL bias = 0;
  LL ans = 0;
  {
    int v = start;
    do {
      // watch(v);
      // watch(bias);
      // cerr << "L: "; for (LL i : L) cerr << i << " "; cerr << endl;
      // cerr << "R: "; for (LL i : R) cerr << i << " "; cerr << endl;
      // cerr << endl;
      ans = max(ans, *prev(L.end()) - bias + f[v]);
      ans = max(ans, *prev(R.end()) + bias + f[v]);
      int nv = nxt[v][0];
      if (nv == start) break;
      bias += nxt[v][1];
      L.insert(f[v] + dl[v] + len);
      R.insert(f[v] + dr[v] - len);
      if (L.count(f[nv] + dl[nv])) L.erase(L.find(f[nv] + dl[nv]));
      if (R.count(f[nv] + dr[nv])) R.erase(R.find(f[nv] + dr[nv]));
      v = nv;
    } while (v != start);
  }
  return ans;
}

int main() {
#ifdef LORENZO
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif
  int n; cin >> n;
  vector<vector<array<LL, 3>>> adj(n);
  for (int i = 0; i < n; ++i) {
    int a; cin >> a; --a;
    int w; cin >> w;
    adj[i].push_back({a, w, i});
    adj[a].push_back({i, w, i});
  }
  vis.assign(n, false);
  vector<vector<int>> cc;
  auto dfs = [&](auto&& self, int v) -> void {
    vis[v] = true;
    cc.back().push_back(v);
    for (auto [u, _, __] : adj[v]) {
      if (!vis[u]) {
        self(self, u);
      }
    }
  };
  for (int i = 0; i < n; ++i) {
    if (!vis[i]) {
      cc.push_back(vector<int>(0));
      dfs(dfs, i);
    }
  }
  f.assign(n, 0);
  dl.assign(n, 1e18);
  dr.assign(n, 1e18);
  prv.assign(n, {-1,-1});
  nxt.assign(n, {-1,-1});
  vis.assign(n, false);
  cycle.assign(n, false);
  LL ans = 0;
  for (const auto& c : cc) {
    ans += max_path(c, adj);
  }
  cout << ans << "\n";
}

Subtask #1
27.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 3 ms 340 KB Output isn't correct
3 Correct 4 ms 468 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 292 KB Output is correct
10 Incorrect 2 ms 212 KB Output isn't correct
11 Correct 2 ms 340 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 496 KB Output is correct
2 Correct 16 ms 720 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 680 KB Output is correct
2 Correct 42 ms 1316 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 3528 KB Output is correct
2 Correct 372 ms 9304 KB Output is correct
3 Correct 213 ms 4428 KB Output is correct
4 Incorrect 100 ms 2188 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 525 ms 12812 KB Output is correct
2 Correct 1025 ms 21808 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2024 ms 40524 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2083 ms 72696 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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