#include <bits/stdc++.h>
#include "parks.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
int construct_roads(vector<int> x, vector<int> y) {
vector<int> u, v, a, b;
vector<tuple<int, int, int>> points;
map<pii, int> mp;
for (int i = 0; i < x.size(); i++)
{
points.push_back({x[i], y[i], i});
mp[{x[i], y[i]}] = i;
}
sort(points.begin(), points.end());
vector<vector<int>> adj(x.size());
for (auto &p : points) {
if (get<0>(p) == 2) {
if (mp.count({4, get<1>(p)})) {
u.push_back(get<2>(p));
v.push_back(mp[{4, get<1>(p)}]);
a.push_back(3);
b.push_back(get<1>(p)-1);
adj[get<2>(p)].push_back(mp[{4, get<1>(p)}]);
adj[mp[{4, get<1>(p)}]].push_back(get<2>(p));
}
}
if (mp.count({get<0>(p), get<1>(p)+2})) {
u.push_back(get<2>(p));
v.push_back(mp[{get<0>(p), get<1>(p)+2}]);
a.push_back(get<0>(p) == 2 ? 1 : 5);
b.push_back(get<1>(p)+1);
adj[get<2>(p)].push_back(mp[{get<0>(p), get<1>(p)+2}]);
adj[mp[{get<0>(p), get<1>(p)+2}]].push_back(get<2>(p));
}
}
vector<bool> vis(x.size(), 0);
vis[0] = 1;
queue<int> q; q.push(0);
while (!q.empty())
{
int cn = q.front();q.pop();
for (int i : adj[cn]) {
if (!vis[i]) {
vis[i] = 1;
q.push(i);
}
}
}
for (int i : vis) {
if (i == 0) return 0;
}
if (x.size() == 1) {
build({}, {}, {}, {});
return 1;
}
build(u, v, a, b);
return 1;
}
