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 <bits/stdc++.h>
#include <vector>
using namespace std;
map<pair<int,int> , int >mp;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
mp[{0,1}]=-1;
}
int getMinimumFuelCapacity(int X, int Y){
if(X==0&&Y==1)return mp[{X,Y}];
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... |