#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
struct edges{
int x,y,x1,y1;
};
int construct_roads(std::vector<int> x, std::vector<int> y) {
map<pair<int,int>,bool>mp,got;
map<pair<int,int>,int>index,need;
int n = (int)x.size();
for (int i = 0;i<n;++i){
mp[{x[i],y[i]}] = true;
got[{x[i],y[i]}] = false;
index[{x[i],y[i]}] = i;
}
auto comp = [&](int a,int b,int c,int d){
if (a<c){
return (edges){a,b,c,d};
}
else if (c < a){
return (edges){c,d,a,b};
}
else if ( b < d){
return (edges){a,b,c,d};
}
return (edges){c,d,a,b};
};
vector<edges>ans;
vector<int>dx = {2,0,-2,0};
vector<int>dy = {0,2,0,-2};
function<void(int,int)> dfs = [&](int u,int v){
got[{u,v}] = true;
for (int i = 0;i<4;++i){
int xx = u + dx[i];
int yy = v + dy[i];
if (mp[{xx,yy}] && !got[{xx,yy}]){
ans.push_back(comp(u,v,xx,yy));
dfs(xx,yy);
}
}
};
bool ok = true;
dfs(x[0],y[0]);
for (int i = 0;i<n;++i){
if (!got[{x[i],y[i]}]){
ok=false;
break;
}
}
if (!ok){
return 0;
}
vector<int>u,v,a,b;
queue<edges>q;
for (int i = 0;i<(int)ans.size();++i){
edges z = ans[i];
if (z.x == z.x1){
need[{z.x - 1,z.y - 1}]++;
need[{z.x + 1,z.y - 1}]++;
}
else{
need[{z.x - 1,z.y + 1}]++;
need[{z.x - 1,z.y - 1}]++;
}
q.push(z);
}
while(!q.empty()){
auto z = q.front();
q.pop();
if (z.x == z.x1){
if (need[{z.x - 1,z.y - 1}]==1){
need[{z.x - 1,z.y - 1}] = INT_MAX;
need[{z.x + 1,z.y - 1}]--;
u.push_back(index[{z.x,z.y}]);
v.push_back(index[{z.x1,z.y1}]);
a.push_back(z.x - 1);
b.push_back(z.y - 1);
}
else if (need[{z.x + 1,z.y - 1}]==1){
need[{z.x - 1,z.y - 1}]--;
need[{z.x + 1,z.y - 1}] = INT_MAX;
u.push_back(index[{z.x,z.y}]);
v.push_back(index[{z.x1,z.y1}]);
a.push_back(z.x + 1);
b.push_back(z.y - 1);
}
else q.push(z);
}
else{
if (need[{z.x - 1,z.y + 1}]==1){
need[{z.x - 1,z.y + 1}] = INT_MAX;
need[{z.x - 1,z.y-1}]--;
u.push_back(index[{z.x,z.y}]);
v.push_back(index[{z.x1,z.y1}]);
a.push_back(z.x - 1);
b.push_back(z.y + 1);
}
else if (need[{z.x - 1,z.y - 1}]==1){
need[{z.x - 1,z.y + 1}]--;
need[{z.x - 1,z.y - 1}] = INT_MAX;
u.push_back(index[{z.x,z.y}]);
v.push_back(index[{z.x1,z.y1}]);
a.push_back(z.x - 1);
b.push_back(z.y - 1);
}
else q.push(z);
}
}
build(u,v,a,b);
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Tree (a[0], b[0]) = (1, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4) |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Tree (a[0], b[0]) = (1, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4) |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Tree (a[0], b[0]) = (1, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4) |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Tree (a[0], b[0]) = (1, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4) |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Tree (a[0], b[0]) = (1, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4) |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
212 KB |
Tree (a[0], b[0]) = (1, 1) is not adjacent to edge between u[0]=0 @(2, 2) and v[0]=1 @(2, 4) |
| 3 |
Halted |
0 ms |
0 KB |
- |
