# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
375301 | astoria | 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"
#include "swap.h"
#include <vector>
int mx;
bool isM;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
mx=0;
for(int i : W){
mx=max(mx,i);
}
isM=0;
if(N==M) isM=1;
}
int getMinimumFuelCapacity(int X, int Y) {
if(isM) return mx;
else return -1;
}