#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
struct point
{
int x,y,idx;
bool operator<(point const& other)const
{
return y<other.y;
}
};
map<pair<int,int>,int>number;
int construct_roads(vector<int> x, vector<int> y) {
if (x.size() == 1) {
build({}, {}, {}, {});
return 1;
}
vector<point>v[2];
int n=x.size();
for(int i=0;i<n;i++)
{
number[{x[i],y[i]}]=i;
if(x[i]==2)v[0].push_back({x[i],y[i],i});
else v[1].push_back({x[i],y[i],i});
}
if(v[0].size()==0)
{
sort(v[1].begin(),v[1].end());
vector<int>ans1,ans2,ans3,ans4;
for(int i=1;i<v[1].size();i++)
{
if(v[1][i].y-v[1][i-1].y>2)return 0;
ans1.push_back(v[1][i-1].idx);
ans2.push_back(v[1][i].idx);
ans3.push_back(3);
ans4.push_back(v[1][i].y-1);
}
build(ans1,ans2,ans3,ans4);
return 1;
}
if(v[1].size()==0)
{
sort(v[0].begin(),v[0].end());
vector<int>ans1,ans2,ans3,ans4;
for(int i=1;i<v[0].size();i++)
{
if(v[0][i].y-v[0][i-1].y>2)return 0;
ans1.push_back(v[0][i-1].idx);
ans2.push_back(v[0][i].idx);
ans3.push_back(3);
ans4.push_back(v[0][i].y-1);
}
build(ans1,ans2,ans3,ans4);
return 1;
}
sort(v[0].begin(),v[0].end());
sort(v[1].begin(),v[1].end());
vector<pair<int,int> >intervals[2];
int l=v[0][0].y;
vector<int>ans1,ans2,ans3,ans4;
for(int i=1;i<v[0].size();i++)
{
if(v[0][i].y-v[0][i-1].y!=2)
{
intervals[0].push_back({l,v[0][i-1].y});
l=v[0][i].y;
}
else
{
ans1.push_back(v[0][i-1].idx);
ans2.push_back(v[0][i].idx);
ans3.push_back(v[0][i-1].x-1);
ans4.push_back(v[0][i-1].y+1);
}
}
intervals[0].push_back({l,v[0].back().y});
l=v[1][0].y;
for(int i=1;i<v[1].size();i++)
{
if(v[1][i].y-v[1][i-1].y!=2)
{
intervals[1].push_back({l,v[1][i-1].y});
l=v[1][i].y;
}
else
{
ans1.push_back(v[1][i-1].idx);
ans2.push_back(v[1][i].idx);
ans3.push_back(v[1][i-1].x+1);
ans4.push_back(v[1][i-1].y+1);
}
}
intervals[1].push_back({l,v[1].back().y});
for(int i1=0;i1<intervals[0].size();i1++)
{
for(int i2=0;i2<intervals[1].size();i2++)
{
if(intervals[0][i1].second<intervals[1][i2].first)continue;
if(intervals[0][i1].first>intervals[1][i2].second)continue;
int p1=min(intervals[0][i1].second,intervals[1][i2].second);
ans1.push_back(number[{2,p1}]);
ans2.push_back(number[{4,p1}]);
ans3.push_back(3);
ans4.push_back(p1-1);
}
}
build(ans1,ans2,ans3,ans4);
return 1;
}
