oj.uz

Submission #998261

# Submission time Handle Problem Language Result Execution time Memory
998261 2024-06-13T12:56:20 Z Ghetto Islands (IOI08_islands) C++17
80 / 100
 839 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pil = pair<int, lint>;
using pli = pair<lint, int>;
const int MAX_N = 1e6 + 5;

int n;
vector<pil> adj[MAX_N];

bool seen[MAX_N];
vector<int> cyc;
bool in_cyc[MAX_N]; // In ANY of the cycles
vector<int> ord;
void dfs1(int u, int par = -1) {
    seen[u] = true, ord.push_back(u);
    bool par_seen = false;
    for (pil x : adj[u]) {
        int v = x.first;
        if (v == par && !par_seen) { par_seen = true; continue; }
        if (!seen[v]) { dfs1(v, u); continue; }
        if (cyc.size()) continue;
        int i = ord.size() - 1;
        while (true) {
            cyc.push_back(ord[i]), in_cyc[ord[i]] = true;
            if (ord[i] == v) break;
            i--;
        }
    }
    ord.pop_back();
}

lint dp[MAX_N];
lint dfs2(int u, int par = -1) {
    lint ans = 0;
    multiset<lint> trans;
    for (pil x : adj[u]) {
        int v = x.first;
        if (v == par || in_cyc[v]) continue;
        ans = max(ans, dfs2(v, u));
        dp[u] = max(dp[u], dp[v] + x.second);
        trans.insert(dp[v] + x.second);
        if (trans.size() > 2) trans.erase(trans.begin());
    }
    
    lint new_ans = 0;
    for (int i = 1; i <= 2; i++)
        if (trans.size()) { new_ans += *trans.rbegin(); trans.erase(next(trans.end(), -1)); }
    ans = max(ans, new_ans);
    return ans;
}

vector<lint> lens;
lint len_sum;
void precomp() {
    if (cyc.size() == 2) {
        set<int> lens_set;
        for (int u : cyc) {
            for (pil x : adj[u]) {
                int v = x.first;
                if (!in_cyc[v]) continue;
                lens_set.insert(x.second);
            }
        }
        lens.insert(lens.begin(), lens_set.begin(), lens_set.end());
        len_sum = lens[0] + lens[1];
        return;       
    }

    for (int i = 0; i < cyc.size(); i++) {
        int aft = (i + 1 == (int) cyc.size()) ? 0 : i + 1;
        int u = cyc[i], v = cyc[aft];
        for (pil x : adj[u]) 
            if (x.first == v) lens.push_back(x.second), len_sum += x.second;
    }
}

lint comp() {
    vector<lint> pref_len = {0};
    for (int i = 1; i < cyc.size(); i++) 
        pref_len.push_back(pref_len.back() + lens[i - 1]);
    
    vector<lint> val(cyc.size());
    multiset<lint> trans;
    for (int i = 1; i < cyc.size(); i++)
        val[i] = dp[cyc[i]] - pref_len[i], trans.insert(val[i]);
    lint shift = 0;
        
    lint ans = 0;
    for (int i = 0; i < cyc.size(); i++) {
        ans = max(ans, dp[cyc[i]] + len_sum + *trans.rbegin() + shift);
        if (i + 1 == (int) cyc.size()) continue;
        trans.erase(trans.find(val[i + 1]));
        val[i] = dp[cyc[i]] - len_sum - shift;
        trans.insert(val[i]);
        shift += lens[i];
    }
    return ans;
}

int main() {
    // freopen("isl.in", "r", stdin), freopen("isl.out", "w", stdout);
    cin >> n;
    for (int u = 1; u <= n; u++) {
        int v; cin >> v;
        lint len; cin >> len;
        adj[u].push_back({v, len}), adj[v].push_back({u, len});
    }

    lint ans = 0;
    for (int u = 1; u <= n; u++) {
        if (seen[u]) continue;
        cyc.clear(), lens.clear(), len_sum = 0;
        lint new_ans = 0;
        
        dfs1(u);
        for (int u : cyc) new_ans = max(new_ans, dfs2(u));
        precomp();
        
        new_ans = max(new_ans, comp());
        reverse(cyc.begin(), cyc.end()), reverse(lens.begin(), next(lens.end(), -1));
        new_ans = max(new_ans, comp());
        ans += new_ans;
    }
    cout << ans << '\n';
}

Compilation message

islands.cpp: In function 'void precomp()':
islands.cpp:70:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |     for (int i = 0; i < cyc.size(); i++) {
      |                     ~~^~~~~~~~~~~~
islands.cpp: In function 'lint comp()':
islands.cpp:80:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for (int i = 1; i < cyc.size(); i++)
      |                     ~~^~~~~~~~~~~~
islands.cpp:85:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |     for (int i = 1; i < cyc.size(); i++)
      |                     ~~^~~~~~~~~~~~
islands.cpp:90:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for (int i = 0; i < cyc.size(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27224 KB Output is correct
2 Correct 4 ms 27228 KB Output is correct
3 Correct 5 ms 27228 KB Output is correct
4 Correct 4 ms 27228 KB Output is correct
5 Correct 4 ms 27228 KB Output is correct
6 Correct 4 ms 27228 KB Output is correct
7 Correct 4 ms 27228 KB Output is correct
8 Correct 4 ms 27228 KB Output is correct
9 Correct 4 ms 27392 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Correct 4 ms 27228 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27484 KB Output is correct
2 Correct 5 ms 27224 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 27484 KB Output is correct
2 Correct 7 ms 27740 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 28504 KB Output is correct
2 Correct 38 ms 31832 KB Output is correct
3 Correct 17 ms 28504 KB Output is correct
4 Correct 10 ms 27996 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 33420 KB Output is correct
2 Correct 76 ms 35640 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 42124 KB Output is correct
2 Correct 191 ms 51056 KB Output is correct
3 Correct 278 ms 66300 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 51896 KB Output is correct
2 Correct 363 ms 88652 KB Output is correct
3 Correct 622 ms 97156 KB Output is correct
4 Correct 703 ms 128852 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 491 ms 74608 KB Output is correct
2 Runtime error 839 ms 131072 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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