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>
int ans;
void init(int n, int m, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
std::vector<std::vector<std::pair<int, int>>> e(n);
if (m == n - 1) {
ans = -1;
} else {
for (int i = 0; i < m; i++) {
e[U[i]].emplace_back(V[i], W[i]);
e[V[i]].emplace_back(U[i], W[i]);
ans = std::max(ans, W[i]);
}
}
}
int getMinimumFuelCapacity(int X, int Y) {
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |