Submission #407248

#TimeUsernameProblemLanguageResultExecution timeMemory
407248promaSwapping Cities (APIO20_swap)C++17
0 / 100
102 ms8856 KiB
#include <bits/stdc++.h> using namespace std; int n, m, max_weight; void init (int N, int M, vector<int> U, vector<int> V, vector<int> W) { n = N; m = M; for (int i = 0; i < m; i ++) { max_weight = W[i]; } } int getMinimumFuelCapacity (int X, int Y) { if (n == m) { return max_weight; } else { return -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...