oj.uz

Submission #698951

# Submission time Handle Problem Language Result Execution time Memory
698951 2023-02-15T01:24:36 Z Cross_Ratio Swapping Cities (APIO20_swap) C++14
7 / 100
 308 ms 40324 KB 
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;
array<int, 3> Edge[200005];
vector<int> adj[200005];
int cnt = 0;
int ans[200005];
int N, M;
struct UnionFind {
    vector<int> root;
    vector<int> L, R, V;
    UnionFind(int N) {
        root.resize(N);
        L.resize(N);
        R.resize(N);
        V.resize(N);
        for(int i = 0; i<N;i++) {
            root[i] = -1;
            L[i] = R[i] = V[i] = i;
        }
    }
    int Find(int n) {
        if(root[n]<0) return n;
        int r = Find(root[n]);
        root[n] = r;
        return r;
    }
    void Merge(int a, int b, int d) {
       int x = Find(a), y = Find(b);
        if(x==y) {
            ans[V[x]] = min(ans[V[x]], d);
            return;
        }
        if(root[x]>root[y]) swap(x, y);
        root[x] += root[y];
        root[y] = x;
        bool isLine = true;
        if(a==L[x]) {
            int k = L[x];
            L[x] = R[x];
            R[x] = k;
        }
        if(a != R[x]) isLine = false;
        if(b == R[y]) {
            int k = L[y];
            L[y] = R[y];
            R[y] = k;
        }
        if(b != L[y]) isLine = false;
        ans[cnt] = min(ans[V[x]], ans[V[y]]);
        if(!isLine) ans[cnt] = min(ans[cnt], d);
        ans[cnt] = max(ans[cnt], d);
        if(ans[cnt]!=INF) isLine = false;
        R[x] = R[y];
        adj[cnt].push_back(V[x]);
        adj[cnt].push_back(V[y]);
        V[x] = cnt;
        cnt++;
    }
};
int par[200005][20];
int dep[200005];
void dfs(int c, int p, int d, int k) {
    k = min(k, ans[c]);
    ans[c] = k;
    par[c][0] = p;
    dep[c] = d;
    for(int n : adj[c]) {
        dfs(n, c, d+1, k);
    }
}
int LCA(int x, int y) {
    if(dep[x]<dep[y]) swap(x, y);
    int d = dep[x] - dep[y];
    int i;
    for(i=19;i>=0;i--) {
        if(d&(1<<i)) x = par[x][i];
    }
    if(x==y) return x;
    for(i=19;i>=0;i--) {
        if(par[x][i]!=par[y][i]) {
            x = par[x][i], y = par[y][i];
        }
    }
    assert(par[x][0]==par[y][0]);
    return par[x][0];
}
void init(int _N, int _M,vector<int> _U, vector<int> _V, vector<int> _W) {
    N = _N, M = _M;
    int i, j;
    for(i=0;i<M;i++) Edge[i] = {_W[i], _U[i], _V[i]};
    cnt = N;
    for(i=0;i<=2*N;i++) ans[i] = INF;
    sort(Edge, Edge+M);
    UnionFind UF(N);
    for(i=0;i<M;i++) {
        UF.Merge(Edge[i][1], Edge[i][2], Edge[i][0]);
    }
    dfs(cnt-1, cnt, 0, INF);
    par[cnt][0] = cnt;
    /*for(i=0;i<=cnt;i++) {
        cout << par[i][0] << ' ';
    }
    cout << '\n';
    for(i=0;i<=cnt;i++) {
        cout << ans[i] << ' ';
    }
    cout << '\n';*/
    for(j=1;j<20;j++) {
        for(i=0;i<=cnt;i++) {
            par[i][j] = par[par[i][j-1]][j-1];
        }
    }
}

int getMinimumFuelCapacity(int X, int Y) {
    int v = ans[LCA(X, Y)];
    //cout << X << ' ' << Y << ' ' << LCA(X, Y) << '\n';
    return (v==INF?-1:v);
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5008 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Incorrect 3 ms 5020 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5008 KB Output is correct
3 Correct 275 ms 38848 KB Output is correct
4 Correct 260 ms 40324 KB Output is correct
5 Correct 295 ms 39604 KB Output is correct
6 Correct 257 ms 40224 KB Output is correct
7 Correct 267 ms 39944 KB Output is correct
8 Correct 268 ms 38700 KB Output is correct
9 Correct 308 ms 39764 KB Output is correct
10 Correct 260 ms 38456 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5008 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Incorrect 3 ms 5020 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5008 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Incorrect 3 ms 5020 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5008 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Incorrect 3 ms 5020 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5008 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Incorrect 3 ms 5020 KB Output isn't correct
5 Halted 0 ms 0 KB -