Pagini recente » Cod sursa (job #2537467) | Cod sursa (job #274827) | Cod sursa (job #1455780) | Cod sursa (job #1371342) | Cod sursa (job #2399349)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("felinare.in");
ofstream g ("felinare.out");
const int nmax=1e4+3;
int viz[nmax],st[nmax],dr[nmax],n,m,a,b,ok,sol,usu[nmax];
vector <int> v[nmax];
inline int cuplez(int nod)
{
if(viz[nod]) return 0;
viz[nod]=1;
for(int i=0;i<v[nod].size();++i)
{
int urm=v[nod][i];
if(!st[urm])
{
st[urm]=nod;
dr[nod]=urm;
return 1;
}
}
for(int i=0;i<v[nod].size();++i)
{
int urm=v[nod][i];
if(cuplez(st[urm]))
{
st[urm]=nod;
dr[nod]=urm;
return 1;
}
}
return 0;
}
int main()
{
ios::sync_with_stdio(false);
f>>n>>m;
while(m--)
{
f>>a>>b;
v[a].push_back(b);
}
ok=1;
while(ok)
{
ok=0;
memset(viz,0,sizeof(viz));
for(int i=1;i<=n;++i)
{
if(!dr[i])
{
if(cuplez(i)) ok=1;
}
}
}
for(int i=1;i<=n;++i) if(dr[i]) ++sol;
g<<2*n-sol;
g<<'\n';
for(int i=1;i<=n;++i)
{
if(!dr[i]) usu[i]=3;
else usu[i]=2;
}
for(int i=1;i<=n;++i) g<<usu[i]<<'\n';
return 0;
}