oj.uz

Submission #503747

# Submission time Handle Problem Language Result Execution time Memory
503747 2022-01-08T20:39:01 Z tabr Islands (IOI08_islands) C++17
67 / 100
 2000 ms 131076 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

const int N = (int) 1e6 + 10;
vector<int> g[N];
int l[N];
int e[N];
int was[N];
int pv[N];
int cycle[N];
long long d1[N];
long long d2[N];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int j;
        cin >> j >> l[i];
        j--;
        e[i] = j;
        g[i].emplace_back(i);
        g[j].emplace_back(i);
    }
    for (int i = 0; i < n; i++) {
        if (e[e[i]] == i) {
            l[e[i]] = l[i] = max(l[e[i]], l[i]);
        }
    }
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        if (was[i]) {
            continue;
        }
        int c1 = -1, c2 = -1;
        int sz = 0;
        int dead = -1;
        function<void(int, int)> dfs1 = [&](int v, int pe) {
            was[v] = 1;
            for (auto id : g[v]) {
                if (id == pe) {
                    continue;
                }
                int to = v ^ id ^ e[id];
                if (was[to]) {
                    if (c1 != -1) {
                        continue;
                    }
                    dead = id;
                    c1 = v;
                    c2 = to;
                    cycle[v]++;
                    if (pv[to] != -1) {
                        cycle[pv[to]]--;
                    }
                    continue;
                }
                pv[to] = v;
                dfs1(to, id);
                cycle[v] += cycle[to];
            }
            sz += cycle[v];
        };
        pv[i] = -1;
        dfs1(i, -1);
        for (int j = 0; j <= sz; j++) {
            d1[j] = d2[j] = 0;
        }
        function<void(int, int, int, long long)> dfs2 = [&](int v, int p, int cnt, long long now) {
            cnt += cycle[v];
            d1[cnt] = max(d1[cnt], now);
            for (auto id : g[v]) {
                int to = v ^ id ^ e[id];
                if (to == p || id == dead) {
                    continue;
                }
                dfs2(to, v, cnt, now + l[id]);
            }
        };
        dfs2(c1, c2, 0, 0);
        swap(d1, d2);
        dfs2(c2, c1, 0, 0);
        swap(d1, d2);
        for (int j = 0; j < sz; j++) {
            d1[j + 1] = max(d1[j + 1], d1[j]);
            d2[j + 1] = max(d2[j + 1], d2[j]);
        }
        long long t = 0;
        function<long long(int, int, long long)> dfs3 = [&](int v, int p, long long now) {
            vector<long long> c;
            for (auto id : g[v]) {
                int to = v ^ id ^ e[id];
                if (to == p || id == dead) {
                    continue;
                }
                c.emplace_back(dfs3(to, v, now + l[id]));
            }
            t = max(t, now);
            if (c.empty()) {
                return now;
            }
            sort(c.rbegin(), c.rend());
            if (c.size() > 1) {
                t = max(t, c[0] + c[1] - 2 * now);
            }
            return c[0];
        };
        dfs3(c1, c2, 0);
        dfs3(c2, c1, 0);
        for (int j = 1; j < sz; j++) {
            t = max(t, d1[j] + d2[sz - j] + l[dead]);
        }
        ans += t;
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 39444 KB Output is correct
2 Correct 26 ms 39500 KB Output is correct
3 Correct 21 ms 39444 KB Output is correct
4 Correct 23 ms 39488 KB Output is correct
5 Correct 31 ms 39588 KB Output is correct
6 Correct 40 ms 39380 KB Output is correct
7 Correct 71 ms 39368 KB Output is correct
8 Correct 32 ms 39372 KB Output is correct
9 Correct 98 ms 39420 KB Output is correct
10 Correct 24 ms 39488 KB Output is correct
11 Correct 265 ms 39484 KB Output is correct

Subtask #2
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 39500 KB Output is correct
2 Execution timed out 2085 ms 39536 KB Time limit exceeded

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1181 ms 39664 KB Output is correct
2 Correct 24 ms 39884 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 40496 KB Output is correct
2 Correct 45 ms 43520 KB Output is correct
3 Correct 48 ms 40500 KB Output is correct
4 Correct 42 ms 40012 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 45252 KB Output is correct
2 Correct 85 ms 47184 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 53288 KB Output is correct
2 Correct 143 ms 61872 KB Output is correct
3 Correct 158 ms 76108 KB Output is correct

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 301 ms 62344 KB Output is correct
2 Correct 268 ms 99396 KB Output is correct
3 Correct 330 ms 106664 KB Output is correct
4 Runtime error 279 ms 131076 KB Execution killed with signal 9

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 389 ms 98640 KB Output is correct
2 Runtime error 517 ms 131076 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 320 ms 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -