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 res = 0;
bool cycle = 0;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
if(N == M) cycle = 1;
for(int i = 0; i < M; i++) res = max(res, W[i]);
}
int getMinimumFuelCapacity(int X, int Y) {
if(cycle) return res;
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... |