# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
491679 | MeGustaElArroz23 | Fountain Parks (IOI21_parks) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "parks.h"
#include<bits/stdc++.h>
#define vi vector<int>
#define pii pair<int,int>
#define vii vector<pii>
#define fi first
#define se second
int construct_roads(vi cordx, vi cordy){
int n=cordx.size();
vii v(n);
for (int i=0;i<n;i++) v[i]=pii{cordx[i],cordy[i]};
vi u; //ind fuentes
vi w;
vi a; // coord banco
vi b;
map<pii,int> indfuente;
for (int i=0;i<n;i++) indfuente[v[i]]=i+1;
set<pii> posiblesbancos;
for (pii p:v){
posiblesbancos.insert(pii{p.fi+1,p.se+1});
posiblesbancos.insert(pii{p.fi+1,p.se-1});
posiblesbancos.insert(pii{p.fi-1,p.se+1});
posiblesbancos.insert(pii{p.fi-1,p.se-1});
}
for (pii p:posiblesbancos){
if ((p.fi+p.se)%4==0){
if (indfuente[pii{p.fi+1,p.se+1}] && indfuente[pii{p.fi-1,p.se+1}]){
u.push_back(indfuente[pii{p.fi+1,p.se+1}]-1);
w.push_back(indfuente[pii{p.fi-1,p.se+1}]-1);
a.push_back(p.fi);
b.push_back(p.se);
}
else if (indfuente[pii{p.fi+1,p.se-1}] && indfuente[pii{p.fi-1,p.se-1}]){
u.push_back(indfuente[pii{p.fi+1,p.se-1}]-1);
w.push_back(indfuente[pii{p.fi-1,p.se-1}]-1);
a.push_back(p.fi);
b.push_back(p.se);
}
}
else{
if (indfuente[pii{p.fi+1,p.se+1}] && indfuente[pii{p.fi+1,p.se-1}]){
u.push_back(indfuente[pii{p.fi+1,p.se+1}]-1);
w.push_back(indfuente[pii{p.fi+1,p.se-1}]-1);
a.push_back(p.fi);
b.push_back(p.se);
}
else if (indfuente[pii{p.fi-1,p.se+1}] && indfuente[pii{p.fi-1,p.se-1}]){
u.push_back(indfuente[pii{p.fi-1,p.se+1}]-1);
w.push_back(indfuente[pii{p.fi-1,p.se-1}]-1);
a.push_back(p.fi);
b.push_back(p.se);
}
}
}
if (u.size()<n-1) return 0;
build(u,w,a,b);
return 1;
}