Submission #406772

# Submission time Handle Problem Language Result Execution time Memory
406772 2021-05-18T04:50:46 Z Joshc Islands (IOI08_islands) C++11
90 / 100
937 ms 131072 KB
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
 
const int MAX_N = 1000001;

#define pii pair<int, int>
#define f first
#define s second
#define ll long long

int t[MAX_N], l[MAX_N], vis[MAX_N], b;
ll m, ans = 0;
vector<int> edges[MAX_N];

void dfs2(int x, int p, ll d, vector<int> &cur) {
    cur.push_back(x);
    if (d > m) {
        m = d;
        b = x;
    }
    for (int i : edges[x]) {
        if (vis[i] && i != p) dfs2(i, x, d+l[i], cur);
    }
    if (vis[t[x]] && t[x] != p) dfs2(t[x], x, d+l[x], cur);
}

void dfs3(int x, int p, ll d) {
    m = max(m, d);
    for (int i : edges[x]) {
        if ((vis[x] || vis[i]) && i != p) dfs3(i, x, d+l[i]);
    }
    if ((vis[x] || vis[t[x]]) && t[x] != p) dfs3(t[x], x, d+l[x]);
}

void solve(int v) {
    ll best = 0, len = l[v], psa = 0, x = -1e9, y = -1e9;
    for (int i=t[v]; i!=v; i=t[i]) len += l[i];
    int i = v;
    do {
        vector<int> cur;
        m = -1;
        dfs2(i, i, 0, cur);
        best = max(best, max(psa+m+x, len+m-psa+y));
        x = max(x, m-psa);
        y = max(y, m+psa);
        psa += l[i];
        m = -1;
        dfs3(b, b, 0);
        best = max(best, m);
        i = t[i];
    } while (i != v);
    ans += best;
}

void dfs(int v, int c) {
    vis[v] = c;
    if (vis[t[v]] == c) {
        vis[v] = 0;
        for (int i=t[v]; i!=v; i=t[i]) vis[i] = 0;
        solve(v);
    }
    if (vis[t[v]] == -1) dfs(t[v], c);
}

int main() {
    int n;
    scanf("%d", &n);
    for (int i=1; i<=n; i++) {
        scanf("%d%d", &t[i], &l[i]);
        vis[i] = -1;
        edges[t[i]].push_back(i);
    }
    for (int i=1; i<=n; i++) {
        if (vis[i] == -1) dfs(i, i);
    }
    printf("%lld\n", ans);
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:69:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
islands.cpp:71:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   71 |         scanf("%d%d", &t[i], &l[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23764 KB Output is correct
3 Correct 13 ms 23704 KB Output is correct
4 Correct 14 ms 23756 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 13 ms 23764 KB Output is correct
7 Correct 14 ms 23676 KB Output is correct
8 Correct 14 ms 23716 KB Output is correct
9 Correct 13 ms 23756 KB Output is correct
10 Correct 14 ms 23740 KB Output is correct
11 Correct 14 ms 23768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 23788 KB Output is correct
2 Correct 14 ms 23836 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 14 ms 23776 KB Output is correct
2 Correct 15 ms 23904 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 21 ms 24388 KB Output is correct
2 Correct 28 ms 25084 KB Output is correct
3 Correct 23 ms 24788 KB Output is correct
4 Correct 18 ms 24160 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 36 ms 25548 KB Output is correct
2 Correct 46 ms 27496 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 84 ms 30020 KB Output is correct
2 Correct 110 ms 33972 KB Output is correct
3 Correct 110 ms 31812 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 150 ms 37680 KB Output is correct
2 Correct 177 ms 37880 KB Output is correct
3 Correct 235 ms 49892 KB Output is correct
4 Correct 244 ms 43940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 287 ms 45980 KB Output is correct
2 Correct 618 ms 52156 KB Output is correct
3 Correct 284 ms 48492 KB Output is correct
4 Correct 348 ms 54060 KB Output is correct
5 Correct 341 ms 51588 KB Output is correct
6 Correct 937 ms 59008 KB Output is correct
7 Correct 400 ms 54496 KB Output is correct
# Verdict Execution time Memory Grader output
1 Runtime error 387 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -