oj.uz

답안 #998675

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998675 2024-06-14T13:53:17 Z Ghetto Islands (IOI08_islands) C++17
80 / 100
 1090 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pii = pair<int, int>;
using pil = pair<int, lint>;
using pli = pair<lint, int>;
const int MAX_N = 1e6 + 5;

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

bool seen[MAX_N];
void dfs1(int s) {
    stack<int> ord; ord.push(s);
    while (ord.size()) {
        int u = ord.top(); ord.pop();
        seen[u] = true;
        for (pil x : adj[u])
            if (!seen[x.first]) ord.push(x.first);
    }
}

vector<int> cyc;
bool in_cyc[MAX_N];
bool vis[MAX_N];
void dfs2(int s) {
    vector<int> bef;
    stack<int> ord; ord.push(s);
    while (ord.size()) {
        int u = ord.top(); ord.pop();
        vis[u] = true, bef.push_back(u);
        int v = to[u];
        if (!vis[v]) { ord.push(v); continue; }
        int i = bef.size() - 1;
        while (true) {
            cyc.push_back(bef[i]), in_cyc[bef[i]] = true;
            if (bef[i] == v) break;
            i--;
        }
        break;
    }
}

lint dp[MAX_N];
int par[MAX_N];
lint dfs3(int u) {
    lint ans = 0;
    lint max1 = 0, max2 = 0;
    for (pil x : adj[u]) {
        int v = x.first;
        if (v == par[u] || in_cyc[v]) continue;
        par[v] = u, ans = max(ans, dfs3(v));
        dp[u] = max(dp[u], dp[v] + x.second);
        int val = dp[v] + x.second;
        if (val > max1) max2 = max1, max1 = val;
        else if (val > max2) max2 = val;
    }
    ans = max(ans, max1 + max2);
    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() {
    multiset<lint> trans;
    vector<lint> val = {0};
    for (int i = 1; i < cyc.size(); i++) 
        val.push_back(val.back() + lens[i - 1]);
    for (int i = 1; i < cyc.size(); i++)
        val[i] = dp[cyc[i]] - val[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++) {
        cin >> to[u];
        lint len; cin >> len;
        adj[u].push_back({to[u], len}), adj[to[u]].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), dfs2(u);
        for (int u : cyc) new_ans = max(new_ans, dfs3(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: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 = 0; i < cyc.size(); i++) {
      |                     ~~^~~~~~~~~~~~
islands.cpp: In function 'lint comp()':
islands.cpp:91:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     for (int i = 1; i < cyc.size(); i++)
      |                     ~~^~~~~~~~~~~~
islands.cpp:93:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for (int i = 1; i < cyc.size(); i++)
      |                     ~~^~~~~~~~~~~~
islands.cpp:98:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |     for (int i = 0; i < cyc.size(); i++) {
      |                     ~~^~~~~~~~~~~~

Subtask #1
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 29020 KB Output is correct
2 Correct 5 ms 29020 KB Output is correct
3 Correct 5 ms 29020 KB Output is correct
4 Correct 4 ms 29020 KB Output is correct
5 Correct 4 ms 29020 KB Output is correct
6 Correct 4 ms 29184 KB Output is correct
7 Correct 4 ms 29020 KB Output is correct
8 Correct 4 ms 29188 KB Output is correct
9 Correct 4 ms 29136 KB Output is correct
10 Correct 5 ms 29140 KB Output is correct
11 Correct 4 ms 29020 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 29020 KB Output is correct
2 Correct 5 ms 29020 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 29276 KB Output is correct
2 Correct 7 ms 29532 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 30300 KB Output is correct
2 Correct 30 ms 32436 KB Output is correct
3 Correct 21 ms 30552 KB Output is correct
4 Correct 11 ms 29788 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 33696 KB Output is correct
2 Correct 73 ms 38060 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 44424 KB Output is correct
2 Correct 178 ms 46208 KB Output is correct
3 Correct 250 ms 56572 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 258 ms 56600 KB Output is correct
2 Correct 344 ms 77132 KB Output is correct
3 Correct 599 ms 77752 KB Output is correct
4 Correct 635 ms 98612 KB Output is correct

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 464 ms 87036 KB Output is correct
2 Correct 1090 ms 131072 KB Output is correct
3 Correct 492 ms 81752 KB Output is correct
4 Correct 705 ms 115780 KB Output is correct
5 Correct 739 ms 116912 KB Output is correct
6 Incorrect 947 ms 93524 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 549 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -