oj.uz

Submission #445590

# Submission time Handle Problem Language Result Execution time Memory
445590 2021-07-18T18:48:45 Z JerryLiu06 Islands (IOI08_islands) C++17
80 / 100
 968 ms 131076 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 1e6 + 10;
const ll INF = 1e18;

int N; vpi adj[MX]; pi nxt[MX]; ll ans = 0;

int vis[MX]; ll label[MX]; ll cycLen[MX];

int numCyc = 0; bool comp[MX]; vector<vi> cyc;

int numTree = 0; vector<vi> tree; ll compTree[MX];

ll val[MX]; int deg[MX]; ll dist[MX];

queue<int> Q;

ll DFS2(int X, int P, int curTree) {
    tree[curTree].pb(X);
    compTree[X] = curTree;
    ll maxDist = 0;

    EACH(Y, adj[X]) {
        if (Y.f != P && !comp[Y.f]) {
            ckmax(maxDist, DFS2(Y.f, X, numTree) + Y.s);

            deg[X]++, deg[Y.f]++;
        }
    }
    return maxDist;
}

pl furthestAway(int X, int ind) {
	while (!Q.empty()) Q.pop();
	
	EACH(i, tree[ind]) dist[i] = -1;

    Q.push(X); dist[X] = 0; pl res = {-1, -1};

    while (!Q.empty()) {
        int cur = Q.front(); Q.pop();
        
        ckmax(res, {dist[cur], cur});

        EACH(nxt, adj[cur]) {
            if (compTree[nxt.f] == ind && dist[nxt.f] == -1) {
                
                dist[nxt.f] = dist[cur] + nxt.s;
                Q.push(nxt.f);
            }
        }
    }
	return res;
}
ll getDiam(int ind) {
    int ST = furthestAway(tree[ind][0], ind).s;
    
    return furthestAway(ST, ind).f;
}

// DFS in Functional Graph ~ Generate cycles

void DFS1(int X) {
    int cur = X; 
    
    while (vis[X] == 0) { 
        vis[X] = cur; 
        X = nxt[X].f; 
    }

    ll curDist = 0; if (vis[X] == cur) numCyc++, cyc.pb(vi());
    
    while (vis[X] == cur) { 
        vis[X] = N + cur; 
        label[X] = curDist; 
        comp[X] = true;
        cyc[numCyc].pb(X);

        curDist += nxt[X].s;
        
        X = nxt[X].f;
    }
    if (vis[X] == N + cur) {
        cycLen[numCyc] = curDist;
    }
    while (vis[X] == N + cur) {
        vis[X] = 2 * N + cur;
        
        tree.pb(vi());
        val[X] = DFS2(X, 0, ++numTree);
        
        X = nxt[X].f;
    }
}

ll getMaxDist(int ind) {
    ll res = 0;
    
    EACH(X, cyc[ind]) {
        ckmax(res, getDiam(++numTree));
    }
    
    // case 1: i < j, val[j] + label[j] + val[i] - label[i]
    
    ll cumMax = -INF; 
    
    FOR(i, 1, sz(cyc[ind])) {
        int A = cyc[ind][i];
        
        int B = cyc[ind][i - 1];
        
        ckmax(cumMax, val[B] - label[B]);
        
        ckmax(res, val[A] + label[A] + cumMax);
    }
    
    // case 2: i < j, cyclen[ind] + val[j] - label[j] + val[i] + label[i]
    
    cumMax = -INF;
    
    FOR(i, 1, sz(cyc[ind])) {
        int A = cyc[ind][i];
        
        int B = cyc[ind][i - 1];
        
        ckmax(cumMax, val[B] + label[B]);
        
        ckmax(res, cycLen[ind] + val[A] - label[A] + cumMax);
    }
    return res;
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> N; 

    FOR(i, 1, N + 1) { 
        int A, L; cin >> A >> L; 
        adj[i].pb({A, L}), adj[A].pb({i, L}); 
        nxt[i] = {A, L}; 
    }
    tree.pb(vi()); cyc.pb(vi());

    FOR(i, 1, N + 1) {
        if (!vis[i]) {
            DFS1(i);
        }
    }
    // FOR(i, 1, numTree + 1) {
    //     getDiam(i);
    // }
    numTree = 0;
    FOR(i, 1, numCyc + 1) {
        ans += getMaxDist(i);
    }
    cout << ans;
}

Compilation message

islands.cpp: In function 'll getMaxDist(int)':
islands.cpp:152:10: warning: unused variable 'X' [-Wunused-variable]
  152 |     EACH(X, cyc[ind]) {
      |          ^
islands.cpp:45:31: note: in definition of macro 'EACH'
   45 | #define EACH(a, x) for (auto& a : x)
      |                               ^

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 16 ms 23852 KB Output is correct
3 Correct 16 ms 23828 KB Output is correct
4 Correct 14 ms 23808 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 16 ms 23820 KB Output is correct
7 Correct 15 ms 23848 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23764 KB Output is correct
10 Correct 14 ms 23856 KB Output is correct
11 Correct 14 ms 23884 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
4.0 / 4.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 25620 KB Output is correct
2 Correct 36 ms 27832 KB Output is correct
3 Correct 28 ms 25824 KB Output is correct
4 Correct 20 ms 24880 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 29376 KB Output is correct
2 Correct 73 ms 35648 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 43020 KB Output is correct
2 Correct 129 ms 49548 KB Output is correct
3 Correct 150 ms 54260 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 69068 KB Output is correct
2 Correct 258 ms 79180 KB Output is correct
3 Correct 295 ms 104188 KB Output is correct
4 Correct 340 ms 110304 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 417 ms 117928 KB Output is correct
2 Correct 968 ms 131072 KB Output is correct
3 Correct 437 ms 122056 KB Output is correct
4 Runtime error 460 ms 131076 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

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