| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 961347 | Mohamed_Kachef06 | Swapping Cities (APIO20_swap) | C++17 | 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"
#ifndef ONLINE_JUDGE
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
map<pair<int , int> , int> mp;
void init(int N, int M,
std::vector<int> U, std::vector<int> V, std::vector<int> W) {
for (int i = 0 ; i < N ; i++){
mp[{U[i] , V[i]}] = W[i];
}
}
int getMinimumFuelCapacity(int X, int Y) {
if (X == 0) return -1;
int a = max(mp[{0 , Y}] , mp[{0 , X}]);
return a;
}
