# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1201620 | dibamboo23 | Swapping Cities (APIO20_swap) | C++20 | 0 ms | 0 KiB |
#include "swap.h"
#include <bits/stdc++.h>
int n,m;
int sum=0;
void init(int N, int M,std::vector<int> U, std::vector<int> V, std::vector<int> W){
n=N;
m=M;
sort(W.begin(),W.end());
if((int)W.sz>1)sum=max(W[0],W[1]);
return;
}
int getMinimumFuelCapacity(int X, int Y) {
if(n==2&&m>1)return sum;
return -1;
}