#include "walk.h"
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > adj[2000005], tor[100005];
vector<pair<pair<int, int>, int> > vec;
priority_queue<pair<int, int> > pq;
map<pair<int, int>, int> mp;
long long dist[2000005];
set<pair<int, int> > s;
bool visited[2000005];
long long min_distance(vector<int> x, vector<int> h, vector<int> l, vector<int> r, vector<int> y, int a, int b)
{
int n=x.size(), m=y.size(), ind=0, cnt=0;
for (int i=0; i<m; i++)
{
vec.push_back({{l[i], 0}, i});
vec.push_back({{r[i], 1}, i});
}
sort(vec.begin(), vec.end());
for (int i=0; i<n; i++)
{
while (ind!=m*2 && vec[ind].first<=make_pair(i, 0))
{
if (vec[ind].first.second)
{
s.erase({y[vec[ind].second], vec[ind].second});
// cout << "s erase " << y[vec[ind].second] << ' ' << vec[ind].second << '\n';
}
else
{
s.insert({y[vec[ind].second], vec[ind].second});
// cout << "s insert " << y[vec[ind].second] << ' ' << vec[ind].second << '\n';
}
ind++;
}
mp[{x[i], 0}]=(++cnt);
// cout << "mp " << x[i] << ' ' << 0 << ' ' << cnt << '\n';
int pre=0;
for (auto itr=s.begin(); itr!=s.end(); itr++)
{
int fi=itr->first, se=itr->second;
if (fi>h[i])
break;
tor[se].push_back({x[i], fi});
if (!mp[{x[i], fi}])
{
mp[{x[i], fi}]=(++cnt);
// cout << "mp " << x[i] << ' ' << fi << ' ' << cnt << '\n';
adj[cnt-1].push_back({cnt, fi-pre});
adj[cnt].push_back({cnt-1, fi-pre});
pre=fi;
}
}
}
for (int j=0; j<m; j++)
{
for (int k=1; k<tor[j].size(); k++)
{
int u=mp[tor[j][k-1]], v=mp[tor[j][k]], w=tor[j][k].first-tor[j][k-1].first;
adj[u].push_back({v, w});
adj[v].push_back({u, w});
}
}
a=mp[{x[a], 0}];
b=mp[{x[b], 0}];
for (int i=1; i<=cnt; i++)
dist[i]=1e18;
dist[a]=0;
pq.push({0, a});
while (!pq.empty())
{
int u=pq.top().second;
pq.pop();
if (visited[u])
continue;
visited[u]=1;
for (int i=0; i<adj[u].size(); i++)
{
int v=adj[u][i].first, w=adj[u][i].second;
if (dist[u]+w<dist[v])
{
dist[v]=dist[u]+w;
pq.push({-dist[v], v});
}
}
}
return dist[b]==1e18?-1:dist[b];
}
