# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979489 | 2024-05-11T06:28:36 Z | ducksaysquack | Swapping Cities (APIO20_swap) | C++17 | 0 ms | 0 KB |
#include "swap.h" #include <bits/stdc++.h> #define int long long using namespace std; bool yes = true; int k = 0; void init(int n, int m, vector<int> u, vector<int> v, vector<int> w) { yes = n == m; for(int i=0;i<m;i++) k = max(k, w[i]); } int getMinimumFuelCapacity(int x, int y) { return yes? k:-1; }