Submission #405890

#TimeUsernameProblemLanguageResultExecution timeMemory
405890tengiz05Swapping Cities (APIO20_swap)C++17
6 / 100
170 ms14092 KiB
#include "swap.h" #include <vector> int ans; void init(int n, int m, std::vector<int> U, std::vector<int> V, std::vector<int> W) { std::vector<std::vector<std::pair<int, int>>> e(n); if (m == n - 1) { ans = -1; } else { for (int i = 0; i < m; i++) { e[U[i]].emplace_back(V[i], W[i]); e[V[i]].emplace_back(U[i], W[i]); ans = std::max(ans, W[i]); } } } int getMinimumFuelCapacity(int X, int Y) { return ans; }
#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...