Submission #1230067

#TimeUsernameProblemLanguageResultExecution timeMemory
1230067JerSwapping Cities (APIO20_swap)C++20
0 / 100
42 ms4072 KiB
#include "swap.h" #include <bits/stdc++.h> #include <vector> using namespace std; int n, m, res = 0; void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) { n = N, m = M; if (n == m) sort(W.begin(), W.end()), res = W[2]; } int getMinimumFuelCapacity(int X, int Y) { return (n > 3) ? res : -1; }
#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...