oj.uz

답안 #331534

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
331534 2020-11-28T20:18:29 Z quindecim Islands (IOI08_islands) C++14
90 / 100
 683 ms 131076 KB 
#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9+7;
const int MX = 1e6+10;
const ll INF = 1ll<<60;

int n, m, r, a[MX], w[MX];
vector<int> adj[MX];
ll ans, ret;
vector<ll> V, S;
bitset<MX> vv;

inline int cycle(int u) {
    if(vv[u]) return u;
    vv[u] = 1;
    r = cycle(a[u]);
    if(r) {
        V.push_back(u);
        S.push_back(w[u]);
        if(r==u) return 0;
        else return r;
    }
    vv[u] = 0;
    return 0;
}

inline ll dfs(int u) {
    ll mx = 0;
    vv[u] = 1;
    for(int &v : adj[u]) {
        if(!vv[v]) {
            ll r = dfs(v) + w[v];
            ret = max(ret, mx+r);
            mx = max(mx, r);
        }
    }
    return mx;
}

inline void solve(int u) {
    V.clear(); S.clear();
    cycle(u);
    reverse(V.begin(), V.end());
    reverse(S.begin(), S.end());
    for(auto &v : V) v = dfs(v);
    m = V.size();
    for(int i = m-1; i > 0; --i) swap(S[i], S[i-1]);
    for(int i = 1; i < m; ++i) S[i] += S[i-1];
    ll m1 = -INF, m2 = -INF;
    for(int i = 0; i < m; ++i) {
        ret = max(ret, max(m1+S[i]+V[i], m2-S[i]+V[i]+S[m-1]));
        m1 = max(m1, V[i]-S[i]);
        m2 = max(m2, V[i]+S[i]);
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i] >> w[i];
        adj[a[i]].push_back(i);
    }
    for(int i = 1; i <= n; ++i)
        if(!vv[i]) solve(i), ans+=ret, ret = 0;
    cout << ans << "\n";
    return 0;
}

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct
3 Correct 16 ms 23836 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 16 ms 23788 KB Output is correct
6 Correct 16 ms 23788 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 16 ms 23788 KB Output is correct
9 Correct 16 ms 23788 KB Output is correct
10 Correct 16 ms 23788 KB Output is correct
11 Correct 16 ms 23788 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23936 KB Output is correct
2 Correct 16 ms 23916 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23916 KB Output is correct
2 Correct 19 ms 24172 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 24684 KB Output is correct
2 Correct 31 ms 26348 KB Output is correct
3 Correct 24 ms 24684 KB Output is correct
4 Correct 23 ms 24480 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 27496 KB Output is correct
2 Correct 45 ms 29548 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 79 ms 33132 KB Output is correct
2 Correct 87 ms 40720 KB Output is correct
3 Correct 128 ms 46856 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 42220 KB Output is correct
2 Correct 185 ms 56616 KB Output is correct
3 Correct 191 ms 72868 KB Output is correct
4 Correct 233 ms 76928 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 248 ms 40796 KB Output is correct
2 Correct 560 ms 92232 KB Output is correct
3 Correct 238 ms 51308 KB Output is correct
4 Correct 316 ms 79824 KB Output is correct
5 Correct 309 ms 77440 KB Output is correct
6 Correct 683 ms 55660 KB Output is correct
7 Correct 351 ms 104716 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 396 ms 131072 KB Output is correct
2 Correct 324 ms 91628 KB Output is correct
3 Runtime error 338 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -