Submission #1176726

#TimeUsernameProblemLanguageResultExecution timeMemory
1176726Albara_Abdulhafith자매 도시 (APIO20_swap)C++20
0 / 100
0 ms324 KiB
#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});
}
#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...