oj.uz

Submission #980067

# Submission time Handle Problem Language Result Execution time Memory
980067 2024-05-11T21:17:39 Z hasan2006 Swapping Cities (APIO20_swap) C++17
36 / 100
 456 ms 128196 KB 
#include "swap.h"
#include <bits/stdc++.h>

using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N =2e5 + 9 , mod = 1e9 + 7;
ll  p[N], sz[N] , a[N] , b[N] , dp[N] ,  dp1[N] ,  c[N][25] , d[N] , par[N][25] , mx[N][25] , us[N] , us1[N];
vector<pair<ll,ll>>v[N] , v1[N] , vc[N] ,  vv[N];
int get(int x){
    return (p[x] == x ? x : get(p[x]));
}
void join(int X , int Y , ll k){
    int x = get(X) , y = get(Y);
    if(x != y){
        if(sz[x] < sz[y])
            swap(x , y);
        p[y] = x;
        sz[x] += sz[y];
        vv[X].pb({k , Y});
        vv[Y].pb({k , X});
    }else {
        v1[X].pb({k , Y});
        v1[Y].pb({k , X});
    }
}
ll timer = 0;

void dd(int n  ,int p = 0 , int k = 0){
    v[p].pb({k , n});
    for(auto to : vv[n])
        if(to.se != p)
            dd(to.se , n , to.fi);
}

void dfs(int n , int p = 0 , ll k = 0){
    par[n][0] = p;
    if(v[p].size())
        c[n][0] = v[p][0].fi;
    else
        c[n][0] = 1e18;
    if(v[p].size() && v[p][0].se == n){
        if(v[p].size() > 1)
            c[n][0] = v[p][1].fi;
        else
            c[n][0] = 1e18;
    }
    if(v1[p].size())
        c[n][0] = min(c[n][0] , v1[p][0].fi);
    mx[n][0] = k;
    us[n] = ++timer;
    for(int i = 1; i <= 20; i++){
        par[n][i] = par[par[n][i - 1]][i - 1] ;
        mx[n][i] = max(mx[n][i - 1] , mx[par[n][i - 1]][i - 1]);
        c[n][i] = min(c[n][i - 1] , c[par[n][i - 1]][i - 1]);
    }
    for(auto to : v[n])
        dfs(to.se , n , to.fi);
    if(v1[n].size())
        dp[n] = min(dp[n] , v1[n][0].fi);
    if(v[n].size() > 1)
        dp[n] = min(dp[n] , v[n][1].fi);
    dp[p] = min(dp[p] , max(k , dp[n]));
    us1[n] = ++timer;
}
void dfs1(int n , int p = 0 , ll k = 1e18 , ll ans = 1e18){
    if(v1[n].size())
        ans = min(ans , v1[n][0].fi);
    dp1[n] = ans;
    v[n].pb({k , p});
    for(auto to : v[n])
        if(to.se != p)
            vc[n].pb({max(to.fi , dp[to.se]) , to.se});
    sort(all(v[n]));
    sort(all(vc[n]));
    for(auto to : v[n]){
        if(to.se != p){
            ll ans1 = ans;
            if(v[n].size() >= 3){
                if(v[n][1].se == to.se || v[n][0].se == to.se)
                    ans1 = min(ans1, v[n][2].fi);
                else
                    ans1 = min(ans1 , v[n][1].fi);
            }
            if(vc[n][0].se != to.se)
                ans1 = min(ans1 ,vc[n][0].fi);
            else if(vc[n].size() > 1)
                ans1 = min(ans1 , vc[n][1].fi);
            dfs1(to.se , n , to.fi , max(ans1 , to.fi));
        }
    }
}

bool ok(int u, int v)
{
    return (u == 0 || (us[u] <= us[v] && us1[u] >= us1[v]));
}

ll get(int x , int y){
    ll mn = 1e18 , ans = 0;
    mn = min({mn , dp[y]});
    for(int i = 20; i >= 0; i--){
        if(!ok(par[y][i] , x)){
            mn = min(mn , c[y][i]);
            ans = max(ans , mx[y][i]);
            y = par[y][i];
        }
    }
    ans = max(ans , mx[y][0]);
    mn = min({mn , dp1[y]});
    ans = max(ans , mn);
    if(ans > 1e9)
        ans = -1;
    return ans;
}
ll mm = 0;
ll lca(int x , int y){

    if(ok(x , y)){
        return get(x , y);
    }
    if(ok(y , x))
        return get(y , x);
    ll mn = 1e18 , ans = 0;
    mn = min({mn , dp[x] , dp[y]});
    for(int i = 20; i >= 0; i--){
        if(!ok(par[y][i] , x)){
                mn = min(mn , c[y][i]);
                ans = max(ans , mx[y][i]);
                y = par[y][i];
            }
        }
    for(int i = 20; i >= 0; i--){
            if(!ok(par[x][i] , y)){
                mn = min(mn , c[x][i]);
                ans = max(ans , mx[x][i]);
                x = par[x][i];
            }
    }
    ans = max(ans , mx[x][0]);
    ans = max(ans , mx[y][0]);
    for(int i = 0; i < 3 && i < v[par[x][0]].size(); i++)
        if(v[par[x][0]][i].se != x && v[par[x][0]][i].se != y)
            mn = min(mn ,v[par[x][0]][i].fi);
    x = par[x][0];
    if(v1[x].size())
        mn = min(mn , v1[x][0].fi);
    ans = max(ans , mn);
    if(ans > 1e9)
        ans = -1;
    return ans;
}

void init(int n , int m , vector<int>v , vector<int>u , vector<int>c)
{
    vector<pair<ll,pair<ll,ll>>>vc;
    for(int i = 0; i <= n; i++)
        dp[i] = 1e18 , p[i] =  i , sz[i] = 1;
    for(int i = 0; i < m; i++)
        vc.pb({c[i] , {v[i] + 1, u[i] + 1}});
    sort(all(vc));
    for(auto to : vc)
        join(to.se.fi , to.se.se , to.fi);
    dd(1);
   for(int i = 1; i <= n ; i++)
        sort(all(::v[i])) , sort(rall(::v1[i]));
    dfs(1);
    dfs1(1);
}


int getMinimumFuelCapacity(int l, int r) {
        l++ , r++;
        return lca(l , r);
}
/*
int main(){

    init(4, 4, {0, 0, 1 , 2}, {1 , 3 , 2 , 3}, {1 , 3 , 2 , 4});
    cout<<getMinimumFuelCapacity(0,1)<<"\n";
    cout<<getMinimumFuelCapacity(0,2)<<"\n";
    cout<<getMinimumFuelCapacity(0,3)<<"\n";
    cout<<getMinimumFuelCapacity(1,2)<<"\n";
    cout<<getMinimumFuelCapacity(1,3)<<"\n";
    cout<<getMinimumFuelCapacity(2,3)<<"\n";
}*/

Compilation message

swap.cpp: In function 'long long int lca(int, int)':
swap.cpp:158:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  158 |     for(int i = 0; i < 3 && i < v[par[x][0]].size(); i++)
      |                             ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 35420 KB Output is correct
2 Correct 6 ms 35420 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35676 KB Output is correct
6 Correct 7 ms 35676 KB Output is correct
7 Correct 7 ms 35676 KB Output is correct
8 Correct 7 ms 35780 KB Output is correct
9 Correct 139 ms 102852 KB Output is correct
10 Correct 179 ms 117104 KB Output is correct
11 Correct 162 ms 115904 KB Output is correct
12 Correct 176 ms 123932 KB Output is correct
13 Correct 178 ms 127172 KB Output is correct
14 Correct 154 ms 101236 KB Output is correct
15 Correct 402 ms 118212 KB Output is correct
16 Correct 407 ms 115136 KB Output is correct
17 Correct 429 ms 128196 KB Output is correct
18 Correct 396 ms 125884 KB Output is correct
19 Correct 98 ms 55476 KB Output is correct
20 Correct 376 ms 117288 KB Output is correct
21 Correct 378 ms 114784 KB Output is correct
22 Correct 416 ms 125108 KB Output is correct
23 Correct 408 ms 125112 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 35420 KB Output is correct
2 Correct 6 ms 35420 KB Output is correct
3 Correct 200 ms 107192 KB Output is correct
4 Correct 195 ms 113956 KB Output is correct
5 Correct 221 ms 107468 KB Output is correct
6 Correct 187 ms 111952 KB Output is correct
7 Correct 193 ms 107704 KB Output is correct
8 Correct 187 ms 107296 KB Output is correct
9 Correct 194 ms 108084 KB Output is correct
10 Correct 194 ms 107552 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 35420 KB Output is correct
2 Correct 6 ms 35420 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35676 KB Output is correct
6 Correct 7 ms 35676 KB Output is correct
7 Correct 7 ms 35676 KB Output is correct
8 Correct 7 ms 35780 KB Output is correct
9 Correct 7 ms 35420 KB Output is correct
10 Correct 7 ms 35420 KB Output is correct
11 Correct 7 ms 35672 KB Output is correct
12 Correct 7 ms 35676 KB Output is correct
13 Correct 7 ms 35420 KB Output is correct
14 Correct 7 ms 35416 KB Output is correct
15 Correct 7 ms 35676 KB Output is correct
16 Correct 7 ms 35724 KB Output is correct
17 Correct 7 ms 35676 KB Output is correct
18 Correct 9 ms 35668 KB Output is correct
19 Correct 8 ms 35528 KB Output is correct
20 Correct 7 ms 35676 KB Output is correct
21 Correct 8 ms 35576 KB Output is correct
22 Correct 7 ms 35672 KB Output is correct
23 Correct 7 ms 35416 KB Output is correct
24 Incorrect 8 ms 35676 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 35420 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 6 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35676 KB Output is correct
7 Correct 7 ms 35676 KB Output is correct
8 Correct 7 ms 35676 KB Output is correct
9 Correct 7 ms 35780 KB Output is correct
10 Correct 139 ms 102852 KB Output is correct
11 Correct 179 ms 117104 KB Output is correct
12 Correct 162 ms 115904 KB Output is correct
13 Correct 176 ms 123932 KB Output is correct
14 Correct 178 ms 127172 KB Output is correct
15 Correct 7 ms 35420 KB Output is correct
16 Correct 7 ms 35672 KB Output is correct
17 Correct 7 ms 35676 KB Output is correct
18 Correct 7 ms 35420 KB Output is correct
19 Correct 7 ms 35416 KB Output is correct
20 Correct 7 ms 35676 KB Output is correct
21 Correct 7 ms 35724 KB Output is correct
22 Correct 7 ms 35676 KB Output is correct
23 Correct 9 ms 35668 KB Output is correct
24 Correct 8 ms 35528 KB Output is correct
25 Correct 7 ms 35676 KB Output is correct
26 Correct 8 ms 35576 KB Output is correct
27 Correct 7 ms 35672 KB Output is correct
28 Correct 7 ms 35416 KB Output is correct
29 Incorrect 8 ms 35676 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 35420 KB Output is correct
2 Correct 6 ms 35420 KB Output is correct
3 Correct 7 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35676 KB Output is correct
6 Correct 7 ms 35676 KB Output is correct
7 Correct 7 ms 35676 KB Output is correct
8 Correct 7 ms 35780 KB Output is correct
9 Correct 139 ms 102852 KB Output is correct
10 Correct 179 ms 117104 KB Output is correct
11 Correct 162 ms 115904 KB Output is correct
12 Correct 176 ms 123932 KB Output is correct
13 Correct 178 ms 127172 KB Output is correct
14 Correct 154 ms 101236 KB Output is correct
15 Correct 402 ms 118212 KB Output is correct
16 Correct 407 ms 115136 KB Output is correct
17 Correct 429 ms 128196 KB Output is correct
18 Correct 396 ms 125884 KB Output is correct
19 Correct 200 ms 107192 KB Output is correct
20 Correct 195 ms 113956 KB Output is correct
21 Correct 221 ms 107468 KB Output is correct
22 Correct 187 ms 111952 KB Output is correct
23 Correct 193 ms 107704 KB Output is correct
24 Correct 187 ms 107296 KB Output is correct
25 Correct 194 ms 108084 KB Output is correct
26 Correct 194 ms 107552 KB Output is correct
27 Correct 7 ms 35420 KB Output is correct
28 Correct 7 ms 35672 KB Output is correct
29 Correct 7 ms 35676 KB Output is correct
30 Correct 7 ms 35420 KB Output is correct
31 Correct 7 ms 35416 KB Output is correct
32 Correct 7 ms 35676 KB Output is correct
33 Correct 7 ms 35724 KB Output is correct
34 Correct 7 ms 35676 KB Output is correct
35 Correct 9 ms 35668 KB Output is correct
36 Correct 19 ms 43860 KB Output is correct
37 Correct 191 ms 123264 KB Output is correct
38 Correct 171 ms 119056 KB Output is correct
39 Correct 149 ms 115976 KB Output is correct
40 Correct 137 ms 110788 KB Output is correct
41 Correct 130 ms 110248 KB Output is correct
42 Correct 122 ms 106836 KB Output is correct
43 Correct 161 ms 120164 KB Output is correct
44 Correct 158 ms 121992 KB Output is correct
45 Correct 152 ms 123680 KB Output is correct
46 Correct 134 ms 114504 KB Output is correct
47 Correct 27 ms 43864 KB Output is correct
48 Correct 388 ms 121600 KB Output is correct
49 Correct 387 ms 119264 KB Output is correct
50 Correct 364 ms 117664 KB Output is correct
51 Correct 326 ms 115080 KB Output is correct
52 Correct 288 ms 109504 KB Output is correct
53 Correct 225 ms 86468 KB Output is correct
54 Correct 368 ms 120516 KB Output is correct
55 Correct 410 ms 122392 KB Output is correct
56 Correct 456 ms 126400 KB Output is correct
57 Correct 300 ms 116104 KB Output is correct

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 35420 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 6 ms 35420 KB Output is correct
4 Correct 7 ms 35420 KB Output is correct
5 Correct 7 ms 35420 KB Output is correct
6 Correct 7 ms 35676 KB Output is correct
7 Correct 7 ms 35676 KB Output is correct
8 Correct 7 ms 35676 KB Output is correct
9 Correct 7 ms 35780 KB Output is correct
10 Correct 139 ms 102852 KB Output is correct
11 Correct 179 ms 117104 KB Output is correct
12 Correct 162 ms 115904 KB Output is correct
13 Correct 176 ms 123932 KB Output is correct
14 Correct 178 ms 127172 KB Output is correct
15 Correct 154 ms 101236 KB Output is correct
16 Correct 402 ms 118212 KB Output is correct
17 Correct 407 ms 115136 KB Output is correct
18 Correct 429 ms 128196 KB Output is correct
19 Correct 396 ms 125884 KB Output is correct
20 Correct 200 ms 107192 KB Output is correct
21 Correct 195 ms 113956 KB Output is correct
22 Correct 221 ms 107468 KB Output is correct
23 Correct 187 ms 111952 KB Output is correct
24 Correct 193 ms 107704 KB Output is correct
25 Correct 187 ms 107296 KB Output is correct
26 Correct 194 ms 108084 KB Output is correct
27 Correct 194 ms 107552 KB Output is correct
28 Correct 7 ms 35420 KB Output is correct
29 Correct 7 ms 35672 KB Output is correct
30 Correct 7 ms 35676 KB Output is correct
31 Correct 7 ms 35420 KB Output is correct
32 Correct 7 ms 35416 KB Output is correct
33 Correct 7 ms 35676 KB Output is correct
34 Correct 7 ms 35724 KB Output is correct
35 Correct 7 ms 35676 KB Output is correct
36 Correct 9 ms 35668 KB Output is correct
37 Correct 19 ms 43860 KB Output is correct
38 Correct 191 ms 123264 KB Output is correct
39 Correct 171 ms 119056 KB Output is correct
40 Correct 149 ms 115976 KB Output is correct
41 Correct 137 ms 110788 KB Output is correct
42 Correct 130 ms 110248 KB Output is correct
43 Correct 122 ms 106836 KB Output is correct
44 Correct 161 ms 120164 KB Output is correct
45 Correct 158 ms 121992 KB Output is correct
46 Correct 152 ms 123680 KB Output is correct
47 Correct 134 ms 114504 KB Output is correct
48 Correct 27 ms 43864 KB Output is correct
49 Correct 388 ms 121600 KB Output is correct
50 Correct 387 ms 119264 KB Output is correct
51 Correct 364 ms 117664 KB Output is correct
52 Correct 326 ms 115080 KB Output is correct
53 Correct 288 ms 109504 KB Output is correct
54 Correct 225 ms 86468 KB Output is correct
55 Correct 368 ms 120516 KB Output is correct
56 Correct 410 ms 122392 KB Output is correct
57 Correct 456 ms 126400 KB Output is correct
58 Correct 300 ms 116104 KB Output is correct
59 Correct 98 ms 55476 KB Output is correct
60 Correct 376 ms 117288 KB Output is correct
61 Correct 378 ms 114784 KB Output is correct
62 Correct 416 ms 125108 KB Output is correct
63 Correct 408 ms 125112 KB Output is correct
64 Correct 8 ms 35528 KB Output is correct
65 Correct 7 ms 35676 KB Output is correct
66 Correct 8 ms 35576 KB Output is correct
67 Correct 7 ms 35672 KB Output is correct
68 Correct 7 ms 35416 KB Output is correct
69 Incorrect 8 ms 35676 KB Output isn't correct
70 Halted 0 ms 0 KB -