oj.uz

Submission #650679

# Submission time Handle Problem Language Result Execution time Memory
650679 2022-10-14T16:24:02 Z Spade1 Islands (IOI08_islands) C++14
64 / 100
 344 ms 131072 KB 
#include<bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;

const int N = 1e6 + 10;

vector<pair<int, pll>> adj[N];
bool vis[N];

int cycle;

vector<pll> v;
ll dp[N], qs[N], ans, cur;

pll dfs2(int i, int prt1, int prt2) {
    ll mx_w = 0, mx = i;
    for (auto [j, w] : adj[i]) {
        if (j == prt1 || j == prt2) continue;
        pll ret = dfs2(j, i, 0);
        if (ret.nd + w.nd > mx_w) {
            mx_w = ret.nd + w.nd;
            mx = ret.st;
        }
    }
    return {mx, mx_w};
}

int dfs(int i, int ed, int prt) {
    if (vis[i]) {
        cycle = prt;
        return i;
    }
    vis[i] = 1;
    int ret = 0, K, W;
    for (auto [j, w] : adj[i]) {
        if (j == prt && ed == w.st) continue;
        if (ret != 0 && vis[j]) continue;
        int k = dfs(j, w.st, i);
        if (k) {
            ret = k;
            K = j;
            W = w.nd;
        }
    }
    if (ret == i) {
        auto [val, w] = dfs2(i, K, cycle);
        v.pb({w, W});
        return 0;
    }
    else if (ret) {
        auto [val, w] = dfs2(i, prt, K);
        v.pb({w, W});
    }
    return ret;
}

void solve() {
    int n; cin >> n;
    for (int i = 1; i <= n; ++i) {
        int b, w; cin >> b >> w;
        adj[i].pb({b ,{i, w}});
        adj[b].pb({i, {i, w}});
    }

    for (int i = 1; i <= n; ++i) {
        if (vis[i]) continue;
        dfs(i, 0, 0);
        int m = v.size();
        for (int j = 0; j <= m+1; ++j) qs[j] = 0, dp[j] = 0;
        for (int j = 1; j <= m; ++j) {
            qs[j] = qs[j-1] + v[j-1].nd;
            dp[j] = qs[j] + v[j-1].st;
        }
        for (int j = m-1; j > 0; --j) dp[j] = max(dp[j], dp[j+1]);
        for (int j = 1; j < m; ++j) {
            cur = max(cur, v[j-1].st - qs[j] + dp[j+1]);
        }
        for (int j = 0; j <= m+1; ++j) dp[j] = 0;
        for (int j = m; j >= 1; --j) {
            dp[j] = qs[j] + v[j-1].st;
        }
        for (int j = 2; j <= m; ++j) dp[j] = max(dp[j], dp[j-1]);
        for (int j = 2; j <= m; ++j) {
            cur = max(cur, qs[m] + v[j-1].st - qs[j] + dp[j-1]);
        }
        ans += cur;
        v.clear();
        cur = 0, cycle = 0;
    }
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}

Compilation message

islands.cpp: In function 'std::pair<long long int, long long int> dfs2(int, int, int)':
islands.cpp:24:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   24 |     for (auto [j, w] : adj[i]) {
      |               ^
islands.cpp: In function 'int dfs(int, int, int)':
islands.cpp:42:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   42 |     for (auto [j, w] : adj[i]) {
      |               ^
islands.cpp:53:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   53 |         auto [val, w] = dfs2(i, K, cycle);
      |              ^
islands.cpp:58:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   58 |         auto [val, w] = dfs2(i, prt, K);
      |              ^
islands.cpp:53:41: warning: 'K' may be used uninitialized in this function [-Wmaybe-uninitialized]
   53 |         auto [val, w] = dfs2(i, K, cycle);
      |                                         ^

Subtask #1
27.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23772 KB Output is correct
2 Incorrect 14 ms 23764 KB Output isn't correct
3 Correct 13 ms 23892 KB Output is correct
4 Correct 13 ms 23824 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 15 ms 23820 KB Output is correct
7 Correct 13 ms 23756 KB Output is correct
8 Correct 13 ms 23820 KB Output is correct
9 Correct 14 ms 23784 KB Output is correct
10 Incorrect 15 ms 23820 KB Output isn't correct
11 Correct 14 ms 23732 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23968 KB Output is correct
2 Correct 17 ms 23852 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23892 KB Output is correct
2 Correct 14 ms 24436 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 25368 KB Output is correct
2 Correct 38 ms 29136 KB Output is correct
3 Correct 31 ms 25608 KB Output is correct
4 Incorrect 17 ms 24660 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 30500 KB Output is correct
2 Correct 49 ms 34724 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 40220 KB Output is correct
2 Correct 117 ms 52608 KB Output is correct
3 Correct 130 ms 68528 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 53080 KB Output is correct
2 Correct 194 ms 94704 KB Output is correct
3 Correct 237 ms 108320 KB Output is correct
4 Correct 291 ms 131072 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 303 ms 79668 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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