| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1200643 | Mohamed_Kachef06 | Swapping Cities (APIO20_swap) | C++17 | 2096 ms | 5296 KiB |
#include "swap.h"
#include <bits/stdc++.h>
using namespace std;
#include <vector>
int n , m;
vector<int> u , v , w;
void init(int N, int M,vector<int> U, vector<int> V, vector<int> W) {
n = N , m = M , u = U , V = v , w = W;
}
int getMinimumFuelCapacity(int X, int Y) {
return (m == n-1 ? -1 : *max_element(w.begin() , w.end()));
}
| # | 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... | ||||
