# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
965712 | pcc | 자매 도시 (APIO20_swap) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "swap.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fs first
#define sc second
const int mxn = 1e5+10;
int ans = 0;
vector<pii> v;
int arr[mxn];
int N,M;
void init(int NN, int MM,
std::vector<int> U, std::vector<int> V, std::vector<int> W) {
N = NN,M = MM;
for(int i = 0;i<M;i++){
arr[V[i]] = W[i];
v.push_back(pii(W[i],V[i]));
}
sort(v.begin(),v.end());
return;
}
int getMinimumFuelCapacity(int X, int Y) {
if(N<=2)return -1;
if(!X){
if(Y == v[0].sc)return v[1].fs;
else return arr[Y];
}
if(N<=3)return -1;
if(arr[X]>arr[Y])swap(X,Y);
if(X == arr[0].sc&&Y == arr[1].sc)return arr[2].fs;
else return arr[Y];
}