oj.uz

답안 #488914

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488914 2021-11-20T19:32:06 Z dxz05 Islands (IOI08_islands) C++14
44 / 100
 611 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>

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 + 5;
const int M = 222;

int f[N]; int w[N];
bitset<N> used;
stack<int> st;

vector<int> cycle;

void dfs0(int v){
    if (!cycle.empty()) return;
    used[v] = true;
    st.push(v);

    if (used[f[v]]){
        while (!st.empty()){
            int x = st.top(); st.pop();
            cycle.push_back(x);
            if (x == f[v]) break;
        }
        return;
    }
    if (!cycle.empty()) return;

    dfs0(f[v]);

    if (!st.empty()) st.pop();
}

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

vector<int> g[N];

bitset<N> incycle;

int A(int u, 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]);
}

void dfs(int v, int p, ll d, int root, vector<int> &tree, vector<ll> &dist, bool flag){
    tree.push_back(v);
    dist.push_back(d);
    for (int u : g[v]){
        if (u != p){
            if (u == root || !incycle[u]) dfs(u, v, d + A(u, v), root, tree, dist, flag);
        }
    }
    if (flag) g[v].clear();
}

ll arr[N];

ll component(int root){
    cycle.clear();
    while (!st.empty()) st.pop();

    dfs0(root);

    for (int v : cycle){
        incycle[v] = true;
    }

    ll ans = 0;
    vector<int> tree; vector<ll> dist;
    for (int v : cycle){
        dfs(v, v, 0, v, tree, dist, false);

        int i = max_element(all(dist)) - dist.begin();
        ans = max(ans, dist[i]);
        arr[v] = dist[i];
        int u = tree[i];

        tree.clear(); dist.clear();
        dfs(u, u, 0, v, tree, dist, true);

        ans = max(ans, *max_element(all(dist)));
        tree.clear(), dist.clear();
    }

    int n = cycle.size();

    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 = {arr[cycle[0]]};
    ll sum = 0;
    for (int i = 1; i < n; i++){
        sum += A(cycle[i - 1], cycle[i]);
        a.push_back(arr[cycle[i]] + sum);
    }
    sum += A(cycle[0], cycle.back());

//    for (int x : cycle) cout << x << ' '; cout << endl;
//    for (ll x : a) cout << x << ' '; cout << endl;

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

    vector<ll> sf(n, a.back());
    for (int i = n - 2; i >= 0; i--) sf[i] = max(sf[i + 1], a[i]);

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

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

//        for (int j = 1; j <= n; j++) cout << ST.get(j, j) << ' '; cout << endl;
    }

    return ans;
}

void solve(int TC) {
    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];
        parent[find(i)] = find(f[i]);
        if (f[f[i]] != i){
            g[i].emplace_back(f[i]);
            g[f[i]].emplace_back(i);
        }
    }

    bitset<N> comp;

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

    cout << ans;

}

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

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
//    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    return 0;
}

Subtask #1
30.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23884 KB Output is correct
2 Incorrect 13 ms 23892 KB Output isn't correct
3 Correct 14 ms 24012 KB Output is correct
4 Correct 14 ms 23884 KB Output is correct
5 Correct 13 ms 23884 KB Output is correct
6 Correct 13 ms 23884 KB Output is correct
7 Correct 13 ms 23868 KB Output is correct
8 Correct 13 ms 23884 KB Output is correct
9 Correct 13 ms 23884 KB Output is correct
10 Correct 12 ms 23860 KB Output is correct
11 Correct 12 ms 23932 KB Output is correct

Subtask #2
0 / 3.0

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

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23992 KB Output is correct
2 Correct 14 ms 24344 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 24908 KB Output is correct
2 Correct 28 ms 27500 KB Output is correct
3 Incorrect 21 ms 25292 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 28928 KB Output is correct
2 Incorrect 47 ms 31156 KB Output isn't correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 82 ms 36792 KB Output is correct
2 Correct 113 ms 44432 KB Output is correct
3 Correct 117 ms 55120 KB Output is correct

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 295 ms 82800 KB Output is correct
2 Runtime error 611 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 131076 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -