oj.uz

Submission #973890

# Submission time Handle Problem Language Result Execution time Memory
973890 2024-05-02T12:21:14 Z bachhoangxuan Swapping Cities (APIO20_swap) C++17
6 / 100
 372 ms 53624 KB 
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
const int inf = 2e9;
const int maxn = 2e5+5;
const int maxl = 20;
#define pii pair<int,int>
#define fi first
#define se second
vector<pii> edge[maxn];
int dep[maxn],par[maxn][maxl],Min[maxn][maxl],Max[maxn][maxl];

struct DSU{
    int par[maxn];
    void init(int n){
        for(int i=1;i<=n;i++) par[i]=i;
    }
    int findpar(int u){
        if(u!=par[u]) return par[u]=findpar(par[u]);
        return u;
    }
    bool unions(int u,int v){
        u=findpar(u);v=findpar(v);
        if(u==v) return false;
        return par[v]=u,true;
    }
}dsu;

void dfs(int u,int p){
    dep[u]=dep[p]+1;
    par[u][0]=p;Min[u][0]=inf;
    for(int i=1;i<18;i++){
        par[u][i]=par[par[u][i-1]][i-1];Min[u][i]=inf;
        Max[u][i]=max(Max[u][i-1],Max[par[u][i-1]][i-1]);
    }
    for(auto [v,w]:edge[u]) if(v!=p) Max[v][0]=w,dfs(v,u);
}

void update(int u,int v,int w){
    if(dep[u]>dep[v]) swap(u,v);
    for(int i=0;i<18;i++){
        if((dep[v]-dep[u])>>i&1){
            Min[v][i]=min(Min[v][i],w);
            v=par[v][i];
        }
    }
    if(u==v) return;
    for(int i=17;i>=0;i--){
        if(par[u][i]!=par[v][i]){
            Min[v][i]=min(Min[v][i],w);
            Min[u][i]=min(Min[u][i],w);
            u=par[u][i];v=par[v][i];
        }
    }
    Min[u][0]=min(Min[u][0],w);
    Min[v][0]=min(Min[v][0],w);
}

int query(int u,int v){
    int res=inf,mx=0;
    if(dep[u]>dep[v]) swap(u,v);
    for(int i=0;i<18;i++){
        if((dep[v]-dep[u])>>i&1){
            res=min(res,Min[v][i]);
            mx=max(mx,Max[v][i]);
            v=par[v][i];
        }
    }
    if(u==v) return max(res,mx);
    for(int i=17;i>=0;i--){
        if(par[u][i]!=par[v][i]){
            res=min(res,Min[v][i]);
            res=min(res,Min[u][i]);
            mx=max(mx,Max[v][i]);
            mx=max(mx,Max[u][i]);
            u=par[u][i];v=par[v][i];
        }
    }
    res=min(res,Min[u][0]);
    res=min(res,Min[v][0]);
    mx=max(mx,Max[u][0]);
    mx=max(mx,Max[v][0]);
    return max(res,mx);
}

void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
    dsu.init(N);
    vector<int> ord(M);
    iota(ord.begin(),ord.end(),0);
    sort(ord.begin(),ord.end(),[&](int x,int y){
        return W[x]<W[y];
    });
    vector<int> cc;
    for(int i:ord){
        U[i]++;V[i]++;
        if(dsu.unions(U[i],V[i])){
            edge[U[i]].push_back({V[i],W[i]});
            edge[V[i]].push_back({U[i],W[i]});
        }
        else cc.push_back(i);
    }
    dfs(1,0);
    for(int i:cc) update(U[i],V[i],W[i]);
    for(int i=16;i>=0;i--){
        for(int u=1;u<=N;u++){
            Min[u][i]=min(Min[u][i],Min[u][i+1]);
            Min[par[u][i]][i]=min(Min[par[u][i]][i],Min[u][i+1]);
        }
    }
    for(int i=1;i<18;i++){
        for(int u=1;u<=N;u++) Min[u][i]=min(Min[u][i-1],Min[par[u][i-1]][i-1]);
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    int val=query(X+1,Y+1);
    if(val==inf) return -1;
    else return val;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10332 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 3 ms 10308 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10332 KB Output is correct
7 Correct 3 ms 10404 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 84 ms 39504 KB Output is correct
10 Correct 125 ms 46408 KB Output is correct
11 Correct 124 ms 45904 KB Output is correct
12 Correct 137 ms 48720 KB Output is correct
13 Correct 122 ms 49748 KB Output is correct
14 Correct 116 ms 39508 KB Output is correct
15 Correct 290 ms 50016 KB Output is correct
16 Correct 327 ms 48780 KB Output is correct
17 Correct 297 ms 53520 KB Output is correct
18 Correct 297 ms 52664 KB Output is correct
19 Correct 85 ms 22868 KB Output is correct
20 Correct 311 ms 52564 KB Output is correct
21 Correct 324 ms 49972 KB Output is correct
22 Correct 312 ms 53376 KB Output is correct
23 Correct 372 ms 53624 KB Output is correct

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10332 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Incorrect 164 ms 46692 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10332 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 3 ms 10308 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10332 KB Output is correct
7 Correct 3 ms 10404 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 3 ms 10332 KB Output is correct
10 Incorrect 3 ms 10424 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10332 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 2 ms 10332 KB Output is correct
5 Correct 3 ms 10308 KB Output is correct
6 Correct 3 ms 10332 KB Output is correct
7 Correct 3 ms 10332 KB Output is correct
8 Correct 3 ms 10404 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 84 ms 39504 KB Output is correct
11 Correct 125 ms 46408 KB Output is correct
12 Correct 124 ms 45904 KB Output is correct
13 Correct 137 ms 48720 KB Output is correct
14 Correct 122 ms 49748 KB Output is correct
15 Incorrect 3 ms 10424 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10332 KB Output is correct
2 Correct 2 ms 10332 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 3 ms 10308 KB Output is correct
5 Correct 3 ms 10332 KB Output is correct
6 Correct 3 ms 10332 KB Output is correct
7 Correct 3 ms 10404 KB Output is correct
8 Correct 3 ms 10588 KB Output is correct
9 Correct 84 ms 39504 KB Output is correct
10 Correct 125 ms 46408 KB Output is correct
11 Correct 124 ms 45904 KB Output is correct
12 Correct 137 ms 48720 KB Output is correct
13 Correct 122 ms 49748 KB Output is correct
14 Correct 116 ms 39508 KB Output is correct
15 Correct 290 ms 50016 KB Output is correct
16 Correct 327 ms 48780 KB Output is correct
17 Correct 297 ms 53520 KB Output is correct
18 Correct 297 ms 52664 KB Output is correct
19 Incorrect 164 ms 46692 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10332 KB Output is correct
2 Correct 3 ms 10332 KB Output is correct
3 Correct 2 ms 10332 KB Output is correct
4 Correct 2 ms 10332 KB Output is correct
5 Correct 3 ms 10308 KB Output is correct
6 Correct 3 ms 10332 KB Output is correct
7 Correct 3 ms 10332 KB Output is correct
8 Correct 3 ms 10404 KB Output is correct
9 Correct 3 ms 10588 KB Output is correct
10 Correct 84 ms 39504 KB Output is correct
11 Correct 125 ms 46408 KB Output is correct
12 Correct 124 ms 45904 KB Output is correct
13 Correct 137 ms 48720 KB Output is correct
14 Correct 122 ms 49748 KB Output is correct
15 Correct 116 ms 39508 KB Output is correct
16 Correct 290 ms 50016 KB Output is correct
17 Correct 327 ms 48780 KB Output is correct
18 Correct 297 ms 53520 KB Output is correct
19 Correct 297 ms 52664 KB Output is correct
20 Incorrect 164 ms 46692 KB Output isn't correct
21 Halted 0 ms 0 KB -