oj.uz

Submission #1055397

# Submission time Handle Problem Language Result Execution time Memory
1055397 2024-08-12T18:42:33 Z MilosMilutinovic Islands (IOI08_islands) C++14
47 / 100
 2000 ms 131072 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n), l(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> l[i];
    --a[i];
  }
  vector<vector<int>> g(n);
  for (int i = 0; i < n; i++) {
    g[i].push_back(a[i]);
    g[a[i]].push_back(i);
  }
  vector<bool> was(n);
  long long res = 0;
  vector<long long> d(n, -1);
  vector<vector<long long>> dp(n, vector<long long>(3));
  for (int i = 0; i < n; i++) {
    if (was[i]) {
      continue;
    }
    vector<int> que(1, i);
    for (int b = 0; b < (int) que.size(); b++) {
      int x = que[b];
      for (int y : g[x]) {
        if (!was[y]) {
          was[y] = true;
          que.push_back(y);
        }
      }
    }
    for (int x : que) {
      was[x] = false;
    }
    int x = i;
    while (!was[x]) {
      was[x] = true;
      x = a[x];
    }
    int y = a[x];
    vector<int> cyc(1, x);
    while (y != x) {
      cyc.push_back(y);
      y = a[y];
    }
    for (int x : que) {
      was[x] = true;
    }
    d[cyc[0]] = 0;
    for (int i = 1; i < (int) cyc.size(); i++) {
      int x = cyc[i - 1], y = cyc[i];
      d[y] = d[x] + l[x];
    }
    function<void(int, int)> Solve = [&](int v, int pv) {
      for (int u : g[v]) {
        if (d[u] != -1 || u == pv) {
          continue;
        }
        Solve(u, v);
        dp[v][2] = max(dp[v][2], dp[v][1] + dp[u][1] + l[u]);
        dp[v][1] = max(dp[v][1], dp[u][1] + l[u]);
      }
    };
    long long c = 0;
    for (int i : cyc) {
      Solve(i, i);
      c = max(c, dp[i][1]);
      c = max(c, dp[i][2]);
    }
    vector<int> v;
    for (int i : cyc) {
      v.push_back(i);
    }
    for (int i : cyc) {
      v.push_back(i);
    }
    long long t = d[cyc.back()] + l[cyc.back()];
    int ptr = 0;
    for (int i = 0; i < (int) cyc.size(); i++) {
      for (int j = i + 1; j < (int) cyc.size(); j++) {
        long long p = d[cyc[j]] - d[cyc[i]];
        c = max(c, max(p, t - p) + dp[cyc[i]][1] + dp[cyc[j]][1]);
      }
    }
    res += c;
  }
  cout << res << '\n';
  return 0;
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:84:9: warning: unused variable 'ptr' [-Wunused-variable]
   84 |     int ptr = 0;
      |         ^~~

Subtask #1
30.0 / 33.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 604 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 6 ms 1024 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2432 KB Output is correct
2 Correct 386 ms 5336 KB Output is correct
3 Correct 7 ms 3416 KB Output is correct
4 Incorrect 4 ms 1628 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 744 ms 7268 KB Output is correct
2 Correct 405 ms 13308 KB Output is correct

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1014 ms 26828 KB Output is correct
2 Execution timed out 2075 ms 31196 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 996 ms 51028 KB Output is correct
2 Execution timed out 2035 ms 69824 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 156 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 201 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -