# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979504 | ducksaysquack | Swapping Cities (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 <bits/stdc++.h>
#define pb push_back
#define f first
#define s second
using namespace std;
int n, m;
vector<pair<int,pair<int,int>>> e;
vector<int> to(1e5+5);
void init(int N, int M, vector<int> U, vector<int> V, vector<int> W) {
n = N, m = M;
for(int i=0;i<m;i++) {e.pb({W[i],{U[i],V[i]}}); to[V[i]] = W[i];}
sort(begin(e),end(e));
}
int getMinimumFuelCapacity(int x, int y) {
if(n <= 3) return -1;
if(x > y) swap(x,y);
if(x == 0) {
int cnt = 0, mx = to[y];
for(int i=0;i<m;i++) if(e[i].s.s != y) {
cnt++, mx = max(mx, e[i].f);
if(cnt >= 2) return mx;
}
}
else for(int i=0;i<m;i++) if(e[i].s.s != x && e[i].s.s != y) return max({to[x], to[y], e[i].f});