oj.uz

Submission #390263

# Submission time Handle Problem Language Result Execution time Memory
390263 2021-04-15T17:26:37 Z parsabahrami Islands (IOI08_islands) C++17
80 / 100
 1735 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 int                         unsigned int 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 1e6 + 1;
int n, bads[N / 2], rt[N], P[N], out[N], w[N], R, ptrb, ptrv, b; ll A[N], ret[N], H[N], S;
vector<int> adj[N]; bitset<N> C;

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) {
    if (!~b || H[b] < H[v]) b = v;
    adj[v].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);
    }
    adj[v].pop_back();
}

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

ll CYC(int v, int p = -1) {
    ll ans = -1e18; adj[v].push_back(v);
    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;
        }
    }
    adj[v].pop_back();
    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; adj[v].push_back(v);
    for (int &id : adj[v]) {
        int u = out[id] ^ id ^ v;
        if (C[u] && u != p && u != R) {
            ans = CYC2(u, v);
            break;
        }
    }
    adj[v].pop_back();
    ret[Find(v)] = max(ret[Find(v)], ans + A[v] + H[v]);
    return max(ans, S - H[v] + A[v]);
}

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

Compilation message

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

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 17 ms 23760 KB Output is correct
3 Correct 16 ms 23872 KB Output is correct
4 Correct 16 ms 23756 KB Output is correct
5 Correct 16 ms 23756 KB Output is correct
6 Correct 15 ms 23820 KB Output is correct
7 Correct 15 ms 23796 KB Output is correct
8 Correct 16 ms 23740 KB Output is correct
9 Correct 21 ms 23864 KB Output is correct
10 Correct 15 ms 23776 KB Output is correct
11 Correct 16 ms 23760 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 23888 KB Output is correct

Subtask #3
4.0 / 4.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 24932 KB Output is correct
2 Correct 39 ms 27176 KB Output is correct
3 Correct 32 ms 25108 KB Output is correct
4 Correct 21 ms 24472 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 28484 KB Output is correct
2 Correct 62 ms 31552 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 38120 KB Output is correct
2 Correct 137 ms 43460 KB Output is correct
3 Correct 166 ms 51156 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 50372 KB Output is correct
2 Correct 265 ms 70816 KB Output is correct
3 Correct 323 ms 81220 KB Output is correct
4 Correct 373 ms 94156 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 402 ms 92840 KB Output is correct
2 Correct 1198 ms 122344 KB Output is correct
3 Correct 379 ms 75664 KB Output is correct
4 Correct 531 ms 110284 KB Output is correct
5 Correct 522 ms 110136 KB Output is correct
6 Correct 1735 ms 79196 KB Output is correct
7 Runtime error 537 ms 131076 KB Execution killed with signal 9

Subtask #9
0 / 10.0

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