# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
436686 | PiejanVDC | 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>
using namespace std;
int construct_roads(vector<int>x, vector<int> y) {
vector<int>possible_x(200005,0),possible_y(200005,0);
for(int i = 1 ; i <= x.size() ; i++) possible_x[x[i]]=i;
for(int i = 1 ; i <= y.size() ; i++) possible_y[y[i]]=i;
vector<pair<int,int>>combined(y.size());
for(int i = 0 ; i < y.size() ; i++) {
combined[i].first=x[i],combined[i].second=y[i];
}
vector<int>u(y.size()),v(y.size()),a(y.size()),b(y.size());
for(int i = 0 ; i < y.size() ; i++) {
if(possible_x[combined[i].first-2]) {
u[i]=possible_x[combined[i].first-2]-1;
v[i]=i;
a[i]=combined[i].first+1;
b[i]=combined[i].second+1;
} else if(possible_x[combined[i].first+2]) {
u[i]=possible_x[combined[i].first+2]-1;
v[i]=i
a[i]=combined[i].first+1;
b[i]=combined[i].second+1;
} else if(possible_y[combined[i].second-2]) {
u[i]=possible_y[combined[i].second-2]-1;
v[i]=i
a[i]=combined[i].first+1;
b[i]=combined[i].second+1;
} else if(possible_y[combined[i].second+2]) {
u[i]=possible_y[combined[i].second+2]-1;
v[i]=i
a[i]=combined[i].first+1;
b[i]=combined[i].second+1;
} else {
return 0;
}
}
build(u,v,a,b);
return 1;
}