Pagini recente » Cod sursa (job #2054037) | Cod sursa (job #407659) | Cod sursa (job #2045920) | Cod sursa (job #406046) | Cod sursa (job #930946)
Cod sursa(job #930946)
//HighFlow
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <fstream>
#include <string.h>
#include <math.h>
#include <algorithm>
#define fcat(c) while (c!='\n') fscanf(f,"%c",&c)
#define cat(c) while (c!='\n') scanf("%c",&c)
#define For(i,st,dr,k) for (int i=(st);i<=(dr);i+=(k))
#define ll (long long)
#define kfl(i,j) (a[(i)][(j)].c-a[(i)][(j)].f)
using namespace std;
FILE *f,*g;
int st[8000],dr[8000];
bool bf[8000],supl[8000],supr[8000];
vector <int> a[8000];
bool ok[8000][2];
int n,m,i,j,x,y,ans;
int cuplaj(int x)
{
if (bf[x]) return 0;
bf[x]=true;
int i;
for (i=0;i<a[x].size();i++)
if (!dr[a[x][i]])
{
dr[a[x][i]]=x;
st[x]=a[x][i];
return 1;
}
for (i=0;i<a[x].size();i++)
if (cuplaj(dr[a[x][i]]))
{
dr[a[x][i]]=x;
st[x]=a[x][i];
return 1;
}
return 0;
}
void suport(int x)
{
int i;
for (i=0;i<a[x].size();i++)
if (!supr[a[x][i]])
{
supr[a[x][i]]=true;
supl[dr[a[x][i]]]=false;
suport(dr[a[x][i]]);
}
}
int main()
{
f=fopen("felinare.in","r");
g=fopen("felinare.out","w");
fscanf(f,"%d%d",&n,&m);
for (i=1;i<=m;i++)
{
fscanf(f,"%d%d",&x,&y);
a[x].push_back(y);
}
bool cos=true;
while (cos)
{
cos=false;
for (i=1;i<=n;i++) bf[i]=false;
for (i=1;i<=n;i++)
if (!st[i])
cos|=cuplaj(i);
}
for (i=1;i<=n;i++)
if (st[i])
{
ans++;
supl[i]=true;
}
for (i=1;i<=n;i++)
if (!st[i])
suport(i);
fprintf(g,"%d\n",2*n-ans);
for (i=1;i<=n;i++)
fprintf(g,"%d\n",(supl[i]==false)+(supr[i]==false)*2);
return 0;
}