# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493424 | vendx_greyback | 자매 도시 (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 "swap.h"
#include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5;
int par[mxn], mx = 0;
bool isLine = true;
int get(int u){
if(u == par[u])
return u;
return par[u] = get(par[u]);
}
void join(int u, int v){
u = get(u);
v = get(v);
par[u] = v;
}
void init(int n, int m, int u[], int v[], int w[]){
for(int i = 0; i < n; i++)
par[i] = i;
for(int i = 0; i < m; i++){
if(get(u[i]) == get(v[i]))
isLine = false;
else
join(u[i], v[i]);
mx = max(mx, w[i]);
}
}
int getMinimumFuelCapacity(int x, int y){
return (isLine? -1: mx);
}