Submission #962363

#TimeUsernameProblemLanguageResultExecution timeMemory
962363Mohamed_Kachef06Swapping Cities (APIO20_swap)C++17
0 / 100
2033 ms7252 KiB
#include "swap.h" //#include "grader.cpp" #include <vector> #include <bits/stdc++.h> using namespace std; int n , m; vector<int> u , v , w; int mx ; void init(int N, int M, std::vector<int> U, std::vector<int> V, std::vector<int> W) { n = N; m = M; u = U; v = V; w = W; mx = *max_element(w.begin() , w.end()); } int getMinimumFuelCapacity(int X, int Y) { int ans = 1e9; for (int i = 0 ; i < m ; i++){ if (v[i] != Y && v[i] != X) ans = min(ans , w[i]); } if (ans != 1e9){ for (int i = 0 ; i < m ; i++){ if (v[i] == Y || v[i] == X) ans = max(ans , w[i]); } } return (ans == 1e9 ? -1 : 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...