# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165610 | SmuggingSpun | Swapping Cities (APIO20_swap) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
#include "swap.h"
using namespace std;
const int lim = 1e5 + 5;
bool is_sub2 = false;
int n, m, u[lim], v[lim], w[lim];
vector<int>g[lim];
void init(int N, int M, vector<int>U, vector<int>V, vector<int>W){
n = N:
m = M;
for(int i = 0; i < m; i++){
g[u[i] = U[i]].emplace_back(i);
g[v[i] = V[i]].emplace_back(i);
W[i] = W[i];
}
if(is_sub2 = (*max_element(u, u + m) == 0 && m == n - 1)){
return;
}
}
int getMinimumFuelCapacity(int x, int y){
if(is_sub2){
if(x == 0 || y == 0){
return -1;
}
return max(w[g[x][0]], w[g[y][0]]);
}
}