# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
443081 | benedict0724 | 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.
for(int i=0;i<n;i++) link[i] = i;
for(int i=0;i<n;i++)
{
for(int j : adj[i])
{
if(y[i] < y[j])
{
u.push_back(i);
v.push_back(j);
b.push_back(y[i] + 1);
if(x[i] == 2 || (x[i] == 4 && y[i]%4 == 0))
{
a.push_back(x[i] - 1);
M2[{x[i]-1,y[i]+1}] = 1;
}
else
{
a.push_back(x[i] + 1);
M2[{x[i]+1, y[i]+1}] = 1;
}
_unite(i, j);
}
}
}
for(int i=0;i<n;i++)
{
for(int j : adj[i])
{
if(_find(i) == _find(j)) continue;
if(x[i] > x[j]) swap(i, j);
u.push_back(i);
v.push_back(j);
a.push_back(x[i] + 1);
if(M2[{x[i] + 1, y[i] + 1}]) b.push_back(y[i] - 1);
else b.push_back(y[i] + 1);
_unite(i, j);
}
}
if(CC < n-1) return 2;
build(u, v, a, b);
return 1;