# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
395267 | suren | Swapping Cities (APIO20_swap) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mk make_pair
#define F first
#define S second
int n, m;
pair < int , pair< int, int > > p[200045];
int parent[100045];
int get( ll x ){
if( parent[x] == x )
return x;
return parent[x] = get( parent[x] );
}
void init(int N, int M,
std::vector<int> U, std::vector<int> V, std::vector<int> W) {
int i;
n = N;m = M;
for( i = 0; i < m; i ++ ){
p[i].second.F=U[i];
p[i].second.S=V[i];
p[i].first=W[i];
}
sort( p, p + m );
}
int getMinimumFuelCapacity(int X, int Y) {
map < int, int > mp;
int i;
int flag = false;
mp.clear();
for( i = 0; i < n; i ++ )
vc[i].clear();
for( i = 0; i < n; i ++ )
parent[i] = i;
for( i = 0; i < m; i ++ ){
int a = get( p[i].second.F );
int b = get( p[i].second.S );
if( a != b ){
if( b > a ){
swap(a, b);
}
parent[b] = a;
}
int parx = get( X );
int pary = get( Y );
mp[ p[i].S.F ] = 1;
mp[ p[i].S.S ] = 1;
if( parx != pary )
continue;
if( mp.size() == i+2 )
continue;
return p[i].F;
}
return -1;
}