Submission #964091

#TimeUsernameProblemLanguageResultExecution timeMemory
964091efedmrlrSwapping Cities (APIO20_swap)C++17
6 / 100
66 ms10184 KiB
#include "swap.h" #include <vector> int mx = 0; int n, m; void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) { n = N; m = M; for(int i = 0; i < n ; i++) mx = std::max(mx, W[i]); } int getMinimumFuelCapacity(int X, int Y) { return m == n - 1 ? -1 : mx; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...