# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
342790 | aryan12 | Swapping Cities (APIO20_swap) | C++17 | 186 ms | 10324 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 <bits/stdc++.h>
using namespace std;
#include "swap.h"
int n, m;
int maxx = 0;
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
n = N;
m = M;
for(int i = 0; i < W.size(); i++) {
maxx = max(maxx, W[i]);
}
}
int getMinimumFuelCapacity(int X, int Y) {
if(m == n - 1)
return -1;
return maxx;
}
Compilation message (stderr)
# | 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... |