oj.uz

Submission #390230

# Submission time Handle Problem Language Result Execution time Memory
390230 2021-04-15T15:42:00 Z parsabahrami Islands (IOI08_islands) C++17
80 / 100
 1847 ms 131076 KB 
/* There's someone in my head but it's not me */ 
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 1e6 + 10;
int n, rt[N], P[N], C[N], M[N], out[N], w[N], R; ll A[N], ret[N], H[N], S[N];
vector<int> adj[N], vec; vector<vector<int>> comps;

int Find(int v) {
    return !rt[v] ? v : rt[v] = Find(rt[v]);
}

int Union(int v, int u) {
    u = Find(u), v = Find(v);
    if (u == v) return 1;
    rt[u] = v; 
    return 0;
}

void preDFS(int v, int tr, int p = -1) {
    vec.push_back(v);
    for (int id : adj[v]) {
        int u = out[id] ^ id ^ v;
        if ((!C[u] || u == tr) && u != p) 
            H[u] = H[v] + w[id], preDFS(u, tr, v);
    }
}

void cycDFS(int v, int tr, int p = -1) {
    P[v] = p; vec.push_back(v);
    for (int id : adj[v]) {
        if (id != tr) {
            int u = out[id] ^ id ^ v;
            if (u != p) cycDFS(u, tr, v);
        }
    }
}


ll CYC(int v, int p = -1) {
    ll ans = -1e18;
    for (int id : adj[v]) {
        int u = out[id] ^ id ^ v;
        if (C[u] && u != p && u != R) {
            H[u] = H[v] + w[id], ans = CYC(u, v);
            break;
        }
    }
    ret[Find(v)] =  max(ret[Find(v)], ans + A[v] - H[v]);
    return max(ans, A[v] + H[v]);
}

ll CYC2(int v, int p = -1) {
    ll ans = -1e18;
    for (int id : adj[v]) {
        int u = out[id] ^ id ^ v;
        if (C[u] && u != p && u != R) {
            ans = CYC2(u, v);
            break;
        }
    }
    ret[Find(v)] = max(ret[Find(v)], ans + A[v] + H[v]);
    return max(ans, S[Find(v)] - H[v] + A[v]);
}

int main() {
    scanf("%d", &n);
    vector<int> bads;
    for (int i = 1; i <= n; i++) {
        scanf("%d%d", &out[i], &w[i]);
        adj[i].push_back(i);
        adj[out[i]].push_back(i);
        if (Union(i, out[i])) 
            bads.push_back(i);
    } 
    for (int id : bads) {
        vec = {};
        cycDFS(out[id], id); 
        comps.push_back(vec);
        int v = id; 
        while (~v) 
            C[v] = 1, v = P[v];
    } 
    for (int i = 1; i <= n; i++) {
        if (!C[i]) continue;
        vec = {}, preDFS(i, i);
        for (int id : adj[i]) {
            int u = out[id] ^ id ^ i;
            if (C[u]) S[Find(i)] += w[id];
        }
        int b = -1;
        for (int v : vec) 
            if (!~b || H[b] < H[v]) b = v;
        A[i] = H[b]; vec = {};
        H[b] = 0, preDFS(b, i);
        b = -1;
        for (int v : vec) 
            if (!~b || H[b] < H[v]) b = v;
        ret[Find(i)] = max(ret[Find(i)], H[b]);
    }
    ll res = 0;
    for (auto &c : comps) {
        S[Find(c.back())] >>= 1;
        for (int &v : c) 
            if (C[v]) R = v; 
        H[R] = 0;
        CYC(R), CYC2(R);
        res += ret[Find(c.back())];
    }
    printf("%lld\n", res);
    return 0;
}

Compilation message

islands.cpp: In function 'int main()':
islands.cpp:75:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   75 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
islands.cpp:78:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   78 |         scanf("%d%d", &out[i], &w[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 23756 KB Output is correct
2 Correct 15 ms 23816 KB Output is correct
3 Correct 16 ms 23840 KB Output is correct
4 Correct 16 ms 23756 KB Output is correct
5 Correct 15 ms 23756 KB Output is correct
6 Correct 15 ms 23756 KB Output is correct
7 Correct 15 ms 23756 KB Output is correct
8 Correct 15 ms 23796 KB Output is correct
9 Correct 16 ms 23756 KB Output is correct
10 Correct 15 ms 23816 KB Output is correct
11 Correct 15 ms 23756 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 24012 KB Output is correct
2 Correct 18 ms 24228 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 25020 KB Output is correct
2 Correct 40 ms 27828 KB Output is correct
3 Correct 29 ms 25716 KB Output is correct
4 Correct 23 ms 24780 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 28896 KB Output is correct
2 Correct 63 ms 32172 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 40164 KB Output is correct
2 Correct 135 ms 44300 KB Output is correct
3 Correct 167 ms 51936 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 53428 KB Output is correct
2 Correct 279 ms 79356 KB Output is correct
3 Correct 338 ms 88236 KB Output is correct
4 Correct 380 ms 104996 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 419 ms 100864 KB Output is correct
2 Correct 1237 ms 131072 KB Output is correct
3 Correct 396 ms 92804 KB Output is correct
4 Correct 542 ms 127920 KB Output is correct
5 Correct 517 ms 128160 KB Output is correct
6 Correct 1847 ms 101940 KB Output is correct
7 Runtime error 505 ms 131076 KB Execution killed with signal 9

Subtask #9
0 / 10.0

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