#include "swap.h"
#include "bits/stdc++.h"
#include "grader.cpp"
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define int long long
template<class T> bool umin(T& a, const T b) { if(a > b) { a = b; return 1; } return 0; }
template<class T> bool umax(T& a, const T b) { if(a < b) { a = b; return 1; } return 0; }
const int NN = 1e5+5;
int mx = 0, ok, res, d[NN], n, m;
vector<pair<int, int>> edges[NN];
vector<pair<int, int>> mm;
void init(int32_t N, int32_t M,
vector<int32_t> a, vector<int32_t> b, vector<int32_t> c) {
n = N, m = M;
for(int i=0;i<m;i++){
edges[a[i]].pb({b[i], c[i]});
edges[b[i]].pb({a[i], c[i]});
mx = max(mx, (int)c[i]);
}
if(n == m) { ok = -1, res = mx; }
else if(n == m+1){
res = -1;
ok = 1;
for(int i=0;i<m;i++) ok &= (min(a[i], b[i]) == 0);
if(ok){
for(int i=0;i<m;i++) d[max(a[i], b[i])] = c[i];
for(int i=1;i<n;i++) mm.pb({d[i], i});
sort(mm.begin(), mm.end());
mm.resize(3);
} else ok = -1;
}
}
/*
5 6
0 1 4
0 2 4
1 2 1
1 3 2
2 3 3
1 4 10
3
1 2
2 4
0 1
*/
const int mod = 1e9+7;
int mn[NN], par[NN], bad[NN];
int32_t getMinimumFuelCapacity(int32_t x, int32_t y) {
if(ok == -1) return res;
if(x > y) swap(x, y);
if(n == 2) return -1;
if(n <= 1000){
priority_queue<pair<int, int>> qq;
qq.push({0, x});
memset(mn, 127, sizeof mn);
memset(bad, 0, sizeof bad);
memset(par, 0, sizeof par);
par[x] = -1;
mn[x] = 0;
while(!qq.empty()){
auto u = qq.top(); qq.pop();
if(mn[u.ss] < -u.ff) continue;
for(auto x : edges[u.ss]) if(umin(mn[x.ff], max(mn[u.ss], x.ss))) par[x.ff] = u.ss, qq.push({-mn[x.ff], x.ff});
}
int trr = mn[y];
int tt = y;
vector<int> bads;
while(~tt){
bads.pb(tt);
bad[tt] = 1;
tt = par[tt];
}
int rr = mod;
vector<pair<int, int>> nall;
for(int i=0;i<n;i++){
if(bad[i]){
if(i == y || i == x){
int mn = mod, in = -1, mn2 = mod;
for(auto x : edges[i]){
if(bad[x.ff]) continue;
if(umin(mn, x.ss)) in = x.ff;
} for(auto x : edges[i]){
if(bad[x.ff] || in == x.ff) continue;
umin(mn2, x.ss);
} umin(rr, mn2);
//cout<<mn<<" "<<mn2<<"\n";
} else {
int mn = mod;
for(auto x : edges[i]){
if(bad[x.ff]) continue;
umin(mn, x.ss);
} umin(rr, mn);
}
}
}
//for(int i=0;i<sz(bads)-1;i++){
//int a = bads[i], b = bads[i+1];
//qq.push({0, x});
//for(int i=0;i<n;i++) mn[i] = mod;
//mn[x] = 0;
//while(!qq.empty()){
//auto u = qq.top(); qq.pop();
//if(mn[u.ss] < -u.ff) continue;
//for(auto x : edges[u.ss]){
//if(x.ff == a && u.ss == b) continue;
//if(x.ff == b && u.ss == a) continue;
//if(umin(mn[x.ff], max(mn[u.ss], x.ss))) qq.push({-mn[x.ff], x.ff});
//}
//}
//}
for(auto xx : edges[x]) if(bad[xx.ff]) nall.pb({xx.ff, x});
qq.push({0, x});
memset(mn, 127, sizeof mn);
mn[x] = 0;
while(!qq.empty()){
auto u = qq.top(); qq.pop();
if(mn[u.ss] < -u.ff) continue;
for(auto x : edges[u.ss]){
int ok = 1;
for(auto xx : nall) if(xx == make_pair(u.ss, x.ff) || xx == make_pair(x.ff, u.ss)) ok = 0;
if(ok && umin(mn[x.ff], max(mn[u.ss], x.ss))) qq.push({-mn[x.ff], x.ff});
}
}
umin(rr, mn[y]);
nall.clear();
for(auto xx : edges[y]) if(bad[xx.ff]) nall.pb({xx.ff, y});
qq.push({0, x});
memset(mn, 127, sizeof mn);
mn[x] = 0;
while(!qq.empty()){
auto u = qq.top(); qq.pop();
if(mn[u.ss] < -u.ff) continue;
for(auto x : edges[u.ss]){
int ok = 1;
for(auto xx : nall) if(xx == make_pair(u.ss, x.ff) || xx == make_pair(x.ff, u.ss)) ok = 0;
if(ok && umin(mn[x.ff], max(mn[u.ss], x.ss))) qq.push({-mn[x.ff], x.ff});
}
}
umin(rr, mn[y]);
if(rr == mod) return -1;
return max(rr, trr);
}
if(x == 0){
if(y == mm[0].ss || y == mm[1].ss || y == mm[2].ss) return max({mm[0].ff, mm[1].ff, mm[2].ff});
else return max({d[y], mm[0].ff, mm[1].ff});
} else {
if(n == 3) return -1;
if((mm[0].ss == y || mm[1].ss == y) && (mm[0].ss == x || mm[1].ss == x)) return max({d[x], d[y], mm[2].ff});
else if(x == mm[0].ss || y == mm[0].ss) return max({d[x], d[y], mm[1].ff});
else return max({d[x], d[y], mm[0].ff});
}
}
Compilation message
/usr/bin/ld: /tmp/ccfaD9ii.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccITMeEg.o:swap.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status
