oj.uz

Submission #489255

# Submission time Handle Problem Language Result Execution time Memory
489255 2021-11-21T18:28:14 Z dxz05 Islands (IOI08_islands) C++11
90 / 100
 1071 ms 131076 KB 
//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")

#include <iostream>
#include <vector>
#include <bitset>
#include <stack>
#include <algorithm>
#include <chrono>
#include <random>
using namespace std;

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()

#define MP make_pair

typedef long long ll;
const double eps = 0.000001;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 1;
const int M = 222;

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

int f[N], w[N];

int cyc_sz;
int cycle[N];
stack<int> st;
bitset<N> used;

inline void find_cycle(int x){
    while (!st.empty()) st.pop();
    cyc_sz = 0;
    while (true){
        st.push(x);
        used[x] = true;
        if (used[f[x]]){
            while (!st.empty()){
                int y = st.top(); st.pop();
                cycle[cyc_sz++] = y;
                if (y == f[x]) break;
            }
            return;
        }
        x = f[x];
    }
}

int parent[N];
int find(const int x){
    return (x == parent[x] ? x : parent[x] = find(parent[x]));
}

vector<int> g[N];

inline int A(const int &u, const int &v){
    if (f[u] == v && f[v] != u) return w[u];
    if (f[u] != v && f[v] == u) return w[v];
    return max(w[u], w[v]);
}

int X; ll D;

void dfs(const int v, const int p, const ll d, const int c1, const int c2, const bool flag){
    if (d > D) D = d, X = v;
    for (int u : g[v]){
        if (u != p && u != c1 && u != c2) dfs(u, v, d + A(u, v), c1, c2, flag);
    }
    //if (flag) g[v].clear();
}

ll arr[N];

inline ll component(const int root){
    find_cycle(root);

    const int n = cyc_sz;

    ll ans = 0;
    for (int i = 0; i < n; i++){
        int v = cycle[i];
        D = -1;
        dfs(v, v, 0, cycle[(i + n - 1) % n], cycle[(i + 1) % n], false);

        ans = max(ans, D);
        arr[v] = D;

        D = -1;
        dfs(X, X, 0, cycle[(i + n - 1) % n], cycle[(i + 1) % n], true);

        ans = max(ans, D);
    }

    if (n == 2){
        int u = cycle[0], v = cycle[1];
        ans = max(ans, arr[u] + arr[v] + A(u, v));
        return ans;
    }

    vector<ll> a(n);
    a[0] = {arr[cycle[0]]};
    ll sum = 0;
    for (int i = 1; i < n; i++){
        sum += A(cycle[i - 1], cycle[i]);
        a[i] = arr[cycle[i]] + sum;
    }
    sum += A(cycle[0], cycle[n - 1]);

    ans = max(ans, arr[cycle[0]] + *max_element(a.begin() + 1, a.end()));

    for (int i = n - 2; i >= 0; i--) a[i] = max(a[i + 1], a[i]);

    ll add = 0;
    int v, u;
    ll mx = 0;
    ll sum2 = 0;
    for (int i = 1; i < n; i++){
        v = cycle[i], u = cycle[i - 1];
        add -= A(v, u);
        mx = max(mx, arr[cycle[i - 1]] + sum2 + sum);

        ans = max(ans, arr[v] + add + mx);
        if (i + 1 < n) ans = max(ans, arr[v] + add + a[i + 1]);
        sum2 += A(v, u);
        mx = max(mx, arr[cycle[i]] + sum2);

    }

    return ans;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++) parent[i] = i;

    for (int i = 1; i <= n; i++){
        cin >> f[i] >> w[i];
        if (rng() & 1) parent[find(i)] = find(f[i]); else
            parent[find(f[i])] = find(i);
        if (f[f[i]] != i){
            g[i].push_back(f[i]);
            g[f[i]].push_back(i);
        }
    }

    bitset<N> comp;

    ll ans = 0;
    for (int i = 1; i <= n; i++){
        if (!comp[find(i)]){
            comp[find(i)] = true;
            ans += component(i);
        }
    }

    cout << ans;


    return 0;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23884 KB Output is correct
2 Correct 13 ms 23884 KB Output is correct
3 Correct 12 ms 23960 KB Output is correct
4 Correct 12 ms 23884 KB Output is correct
5 Correct 12 ms 23952 KB Output is correct
6 Correct 12 ms 23852 KB Output is correct
7 Correct 12 ms 23916 KB Output is correct
8 Correct 12 ms 23884 KB Output is correct
9 Correct 13 ms 23908 KB Output is correct
10 Correct 12 ms 23956 KB Output is correct
11 Correct 14 ms 23884 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 24012 KB Output is correct
2 Correct 16 ms 24012 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 24012 KB Output is correct
2 Correct 14 ms 24192 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 24652 KB Output is correct
2 Correct 26 ms 25908 KB Output is correct
3 Correct 21 ms 25036 KB Output is correct
4 Correct 17 ms 24500 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 26892 KB Output is correct
2 Correct 45 ms 29368 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 35012 KB Output is correct
2 Correct 95 ms 36660 KB Output is correct
3 Correct 104 ms 40336 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 44768 KB Output is correct
2 Correct 174 ms 55184 KB Output is correct
3 Correct 192 ms 59524 KB Output is correct
4 Correct 226 ms 66032 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 74856 KB Output is correct
2 Correct 776 ms 82152 KB Output is correct
3 Correct 263 ms 65348 KB Output is correct
4 Correct 335 ms 80328 KB Output is correct
5 Correct 340 ms 81216 KB Output is correct
6 Correct 1071 ms 67972 KB Output is correct
7 Correct 349 ms 89900 KB Output is correct

Subtask #9
0 / 10.0

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