Submission #962363

#	Time	Username	Problem	Language	Result	Execution time	Memory
962363		Mohamed_Kachef06	Swapping Cities (APIO20_swap)	C++17	0 / 100	2033 ms	7252 KiB

swap

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

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27