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>
using namespace std;
int N,M;
vector<int> U,V,W;
int m = 0;
void init(int NN, int MM,
std::vector<int> UU, std::vector<int> VV, std::vector<int> WW) {
N = NN;
M = MM;
U = UU;
V = VV;
W = WW;
for(int x:W) m = max(m,x);
}
int getMinimumFuelCapacity(int X, int Y) {
if(N == M) return m;
else return -1;
}
# | 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... |