Submission #962352

#TimeUsernameProblemLanguageResultExecution timeMemory
962352Mohamed_Kachef06Swapping Cities (APIO20_swap)C++17
6 / 100
81 ms11452 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) {
  return (m == n-1 ? -1 : 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...