Submission #1176726

#	Time	Username	Problem	Language	Result	Execution time	Memory
1176726		Albara_Abdulhafith	Swapping Cities (APIO20_swap)	C++20	0 / 100	0 ms	324 KiB

swap

#include "swap.h"

#include <bits/stdc++.h>

using namespace std;

vector<int> cost;
int n;

void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
  n = N;
  cost.resize(N);

  for(int i = 0;i < N; i++){
    cost[V[i]] = W[i];
  }

  cost[0] = 0;
}

int getMinimumFuelCapacity(int X, int Y) {
  int mn = INT_MAX;
  for(int i = 0; i < n; i++)if(i != X and i != Y){
    mn = min(mn, cost[i]);
  }
  return max({cost[X], cost[Y], mn});
}

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