oj.uz

Submission #1036139

# Submission time Handle Problem Language Result Execution time Memory
1036139 2024-07-27T03:53:38 Z thinknoexit Islands (IOI08_islands) C++17
64 / 100
 210 ms 96680 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1000001;
vector<pair<int, int>> adj[N];
int deg[N], lv[N];
bool cycle[N], vis[N];
ll dp[2][N], qs[N], a[N];
ll res = 0;
int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    for (int i = 1;i <= n;i++) {
        int a, x;
        cin >> a >> x;
        adj[i].push_back({ a, x });
        adj[a].push_back({ i, x });
        deg[i]++, deg[a]++;
    }
    // find cycle using kahn's algorithm
    {
        queue<int> q;
        for (int i = 1;i <= n;i++) {
            cycle[i] = 1;
            if (deg[i] == 1) q.push(i);
        }
        while (!q.empty()) {
            int v = q.front();
            q.pop();
            cycle[v] = 0;
            vis[v] = 1;
            for (auto& x : adj[v]) {
                if (!vis[x.first]) {
                    lv[x.first] = max(lv[x.first], lv[v] + 1);
                }
                if (--deg[x.first] == 1) q.push(x.first);
            }
        }
    }
    memset(vis, 0, sizeof vis);
    //for (int i = 1;i <= n;i++) cout << lv[i] << ' ';
    ll ans = 0;
    // for each component find the longest path and sum up to answer
    for (int i = 1;i <= n;i++) {
        if (!cycle[i] || vis[i]) continue;
        vector<pair<int, int>> c;
        c.push_back({ 0, 0 });
        int now = i, p = -1;
        while (1) {
            bool ch = 0;
            vis[now] = 1;
            for (auto& x : adj[now]) {
                if (!cycle[x.first] || x.first == p) continue;
                c.push_back({ now, x.second });
                if (!vis[x.first]) {
                    p = now;
                    ch = 1;
                    now = x.first;
                    break;
                }
            }
            if (!ch) {
                if ((int)c.size() == 2) { // parallel edge
                    multiset<int> s;
                    for (auto& x : adj[now]) {
                        if (!cycle[x.first]) continue;
                        s.insert(x.second);
                    }
                    s.erase(s.find(c.back().second));
                    c.push_back({ now, *s.begin() });
                }
                break;
            }
        }
        // c is list of cycle in order
        { // dp on tree
            for (auto& x : c) vis[x.first] = 0;
            // bfs
            vector<int> nodes;
            queue<int> q;
            q.push(i), vis[i] = 1;
            while (!q.empty()) {
                int v = q.front();
                q.pop();
                nodes.push_back(v);
                for (auto& x : adj[v]) if (!vis[x.first]) q.push(x.first), vis[x.first] = 1;
            }
            sort(nodes.begin(), nodes.end(), [&](int a, int b) {
                return lv[a] < lv[b];
                });
            for (auto& v : nodes) {
                dp[0][v] = dp[1][v] = 0;
                for (auto& x : adj[v]) {
                    if (lv[x.first] > lv[v] || cycle[x.first]) continue;
                    dp[1][v] = max(dp[1][v], dp[0][x.first] + x.second);
                    if (dp[1][v] > dp[0][v]) swap(dp[0][v], dp[1][v]);
                }
                res = max(res, dp[0][v] + dp[1][v]);
            }
        }
        int sz = c.size() - 1;
        res = 0;
        for (int i = 1;i <= sz;i++) {
            qs[i] = qs[i - 1] + c[i - 1].second;
            a[i] = dp[0][c[i].first];
        }
        ll mx = -1e18, mx2 = -1e18;
        ll sk = c[sz].second;
        for (int i = 1;i <= sz;i++) {
            res = max(res, mx + qs[i] + a[i]);
            res = max(res, mx2 + qs[sz] - qs[i] + a[i] + sk);
            mx = max(mx, -qs[i] + a[i]);
            mx2 = max(mx2, qs[i] + a[i]);
        }
        ans += res;
        //cout << res << ' ';
    }
    cout << ans;
    return 0;
}

Subtask #1
27.0 / 33.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 24924 KB Output is correct
2 Correct 10 ms 24924 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 24920 KB Output is correct
2 Correct 11 ms 25180 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 25948 KB Output is correct
2 Correct 23 ms 27936 KB Output is correct
3 Correct 17 ms 26716 KB Output is correct
4 Incorrect 14 ms 25692 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 25 ms 29076 KB Output is correct
2 Correct 32 ms 32196 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 40008 KB Output is correct
2 Correct 62 ms 41352 KB Output is correct
3 Correct 73 ms 44132 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 49076 KB Output is correct
2 Correct 142 ms 62844 KB Output is correct
3 Correct 140 ms 65788 KB Output is correct
4 Correct 177 ms 73496 KB Output is correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 84644 KB Output is correct
2 Incorrect 191 ms 84724 KB Output isn't correct
3 Halted 0 ms 0 KB -