Submission #879439

#TimeUsernameProblemLanguageResultExecution timeMemory
879439CamillusSwapping Cities (APIO20_swap)C++17
6 / 100
76 ms10224 KiB
/// @author Camillus #include "swap.h" #include "bits/stdc++.h" using namespace std; int mx = -1; void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) { vector<int> E(M); iota(E.begin(), E.end(), 0); sort(E.begin(), E.end(), [&W](int i, int j) -> bool { return W[i] < W[j]; }); if (M == N) mx = *max_element(W.begin(), W.end()); } int getMinimumFuelCapacity(int X, int Y) { return 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...