| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 301681 | Muhammetali | Connecting Supertrees (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>
#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
vi get_comp(vector<vi>& adj,vector<bool>& vis,int k)
{
assert(vis[k]);
vis[k]=1;
vi comp(1,k);
for (int i=0;i<sz(comp);i++)
{
assert(vis[comp[i]]);
for (int j:adj[comp[i]])
{
if (!vis[j])
{
vis[comp[i]]=1;
comp.pb(i);
}
}
}
return comp;
}
int construct(vector<vi> p)
{
int n=sz(p);
vector<vi> ans(n,vi(n));
vector<vi> adjtree(n),adjcycl(n);
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
{
if (p[i][j]==3)return 0;
if (p[i][j]==1)adjtree[i].pb(j);
}
}
vector<vi>trees;
vi roots;
vector<bool> vis(n);
for (int i=0;i<n;i++)
{
if (!vis[i])
{
trees.pb(get_comp(adjtree,vis,i));
roots.pb(trees.bk.bk);
}
}
for (int i=0;i<sz(trees);i++)
{
for (int j=0;j<sz(trees);j++)
{
int k=p[roots[i]][roots[j]];
if (k==0 && i==j)return 0;
if (k==1 && i!=j)return 0;
if (k==2 && i==j)return 0;
for (auto k:trees[i])
{
for (auto l:trees[j])
{
if (p[i][j]!=k)return 0;
}
}
}
}
for (auto i:trees)
{
for (auto j:trees[i])
{
ans[i][j]=1;
}
}
for (auto i:roots)
{
for (auto j:roots)
{
if (p[i][j]==2)adjcycl[i].pb(j);
}
}
vis=vector<bool>(n);
for (auto i:roots)
{
if (!vis[i])
{
vi v=get_comp(adjcycl,vis,i);
for (auto i:v)
{
for (int j:v)
{
if (p[i][j]!=2 && i!=j)return 0;
}
}
if (sz(v)>=2)return 0;
for (auto i:v)
{
for (int j:v)
{
ans[i][j]=2;
}
}
}
}
for (int i=0;i<n;i++)
{
for (int j=0;j<n;j++)
{
ans[i][j]|=ans[j][i];
ans[j][i]|=ans[i][j];
}
}
for (int i=0;i<n;i++)ans[i][i]=0;
build(ans);
return 1;
}