#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
typedef pair<ll, ll> pll;
#define vc vector
#define st first
#define nd second
#define all(a) a.begin(), a.end()
#define sz(a) (ll)a.size()
#define pub push_back
#define pob pop_back
ll construct_roads(std::vc<ll> x, std::vc<ll> y) {
ll n = sz(x);
vc<pll> a(n);
for (ll i = 0; i < n; i++)
a[i] = {y[i], i};
sort(all(a));
vc<ll> ru, rv, rx, ry;
for (ll i = 0; i + 1 < n; i++) {
if (a[i].st + 2 != a[i + 1].st)
return 0;
ru.pub(a[i].nd);
rv.pub(a[i + 1].nd);
rx.pub(3);
ry.pub(a[i].st + 1);
}
build(ru, rv, rx, ry);
return 1;
}
