# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
622404 | moyindavid | 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 <bits/stdc++.h>
#include "parks.h"
#define pb push_back
using namespace std;
int N = 2e5+5;
vector<bool> vis(N,false);int cnt=0;set<int> node[N];vector<int> u,v,a,b;
void dsf(int i, vector<int> x, vector<int> y){
vis[i]=true;
cnt++;
for(auto j: node[i]){
if(!vis[j]){
u.pb(i);v.pb(j);
if(x[i]==x[j]){
b.pb((y[i]+y[j])/2);
if(x[i]==2)a.pb(x[i]-1);
else a.pb(x[i]+1);
}
else{
a.pb((x[i]+x[j])/2);
b.pb(y[i]-1);
}
dsf(j,x,y);
}
}
}
int construct_roads(vector<int> x, vector<int> y){
map<pair<int,int>,bool> m;
map<pair<int,int>,int> n;
for(int i=0;i<x.size();i++){
m[{x[i],y[i]}]=1;
n[{x[i],y[i]}]=i;
}
for(int i=0;i<x.size();i++){
if(m.count({x[i]-2,y[i]})>0){node[i].insert(n[{x[i]-2,y[i]}]);node[n[{x[i]-2,y[i]}]].insert(i);}
if(m.count({x[i]+2,y[i]})>0){node[i].insert(n[{x[i]+2,y[i]}]);node[n[{x[i]+2,y[i]}]].insert(i);}
if(m.count({x[i],y[i]-2})>0){node[i].insert(n[{x[i],y[i]-2}]);node[n[{x[i],y[i]-2}]].insert(i);}
if(m.count({x[i],y[i]+2})>0){node[i].insert(n[{x[i],y[i]+2}]);node[n[{x[i],y[i]+2}]].insert(i);}
}
dsf(0,x,y);
if(cnt==x.size()){
build(u,v,a,b);
return 1;
}
return 0;
}