oj.uz

Submission #1062572

# Submission time Handle Problem Language Result Execution time Memory
1062572 2024-08-17T08:43:06 Z Zicrus Islands (IOI08_islands) C++17
100 / 100
 619 ms 131072 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;

struct node {
    int nxt;
    int first, second;
};
 
int n;
vector<int> adj; // length, node
vector<bool> vst;
vector<int> comps;
vector<bool> cyc;
vector<pair<int, int>> nxt; // length, node
vector<ll> treeSz;

vector<node> nd;

ll val;
 
int cycRoot;
ll dfsCyc(int &cur, int &par) {
    vst[cur] = true;
    {
        ll numECnt = 0;
        int e = adj[cur];
        while (e != -1) {
            if (nd[e].second == par) {
                numECnt++;
            }
            e = nd[e].nxt;
        }
        if (numECnt == 2) {
            pair<int, int> numE[2];
            e = adj[cur];
            while (e != -1) {
                if (nd[e].second == par) {
                    numE[--numECnt] = {nd[e].first, nd[e].second};
                }
                e = nd[e].nxt;
            }
            vst[numE[0].second] = true;
            cyc[cur] = cyc[numE[0].second] = true;
            cycRoot = cur;
            nxt[cur] = numE[0];
            nxt[numE[0].second] = {numE[1].first, cur};
            return -1;
        }
    }
    int e = adj[cur];
    while (e != -1) {
        if (nd[e].second == par) { e = nd[e].nxt; continue; }
        if (vst[nd[e].second] && !cyc[nd[e].second]) {
            cyc[cur] = true;
            nxt[cur] = {nd[e].first, nd[e].second};
            cycRoot = nd[e].second;
            return nd[e].second;
        }
        else {
            ll val = dfsCyc(nd[e].second, cur);
            if (val == -1) { e = nd[e].nxt; continue; }
            cyc[cur] = true;
            nxt[cur] = {nd[e].first, nd[e].second};
            return cur == val ? -1 : val;
        }
        e = nd[e].nxt;
    }
    return -1;
}
 
ll mxLen = 0;
ll dfsTreeSz(int &cur, int &par) {
    ll mx = 0;
    ll nxtMx = 0;
    int e = adj[cur];
    while (e != -1) {
        if (nd[e].second == par) { e = nd[e].nxt; continue; }
        if (cyc[nd[e].second]) { e = nd[e].nxt; continue; }
        val = nd[e].first + dfsTreeSz(nd[e].second, cur);
        if (val > mx) {
            nxtMx = mx;
            mx = val;
        }
        else if (val > nxtMx) {
            nxtMx = val;
        }
        e = nd[e].nxt;
    }
    mxLen = max(mxLen, nxtMx + mx);
    return mx;
}
 
ll solveComp(int &root) {
    mxLen = 0;
    int minusOne = -1;
    dfsCyc(root, minusOne);
    int x = cycRoot;
    vector<int> cycle;
    do {
        cycle.push_back(x);
        x = nxt[x].second;
    } while (x != cycRoot);
    for (int i = 0; i < cycle.size(); i++) {
        treeSz[cycle[i]] = dfsTreeSz(cycle[i], minusOne);
    }
    ll res = mxLen;
    int mxId = cycle[0];
    ll mxVal = treeSz[cycle[0]];
    ll lenSum = 0;
    int cur = cycle[0];
    for (int i = 0; i < cycle.size(); i++) {
        if (cur == cycle[i] || mxId == cycle[i]) {
            cur = cycle[i];
            lenSum = nxt[cur].first;
            cur = nxt[cur].second;
            mxId = cur;
            mxVal = lenSum + treeSz[cur];
        }
        while (cur != cycle[i]) {
            val = lenSum + treeSz[cur];
            if (val >= mxVal) {
                mxVal = val;
                mxId = cur;
            }
            lenSum += nxt[cur].first;
            cur = nxt[cur].second;
        }
        res = max(res, treeSz[cycle[i]] + mxVal);
        lenSum -= nxt[cycle[i]].first;
        mxVal -= nxt[cycle[i]].first;
    }
    return res;
}
 
void dfs1(int &cur) {
    vst[cur] = true;
    int e = adj[cur];
    while (e != -1) {
        if (vst[nd[e].second]) { e = nd[e].nxt; continue; }
        dfs1(nd[e].second);
        e = nd[e].nxt;
    }
}
 
int main() {
    cin >> n;
    adj = vector<int>(n, -1);
    cyc = vector<bool>(n);
    nxt = vector<pair<int, int>>(n);
    treeSz = vector<ll>(n);
    nd = vector<node>(2*n);
    for (auto &e : nd) e.nxt = -1;
    ll ptr = 0;
    ll a, l;
    for (int i = 0; i < n; i++) {
        cin >> a >> l;
        nd[2*i].first = l;
        nd[2*i].second = a-1;
        nd[2*i].nxt = adj[i];
        adj[i] = 2*i;
        nd[2*i+1].first = l;
        nd[2*i+1].second = i;
        nd[2*i+1].nxt = adj[a-1];
        adj[a-1] = 2*i+1;
    }
    vst = vector<bool>(n);
    for (int i = 0; i < n; i++) {
        if (vst[i]) continue;
        dfs1(i);
        comps.push_back(i);
    }
    vst = vector<bool>(n);
 
    ll res = 0;
    for (auto &e : comps) {
        res += solveComp(e);
    }
    cout << res;
}

Compilation message

islands.cpp: In function 'll solveComp(int&)':
islands.cpp:105:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     for (int i = 0; i < cycle.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
islands.cpp:113:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |     for (int i = 0; i < cycle.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
islands.cpp: In function 'int main()':
islands.cpp:155:8: warning: unused variable 'ptr' [-Wunused-variable]
  155 |     ll ptr = 0;
      |        ^~~

Subtask #1
33.0 / 33.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 604 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1372 KB Output is correct
2 Correct 16 ms 3644 KB Output is correct
3 Correct 10 ms 1628 KB Output is correct
4 Correct 5 ms 1032 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 4944 KB Output is correct
2 Correct 44 ms 7440 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 13156 KB Output is correct
2 Correct 81 ms 19128 KB Output is correct
3 Correct 125 ms 27868 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 24332 KB Output is correct
2 Correct 200 ms 44492 KB Output is correct
3 Correct 207 ms 54248 KB Output is correct
4 Correct 298 ms 70084 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 441 ms 59216 KB Output is correct
2 Correct 576 ms 100280 KB Output is correct
3 Correct 312 ms 46928 KB Output is correct
4 Correct 405 ms 81864 KB Output is correct
5 Correct 388 ms 81484 KB Output is correct
6 Correct 600 ms 57044 KB Output is correct
7 Correct 477 ms 108984 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 560 ms 131072 KB Output is correct
2 Correct 500 ms 99792 KB Output is correct
3 Correct 546 ms 131072 KB Output is correct
4 Correct 522 ms 60868 KB Output is correct
5 Correct 424 ms 82884 KB Output is correct
6 Correct 389 ms 64968 KB Output is correct
7 Correct 619 ms 57940 KB Output is correct