# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
735416 | keisuke6 | 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 "swap.h"
#include <vector>
using namespace std;
int N,M;
vector<int> U,V,W;
void init(int NN, int MM,
std::vector<int> UU, std::vector<int> VV, std::vector<int> WW) {
N = NN;
M = MM;
U = UU;
V = VV;
W = WW;
}
int getMinimumFuelCapacity(int X, int Y) {
if(N == M) return *max_element(W.begin(),W.end());
else return -1;
}