oj.uz

Submission #555515

# Submission time Handle Problem Language Result Execution time Memory
555515 2022-05-01T07:09:23 Z alextodoran Islands (IOI08_islands) C++17
80 / 100
 750 ms 131072 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

#pragma comment(linker, "/STACK:16777216")

using namespace std;

typedef long long ll;

const int N_MAX = 1000000;

int N;
struct Edge {
    int to;
    int len;
};
vector <Edge> adj[N_MAX + 2];

bool seen[N_MAX + 2];
Edge par[N_MAX + 2];
int depth[N_MAX + 2];

tuple <int, int, int> backEdge;

void dfs (int u) {
    seen[u] = true;
    for (Edge e : adj[u]) {
        if (seen[e.to] == false) {
            par[e.to] = Edge{u, e.len};
            depth[e.to] = depth[u] + 1;
            dfs(e.to);
        } else if (depth[e.to] > depth[u]) {
            backEdge = make_tuple(u, e.to, e.len);
        }
    }
}

bool root[N_MAX + 2];

ll maxAny[N_MAX + 2];
ll maxDown[N_MAX + 2];

void compute (int s) {
    queue <int> q; q.push(s);
    seen[s] = true; depth[s] = 0;
    vector <int> order;
    while (q.empty() == false) {
        int u = q.front(); q.pop();
        order.push_back(u);
        for (Edge e : adj[u]) {
            if (seen[e.to] == false && root[e.to] == false) {
                q.push(e.to);
                seen[e.to] = true;
                depth[e.to] = depth[u] + 1;
            }
        }
    }
    reverse(order.begin(), order.end());
    for (int u : order) {
        vector <ll> maxDowns;
        for (Edge e : adj[u]) {
            if (depth[u] < depth[e.to] && root[e.to] == false) {
                maxAny[u] = max(maxAny[u], maxAny[e.to]);
                maxDown[u] = max(maxDown[u], maxDown[e.to] + e.len);
                maxDowns.push_back(maxDown[e.to] + e.len);
            }
        }
        sort(maxDowns.begin(), maxDowns.end(), greater <ll> ());
        if ((int) maxDowns.size() >= 2) {
            maxAny[u] = max(maxAny[u], maxDowns[0] + maxDowns[1]);
        }
        maxAny[u] = max(maxAny[u], maxDown[u]);
    }
}

vector <vector <int>> rootGroups;

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N;
    for (int u = 1; u <= N; u++) {
        Edge e;
        cin >> e.to >> e.len;
        adj[u].push_back(Edge{e.to, e.len});
        adj[e.to].push_back(Edge{u, e.len});
    }

    for (int u = 1; u <= N; u++) {
        if (seen[u] == false) {
            dfs(u);
            int v1, v2, len; tie(v1, v2, len) = backEdge;
            swap(v1, v2);
            par[v2] = Edge{v1, len};
            rootGroups.push_back({});
            int v = v1;
            while (v != v2) {
                root[v] = true;
                rootGroups.back().push_back(v);
                v = par[v].to;
            }
            root[v] = true;
            rootGroups.back().push_back(v);
        }
    }

    fill(seen + 1, seen + N + 1, false);
    for (int u = 1; u <= N; u++) {
        if (root[u] == true) {
            compute(u);
        }
    }

    ll answer = 0;
    for (vector <int> &roots : rootGroups) {
        ll totalLen = 0;
        ll maxLen = 0;
        for (int u : roots) {
            totalLen += par[u].len;
            maxLen = max(maxLen, maxAny[u]);
        }

        multiset <ll> s; ll len = 0;
        for (int i = (int) roots.size() - 1; i > 0; i--) {
            len += par[roots[i]].len;
            s.insert(maxDown[roots[i]] + len);
        }
        ll lazy = 0;

        for (int i = 0, u = roots[0]; i < (int) roots.size(); i++) {
            maxLen = max(maxLen, *s.rbegin() + lazy + maxDown[u]);
            s.insert(maxDown[u] - lazy);
            lazy += par[u].len;
            u = par[u].to;
            s.erase(s.find((maxDown[u] + totalLen) - lazy));
        }
        answer += maxLen;
    }
    cout << answer << "\n";

    return 0;
}

Compilation message

islands.cpp:11: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   11 | #pragma comment(linker, "/STACK:16777216")
      |

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23732 KB Output is correct
2 Correct 12 ms 23816 KB Output is correct
3 Correct 13 ms 23812 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 13 ms 23812 KB Output is correct
6 Correct 12 ms 23788 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 13 ms 23800 KB Output is correct
9 Correct 13 ms 23840 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 15 ms 23820 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23892 KB Output is correct
2 Correct 12 ms 23952 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 24020 KB Output is correct
2 Correct 15 ms 24404 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 25212 KB Output is correct
2 Correct 37 ms 28372 KB Output is correct
3 Correct 25 ms 25616 KB Output is correct
4 Correct 17 ms 24660 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 30032 KB Output is correct
2 Correct 66 ms 33580 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 40932 KB Output is correct
2 Correct 162 ms 47156 KB Output is correct
3 Correct 194 ms 59072 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 204 ms 53320 KB Output is correct
2 Correct 281 ms 81632 KB Output is correct
3 Correct 459 ms 88384 KB Output is correct
4 Correct 467 ms 111848 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 380 ms 108840 KB Output is correct
2 Runtime error 750 ms 131072 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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