oj.uz

Submission #501727

# Submission time Handle Problem Language Result Execution time Memory
501727 2022-01-04T12:05:25 Z 600Mihnea Islands (IOI08_islands) C++17
51 / 100
 901 ms 113592 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct Edge {
  int a, b, cost;
  bool seen = false;
};

const int N = (int) 1e6 + 7;
const ll INF = (ll) 1e18;
int n;
int parrent[N];
Edge graph_edges[N];
vector<int> g[N], verts;
bool vis[N];
int dep[N];
int epar[N];

vector<int> geallonp(int a, int b) {
  vector<int> p1, p2;
  while (a != b) {
    if (dep[a] > dep[b]) {
      p1.push_back(a);
      a = parrent[a];
    } else {
      p2.push_back(b);
      b = parrent[b];
    }
  }
  p1.push_back(a);
  reverse(p2.begin(), p2.end());
  for (auto &x : p2) {
    p1.push_back(x);
  }
  return p1;
}

vector<int> geallonpedges(int a, int b) {
  vector<int> p1, p2;
  while (a != b) {
    if (dep[a] > dep[b]) {
      p1.push_back(epar[a]);
      a = parrent[a];
    } else {
      p2.push_back(epar[b]);
      b = parrent[b];
    }
  }
  reverse(p2.begin(), p2.end());
  for (auto &x : p2) {
    p1.push_back(x);
  }
  return p1;
}

bool blocked[N];
ll under[N];
ll bbpath[N];

void dfs(int a) {
  for (auto &i : g[a]) {
    int b = graph_edges[i].a + graph_edges[i].b - a;
    if (blocked[b] || b == parrent[a]) {
      continue;
    }
    dfs(b);
    bbpath[a] = max(bbpath[a], bbpath[b]);
    bbpath[a] = max(bbpath[a], under[b] + graph_edges[i].cost + under[a]);
    under[a] = max(under[a], under[b] + graph_edges[i].cost);
  }

}

ll sum[N];

ll solveComponent(int rootVertex) {
  ll sol = 0;
  verts.clear();

  queue<int> q;
  q.push(rootVertex);
  vis[rootVertex] = true;

  while (!q.empty()) {
    int a = q.front();
    q.pop();
    verts.push_back(a);
    for (auto &i : g[a]) {
      int b = graph_edges[i].a + graph_edges[i].b - a;
      if (!vis[b]) {
        dep[b] = 1 + dep[a];
        epar[b] = i;
        vis[b] = true;
        q.push(b);
        parrent[b] = a;
        graph_edges[i].seen = true;
      }
    }
  }
  vector<int> nnseeng;
  for (auto &v : verts) {
    for (auto &i : g[v]) {
      if (!graph_edges[i].seen) {
        graph_edges[i].seen = true;
        nnseeng.push_back(i);
      }
    }
  }
  {
    int index = nnseeng[0];
    int a = graph_edges[index].a;
    int b = graph_edges[index].b;
    int cost = graph_edges[index].cost;
    vector<int> path = geallonp(a, b);
    vector<int> edges = geallonpedges(a, b);
    vector<ll> value;
    edges.push_back(index);


    for (auto &v : path) {
      blocked[v] = true;
    }



    for (auto &v : path) {
      dfs(v);
      sol = max(sol, bbpath[v]);
      value.push_back(under[v]);
    }

    ll total = 0;
    for (auto &i : edges) {
      total += graph_edges[i].cost;
    }

    ll cur = 0;
    for (int i = 1; i <= (int) edges.size(); i++) {
      cur += graph_edges[edges[i - 1]].cost;
      sum[i] = cur;
    }

    int y = (int) value.size();

    ll c1 = -INF, c2 = -INF;


    for (int r = 0; r < y; r++) {

      ll b1 = c1 + sum[r] + value[r];
      ll b2 = c2 + total + value[r] - sum[r];
      c1 = max(c1, value[r] - sum[r]);
      c2 = max(c2, sum[r] + value[r]);
      sol = max(sol, b1);
      sol = max(sol, b2);
    }
  }
  return sol;
}

signed main() {
  /// L < P

  ios::sync_with_stdio(0); cin.tie(0);


  cin >> n;
  for (int i = 1; i <= n; i++) {
    int j, c;
    cin >> j >> c;
    graph_edges[i].a = i;
    graph_edges[i].b = j;
    graph_edges[i].cost = c;
  }
  for (int i = 1; i <= n; i++) {
    g[graph_edges[i].a].push_back(i);
    g[graph_edges[i].b].push_back(i);
  }

  ll sol = 0;

  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      sol += solveComponent(i);
    }
  }

  cout << sol << "\n";

  return 0;
}

Compilation message

islands.cpp: In function 'll solveComponent(int)':
islands.cpp:116:9: warning: unused variable 'cost' [-Wunused-variable]
  116 |     int cost = graph_edges[index].cost;
      |         ^~~~

Subtask #1
18.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 39372 KB Output is correct
2 Incorrect 18 ms 39468 KB Output isn't correct
3 Correct 17 ms 39500 KB Output is correct
4 Incorrect 18 ms 39500 KB Output isn't correct
5 Correct 18 ms 39500 KB Output is correct
6 Incorrect 19 ms 39416 KB Output isn't correct
7 Incorrect 18 ms 39420 KB Output isn't correct
8 Correct 18 ms 39500 KB Output is correct
9 Incorrect 18 ms 39412 KB Output isn't correct
10 Correct 20 ms 39500 KB Output is correct
11 Correct 26 ms 39380 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 39592 KB Output is correct
2 Correct 20 ms 39468 KB Output is correct

Subtask #3
0 / 4.0

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

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 40468 KB Output is correct
2 Correct 33 ms 42180 KB Output is correct
3 Incorrect 27 ms 40912 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 43308 KB Output is correct
2 Correct 62 ms 45608 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 53356 KB Output is correct
2 Correct 89 ms 54596 KB Output is correct
3 Correct 104 ms 59276 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 62956 KB Output is correct
2 Correct 180 ms 78792 KB Output is correct
3 Correct 187 ms 77504 KB Output is correct
4 Correct 220 ms 94840 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 97656 KB Output is correct
2 Correct 775 ms 113592 KB Output is correct
3 Correct 271 ms 87876 KB Output is correct
4 Correct 322 ms 107652 KB Output is correct
5 Correct 320 ms 108364 KB Output is correct
6 Incorrect 901 ms 100940 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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