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 "grader.cpp"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int n , m;
vector<int> u , v , w;
int mx ;
void init(int N, int M,
std::vector<int> U, std::vector<int> V, std::vector<int> W) {
n = N; m = M; u = U; v = V; w = W;
mx = *max_element(w.begin() , w.end());
}
int getMinimumFuelCapacity(int X, int Y) {
int ans = 1e9;
for (int i = 0 ; i < m ; i++){
if (v[i] != Y && v[i] != X) ans = min(ans , w[i]);
}
if (ans != 1e9){
for (int i = 0 ; i < m ; i++){
if (v[i] == Y || v[i] == X) ans = max(ans , w[i]);
}
}
return (ans == 1e9 ? -1 : 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... |