제출 #962351

#제출 시각아이디문제언어결과실행 시간메모리
962351Mohamed_Kachef06Swapping Cities (APIO20_swap)C++17
0 / 100
2029 ms9916 KiB
#include "swap.h"
//#include "grader.cpp"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

int n ,  m; 
vector<int> u , v , w; 

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; 
}

int getMinimumFuelCapacity(int X, int Y) {
  return (m == n-1 ? -1 : *max_element(w.begin() , w.end()));
}
#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...