oj.uz

Submission #503790

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

struct dsu {
    vector<int> p;
    vector<int> sz;
    int n;

    dsu(int _n) : n(_n) {
        p.resize(n);
        iota(p.begin(), p.end(), 0);
        sz.assign(n, 1);
    }

    inline int get(int x) {
        if (p[x] == x) {
            return x;
        } else {
            return p[x] = get(p[x]);
        }
    }

    inline bool unite(int x, int y) {
        x = get(x);
        y = get(y);
        if (x == y) {
            return false;
        }
        if (sz[x] > sz[y]) {
            swap(x, y);
        }
        p[x] = y;
        sz[y] += sz[x];
        return true;
    }

    inline bool same(int x, int y) {
        return (get(x) == get(y));
    }
};

const int N = (int) 1e6;
int l[N];
int nxt[N];
vector<int> vs[N];
long long dist[N];
long long max_dist[N];
bool cycle[N];
bool was[N];
vector<int> g[N];
int p[N];

int dsu_get(int x) {
    if (p[x] == x) {
        return x;
    } else {
        return p[x] = dsu_get(p[x]);
    }
}

bool dsu_unite(int x, int y) {
    x = dsu_get(x);
    y = dsu_get(y);
    if (x == y) {
        return false;
    }
    p[x] = y;
    return true;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    iota(p, p + n, 0);
    for (int i = 0; i < n; i++) {
        int j;
        cin >> j >> l[i];
        j--;
        g[j].emplace_back(i);
        dsu_unite(i, j);
        nxt[i] = j;
    }
    for (int i = 0; i < n; i++) {
        vs[dsu_get(i)].emplace_back(i);
    }
    long long ans = 0;
    queue<int> que;
    deque<pair<int, long long>> deq;
    for (int i = 0; i < n; i++) {
        if (i != dsu_get(i)) {
            continue;
        }
        int c = i;
        while (!was[c]) {
            was[c] = 1;
            c = nxt[c];
        }
        int u = nxt[c];
        cycle[c] = 1;
        vector<int> x(1, c);
        while (u != c) {
            cycle[u] = 1;
            x.emplace_back(u);
            u = nxt[u];
        }
        vector<int> order;
        for (int j : x) {
            que.emplace(j);
            while (!que.empty()) {
                int v = que.front();
                order.emplace_back(v);
                que.pop();
                for (int to : g[v]) {
                    if (cycle[to]) {
                        continue;
                    }
                    dist[to] = dist[v] + l[to];
                    que.emplace(to);
                }
            }
        }
        long long t = 0;
        reverse(order.begin(), order.end());
        for (int v : order) {
            max_dist[v] = max(max_dist[v], dist[v]);
            if (cycle[v]) {
                continue;
            }
            int to = nxt[v];
            t = max(t, max_dist[to] + max_dist[v] - dist[to] * 2);
            max_dist[to] = max(max_dist[to], max_dist[v]);
        }
        deq.emplace_back(0, 0);
        long long y = l[c];
        int sz = (int) x.size();
        for (int jj = 1; jj < sz * 2; jj++) {
            int j = jj % sz;
            if (x[deq.front().first] == x[j]) {
                deq.pop_front();
            }
            t = max(t, y + max_dist[x[j]] - deq.front().second);
            long long z = y - max_dist[x[j]];
            while (!deq.empty() && deq.back().second >= z) {
                deq.pop_back();
            }
            y += l[x[j]];
            deq.emplace_back(j, z);
        }
        deq.clear();
        ans += t;
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47308 KB Output is correct
2 Correct 22 ms 47308 KB Output is correct
3 Correct 22 ms 47256 KB Output is correct
4 Correct 22 ms 47240 KB Output is correct
5 Correct 22 ms 47328 KB Output is correct
6 Correct 27 ms 47264 KB Output is correct
7 Correct 24 ms 47308 KB Output is correct
8 Correct 26 ms 47252 KB Output is correct
9 Correct 25 ms 47220 KB Output is correct
10 Correct 22 ms 47280 KB Output is correct
11 Correct 22 ms 47308 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47404 KB Output is correct
2 Correct 24 ms 47368 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47468 KB Output is correct
2 Correct 23 ms 47540 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 48216 KB Output is correct
2 Correct 36 ms 49308 KB Output is correct
3 Correct 31 ms 48724 KB Output is correct
4 Correct 26 ms 47956 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 50240 KB Output is correct
2 Correct 52 ms 52936 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 58484 KB Output is correct
2 Correct 92 ms 63376 KB Output is correct
3 Correct 98 ms 64280 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 69240 KB Output is correct
2 Correct 173 ms 77064 KB Output is correct
3 Correct 177 ms 91300 KB Output is correct
4 Correct 203 ms 91304 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 253 ms 90740 KB Output is correct
2 Correct 516 ms 104116 KB Output is correct
3 Correct 237 ms 88956 KB Output is correct
4 Correct 303 ms 103076 KB Output is correct
5 Correct 303 ms 103064 KB Output is correct
6 Correct 919 ms 105288 KB Output is correct
7 Correct 314 ms 117856 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 333 ms 126476 KB Output is correct
2 Correct 301 ms 113952 KB Output is correct
3 Runtime error 308 ms 131076 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -