# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977595 | Ning07 | 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"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define L(i, j, k) for (int i = (j); i <= k; i++)
#define R(i, j, k) for (int i = (j); i >= k; i--)
int N, M;
int ok = true;
int mx = -1;
vector<vector<pair<int, int>>> adj;
void init(int _N, int _M, std::vector<int> _U, std::vector<int> _V, std::vector<int> _W) {
N = _N; M = _M;
adj.resize(N + 2);
for (int i = 0; i < m; i++)
mx = max(mx, W[i]);
for (int i = 0; i < n; i++)
if (adj[i].size() <= 1)
ok = false;
}
int getMinimumFuelCapacity(int X, int Y) {
if (!ok) return -1;
return mx;
}