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 "bits/stdc++.h"
#include "swap.h"
using namespace std;
const int NN=100005;
int len[NN];
multiset<int> s;
void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) {
for(int i=0; i<M; i++){
int v = V[i];
len[v] = W[i];
s.insert(len[v]);
}
}
int getMinimumFuelCapacity(int X, int Y) {
int mx = max(len[X],len[Y]);
s.erase(s.find(len[X]));
s.erase(s.find(len[Y]));
mx=max(mx, *s.begin());
s.insert(len[X]); s.insert(len[Y]);
return mx;
}
# | 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... |