Pagini recente » Cod sursa (job #698720) | Cod sursa (job #287943) | Cod sursa (job #2783456) | Cod sursa (job #403769) | Cod sursa (job #2694540)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("felinare.in");
ofstream fout("felinare.out");
int n,m,ok,viz[8192],st[8192],dr[8192],nr;
int st2[8192],dr2[8192];
vector<int> v[8192];
int pairup(int x)
{
if(viz[x])return 0;
viz[x]=1;
for(int i=0;i<v[x].size();i++)
{
int y=v[x][i];
if(st[i]==0||pairup(st[i]))
{
dr[x]=y;
st[y]=x;
dr2[x]=1;
return 1;
}
}
}
void dfs(int x)
{
for(int i=0;i<v[x].size();i++)
{
int next=v[x][i];
if(st2[next]==0)
{
st2[next]=1;
st2[dr[next]]=0;
dfs(dr[next]);
}
}
}
int main()
{
int x,y;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
}
ok=1;
while(ok)
{
ok=0;
for(int i=1;i<=n;i++)
{
if(dr[i]==0&&pairup(i))ok=1;
}
if(ok)memset(viz,0,sizeof(viz));
}
for(int i=1;i<=n;i++)
{
if(dr[i])nr++;
}
fout<<2*n-nr<<'\n';
for(int i=1;i<=n;i++)
if(dr2[i]==0)dfs(i);
for(int i=1;i<=n;i++)
{
if(st2[i]==0&&dr2[i]==0)fout<<3;
else if(st2[i]==1&&dr2[i]==0)fout<<1;
else if(st2[i]==0&&dr2[i]==1)fout<<2;
else fout<<0;
fout<<'\n';
}
}