oj.uz

Submission #839007

# Submission time Handle Problem Language Result Execution time Memory
839007 2023-08-28T13:20:56 Z Cookie Islands (IOI08_islands) C++14
90 / 100
 1243 ms 131072 KB 
#include<bits/stdc++.h>
using namespace std;
ifstream fin("susss.txt");
ofstream fout("res.txt");
#define forr(i, a, b) for(int i = a; i < b; i++)
#define pb push_back
#define vt vector
#define fi first
#define se second
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define sz(v) (int)v.size()
const int mxn = 1e6 + 5, inf = 1e9, mod = 1e9 + 7, mxm = 1e5 + 5;
int n;
vt<int>adj[mxn + 1];
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rr(ll l, ll r){
    return(uniform_int_distribution<ll>(l, r)(rng));
}
 
bool vis[mxn + 1], in[mxn + 1];
ll mxd[mxn + 1], cost[mxn + 1];
int to[mxn + 1];
ll mx, id;
vt<int>comp;
void dfs(int s, int pre, int root, ll dep){
    mxd[root] = max(mxd[root], dep);
    for(int ii = 0; ii < sz(adj[s]); ii++){
        
        int i = adj[s][ii]; ll w;
        if(i == to[s])w = cost[s];
        else w = cost[i];
        if(i != pre && !in[i])dfs(i, s, root, dep + w);
        
    }
}
void dfs2(int s, int pre, int root, ll dep){
    if(dep > mx){
        mx = dep; id = s;
    }
    for(int ii = 0; ii < sz(adj[s]); ii++){
        int i = adj[s][ii]; ll w;
        if(i == to[s])w = cost[s];
        else w = cost[i];
        if(i != pre && (s == root || !in[s])){
            dfs2(i, s, root, dep + w);
        }
    }
}
void get_comp(int s){
    vis[s] = 1; 
    for(int idd = 0; idd < sz(adj[s]); idd++){
        int i = adj[s][idd];
        if(!vis[i]){
            get_comp(i);
        }
    }
}
 
signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++){
        int v, w; cin >> v >> w;
        to[i] = v; cost[i] = w;
        adj[i].pb(v); adj[v].pb(i);
    }
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        if(!vis[i]){
            ll cand = 0;
            comp.clear(); get_comp(i);
            int a = to[i],  b = to[to[i]];
            while(a != b){
                a = to[a]; b = to[to[b]];
            }
            a = i;
            while(a != b){
                a = to[a]; b = to[b];
            }
            ll pp = 0;
            vt<int>cyc; cyc.pb(a); in[a] = 1;  pp += cost[a]; a = to[a]; 
            vt<ll>pref; pref.pb(0);
            while(a != b){
                in[a] = 1;
                cyc.pb(a); pref.pb(pp); pp += cost[a]; a = to[a];
            }
            for(int ii = 0; ii < sz(cyc); ii++){
                int j = cyc[ii];
                dfs(j, -1, j, 0);
                mx = id = -1;
                dfs2(j, -1, j, 0);
                dfs2(id, -1, j, 0);
                cand = max(cand, mx);
            }
            
            ll pmx = mxd[cyc[0]];
            for(int j = 1; j < sz(cyc); j++){
                cand = max(cand, pref[j] + mxd[cyc[j]] + pmx);
                pmx = max(pmx, -pref[j] + mxd[cyc[j]]);
            }
            
            
            pmx = mxd[cyc[0]];
            for(int j = 1; j < sz(cyc); j++){
                cand = max(cand, -pref[j] + mxd[cyc[j]] + pmx + pp);
                pmx = max(pmx, pref[j] + mxd[cyc[j]]);
            }
            ans += cand;
            
            
        }
    }
    cout << ans;
}

Subtask #1
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23808 KB Output is correct
3 Correct 10 ms 23892 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 10 ms 23808 KB Output is correct
6 Correct 10 ms 23764 KB Output is correct
7 Correct 11 ms 23764 KB Output is correct
8 Correct 12 ms 23764 KB Output is correct
9 Correct 13 ms 23736 KB Output is correct
10 Correct 11 ms 23764 KB Output is correct
11 Correct 11 ms 23864 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23892 KB Output is correct
2 Correct 11 ms 23832 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23880 KB Output is correct
2 Correct 12 ms 24168 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 24776 KB Output is correct
2 Correct 24 ms 26636 KB Output is correct
3 Correct 20 ms 25000 KB Output is correct
4 Correct 16 ms 24404 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 27828 KB Output is correct
2 Correct 37 ms 30156 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 35892 KB Output is correct
2 Correct 85 ms 40756 KB Output is correct
3 Correct 87 ms 45880 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 45916 KB Output is correct
2 Correct 150 ms 62212 KB Output is correct
3 Correct 174 ms 72440 KB Output is correct
4 Correct 196 ms 80368 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 209 ms 71736 KB Output is correct
2 Correct 694 ms 102428 KB Output is correct
3 Correct 220 ms 67100 KB Output is correct
4 Correct 281 ms 93160 KB Output is correct
5 Correct 279 ms 93012 KB Output is correct
6 Correct 1243 ms 69624 KB Output is correct
7 Correct 296 ms 111484 KB Output is correct

Subtask #9
0 / 10.0

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