#include <iostream>
#include <vector>
#include <algorithm>
#include "parks.h"
using namespace std;
int n;
int construct_roads(vector<int> x, vector<int> y){
n = x.size();
vector<pair<int, int>> yl(n);
for(int i = 0; i<n; i++){
yl[i] = {y[i], i};
}
sort(yl.begin(), yl.end());
vector<int> roadU;
vector<int> roadD;
vector<int> benchX;
vector<int> benchY;
for(int i = 0; i<n-1; i++){
if(yl[i].first+2 != yl[i+1].first) return 0;
roadU.push_back(yl[i].second);
roadD.push_back(yl[i+1].second);
benchX.push_back(1);
benchY.push_back(yl[i].first+1);
}
build(roadU, roadD, benchX, benchY);
return 1;
}
// int main(void){
// freopen("input.txt", "r", stdin);
// int ni;
// cin>>ni;
// vector<int> c1(ni), l1(ni);
// for(int i = 0; i<ni; i++) cin>>c1[i];
// for(int i = 0; i<ni; i++) cin>>l1[i];
// int ans = construct_roads(c1, l1);
// }
