Submission #961356

#	Time	Username	Problem	Language	Result	Execution time	Memory
961356		Mohamed_Kachef06	Swapping Cities (APIO20_swap)	C++17	0 / 100	390 ms	20880 KiB

swap

#include "swap.h"

// #ifndef ONLINE_JUDGE
// #include "grader.cpp"
// #endif
#include <bits/stdc++.h>
using namespace std;

map<pair<int , int> , int> mp;
multiset<int> ms;

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) {
      for (int i = 0 ; i < M ; i++){
        mp[{U[i] , V[i]}] = W[i]; ms.insert(W[i]);
      }     
      n = N;  m = M; 
      u = U; v = V; w = W;
}

int getMinimumFuelCapacity(int X, int Y) {
  if (X == 0 || n < 4) return -1;
  int a = mp[{0 , Y}] , b = mp[{0 , X}];
  ms.erase(ms.find(a)); ms.erase(ms.find(b)) ;
  int ans = max({*ms.begin() , a , b});
  ms.insert(a); ms.insert(b);
  return 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