oj.uz

답안 #503765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
503765 2022-01-08T21:22:09 Z tabr Islands (IOI08_islands) C++17
9 / 100
 595 ms 131076 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<vector<int>> g(n);
    vector<int> l(n);
    vector<int> e(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;
    vector<int> was(n);
    vector<int> pv(n);
    vector<int> cycle(n);
    vector<int> last_id(n);
    for (int i = 0; i < n; i++) {
        if (was[i]) {
            continue;
        }
        int c1 = -1, c2 = -1;
        int sz = 0;
        int dead = -1;
        pv[i] = -1;
        {  // dfs1
            stack<pair<int, int>> stk;
            stk.emplace(i, -1);
            while (!stk.empty()) {
                auto [v, pe] = stk.top();
                was[v] = 1;
                debug(v);
                if (last_id[v] == (int) g[v].size()) {
                    for (auto id : g[v]) {
                        int to = v ^ id ^ e[id];
                        if (to == pv[v]) {
                            continue;
                        }
                        cycle[v] += cycle[to];
                    }
                    if (v == c1 || v == c2) {
                        cycle[v] = 1;
                    }
                    sz += cycle[v];
                    stk.pop();
                    continue;
                }
                int &gid = last_id[v];
                while (gid < (int) g[v].size()) {
                    int id = g[v][gid++];
                    if (id == pe) {
                        continue;
                    }
                    int to = v ^ id ^ e[id];
                    if (was[to]) {
                        debug(v, to);
                        if (c1 != -1) {
                            continue;
                        }
                        dead = id;
                        c1 = v;
                        c2 = to;
                        cycle[v]++;
                        if (pv[to] != -1) {
                            cycle[pv[to]]--;
                        }
                        continue;
                    }
                    pv[to] = v;
                    stk.emplace(to, id);
                    break;
                }
            }
        }
        vector<long long> d1(sz + 1), d2(sz + 1);
        for (int z = 0; z < 2; z++) {
            queue<tuple<int, int, int, long long>> que;
            while (!que.empty()) {
                auto [v, p, cnt, now] = que.front();
                que.pop();
                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;
                    }
                    que.emplace(to, v, cnt, now + l[id]);
                }
            };
            // dfs2(c1, c2, 0, 0);
            swap(c1, c2);
            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);
        debug(t);
        debug(d1);
        debug(d2);
        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
9.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 332 KB Output isn't correct
3 Incorrect 1 ms 332 KB Output isn't correct
4 Incorrect 0 ms 204 KB Output isn't correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Incorrect 0 ms 204 KB Output isn't correct
7 Incorrect 0 ms 204 KB Output isn't correct
8 Incorrect 0 ms 204 KB Output isn't correct
9 Incorrect 0 ms 204 KB Output isn't correct
10 Correct 0 ms 292 KB Output is correct
11 Correct 0 ms 204 KB Output is correct

Subtask #2
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 1752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 7804 KB Output is correct
2 Incorrect 42 ms 11224 KB Output isn't correct

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 19988 KB Output is correct
2 Correct 124 ms 30108 KB Output is correct
3 Incorrect 126 ms 46128 KB Output isn't correct

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 155 ms 34264 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 373 ms 90800 KB Output is correct
2 Runtime error 595 ms 131076 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 329 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -