# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
394260 | Sugardorj | Swapping Cities (APIO20_swap) | C++14 | 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 <bits/stdc++.h>
using namespace std;
int i,j,s,t;
int a[261523],b[234567],l,r,tt,k,y,z,n,m,N,M,x;
vector<int>te,so, p[1234],an;
void init(int N, int M, vector <int> U,vector <int> V, vector <int> W) {
m= W[0];
for (auto u:W)
m=max (m,u);
}
int getMinimumFuelCapacity(int u, int v) {
if (N==M+1)
return -1;
m= W[0];
for (auto u:W)
m=max (m,u);
return m;
}