| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 394280 | irmuun | Swapping Cities (APIO20_swap) | C++17 | 0 ms | 0 KiB |
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 <btis/stdc++.h>
using namespace std;
int ans=0,i;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
ans=W[0];
for(i=0;i<M;i++){
ans=max(ans,W[i]);
}
}
int getMinimumFuelCapacity(int X, int Y) {
if(M+1==N){
return 0;
}
else{
return ans;
}
}