Submission #1225961

#	Time	Username	Problem	Language	Result	Execution time	Memory
1225961		Godgift42	Swapping Cities (APIO20_swap)	C++20	7 / 100	55 ms	8272 KiB

swap

#include "swap.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;

vector<int> u;
vector<int> v;
vector<int> w;
vector<pair<int,int>> sm;
vector<int> kath;
int n;
void init(int N, int M,
          std::vector<int> U, std::vector<int> V, std::vector<int> W) {
  u=U;
  v=V;
  w=W;
  n=N;
  kath.resize(N);
  for(int i=0;i<M;i++){
    kath[v[i]]=w[i];
    sm.push_back({w[i],v[i]});
  }
  sort(sm.begin(),sm.end());
}

int getMinimumFuelCapacity(int X, int Y) {
  if(n<=3)return -1;
  if(X==0){
    if(Y==sm[0].second)return sm[2].first;
    else if(Y==sm[1].second)return sm[2].first;
    else return kath[Y];
  }
  if((X==sm[0].second and Y==sm[1].second) or (X==sm[1].second and Y==sm[0].second))return sm[2].first;
  return max(kath[X],kath[Y]);
}

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