| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 431549 | MOUF_MAHMALAT | 슈퍼트리 잇기 (IOI20_supertrees) | C++14 | 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 "supertrees.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;
vector<vector<ll> >ans,v,w;
vector<pair<ll,ll> >op;
ll n,p1[1009],p2[1009];
ll gp1(ll z)
{
if(p1[z]==z)
return z;
return p1[z]=gp1(p1[z]);
}
ll gp2(ll z)
{
if(p2[z]==z)
return z;
return p2[z]=gp2(p2[z]);
}
void mrg1(ll x,ll y)
{
x=gp1(x),y=gp1(y);
if(x==y)
return;
if(v[y].size()>v[x].size())
swap(x,y);
p1[y]=x;
for(auto z:v[y])
v[x].push_back(z);
}
void mrg2(ll x,ll y)
{
x=gp2(x),y=gp2(y);
if(x==y)
return;
if(w[y].size()>w[x].size())
swap(x,y);
p2[y]=x;
for(auto z:w[y])
w[x].push_back(z);
}
int construct(vector<vector<int> > pp)
{
n=pp.size();
v.resize(n);
w.resize(n);
ans.resize(n);
for(ll i=0; i<n; i++)
ans[i].resize(n);
for(ll i=0; i<n; i++)
p1[i]=p2[i]=i,w[i].push_back(i),v[i]=w[i];
for(ll i=0; i<n; i++)
for(ll j=0; j<n; j++)
{
if(i==j)
continue;
if(pp[i][j]==3)
return 0;
if(pp[i][j]==1)
mrg1(i,j);
else if(pp[i][j]==2)
mrg2(i,j);
}
for(ll i=0; i<n; i++)
{
if(p1[i]==i)
{
for(ll j=1; j<v[i].size(); j++)
op.push_back({v[i][0],v[i][j]});
}
if(p2[i]==i&&w[i].size()>1)
{
if(w[i].size()<3)
return 0;
for(ll j=0; j<w[i].size()-1; j++)
op.push_back({w[i][j],w[i][j+1]});
op.push_back({w[i][0],w[i].back()});
}
}
for(ll i=0; i<n; i++)
for(ll j=0; j<n; j++)
{
ll x=gp1(i),y=gp1(j);
if(pp[i][j]==0&&x==y)
return 0;
ll xx=gp2(i),yy=gp2(j);
if(pp[i][j]==0&&xx==yy)
return 0;
if(x==y&&pp[i][j]!=1)
return 0;
if(xx==yy&&p[i][j]!=2)
return 0;
}
for(auto z:op)
ans[z.first][z.second]=ans[z.second][z.first]=1;
build(ans);
return 1;
}