Description：

Solution：

Code：

#include<algorithm>

#include<iostream>

#include<cstdlib>

#include<cstdio>

#include<cmath>

#include<queue>

#include<cctype>

#include<cstring>

using namespace std;

int n,m;

#define MAXN 10010

int x[MAXN],y[MAXN];

struct edge

{

	int to,nxt,f;

}e[(MAXN + MAXN * 2 + MAXN) * 2];

int edgenum = 0;

int lin[MAXN + MAXN];

void add(int a,int b,int f)

{

	e[edgenum] = (edge){b,lin[a],f};lin[a] = edgenum++;

	e[edgenum] = (edge){a,lin[b],f};lin[b] = edgenum++;

	return;

}

int s,t;

int ch[MAXN + MAXN];

bool BFS()

{

	queue<int> q;q.push(s);

	memset(ch,-1,sizeof(ch));ch[s] = 0;

	while(!q.empty())

	{

		int k = q.front();q.pop();

		for(int i = lin[k];i != -1;i = e[i].nxt)

		{

			if(ch[e[i].to] == -1 && e[i].f)

			{

				ch[e[i].to] = ch[k] + 1;

				q.push(e[i].to);

			}

		}

	}

	return ch[t] != -1;

}

int flow(int k,int f)

{

	if(k == t)return f;

	int r = 0;

	for(int i = lin[k];i != -1 && f > r;i = e[i].nxt)

	{

		if(ch[e[i].to] == ch[k] + 1 && e[i].f)

		{

			int l = flow(e[i].to,min(f - r,e[i].f));

			e[i].f -= l;r += l;e[i ^ 1].f += l;

		}

	}

	if(r == 0)ch[k] = -1;

	return r;

}

#define INF 0x3f3f3f3f

int dinic()

{

	int ans = 0,r;

	while(BFS())while(r = flow(s,INF))ans += r;

	return ans;

}

bool check(int v)

{

	memset(lin,-1,sizeof(lin));

	edgenum = 0;

	for(int i = 1;i <= m;++i)add(s,i,1);

	for(int i = 1;i <= n;++i)add(i + m,t,v);

	for(int i = 1;i <= m;++i)

	{

		add(i,x[i] + m,1);

		add(i,y[i] + m,1);

	}

	if(dinic() == m)return true;

	return false;

}

int main()

{

	scanf("%d%d",&n,&m);

	int a,b;

	for(int i = 1;i <= m;++i)scanf("%d%d",&x[i],&y[i]);

	s = n + m + 1;t = s + 1;

	int l = 0,r = m,mid;

	while(l < r)

	{

		mid = ((l + r) >> 1);

		if(check(mid))r = mid;

		else l = mid + 1;

	}

	cout << l << endl;

	check(l);

	for(int k = 1;k <= m;++k)

	{

		for(int i = lin[k];i != -1;i = e[i].nxt)

		{

			if(e[i].to == s)continue;

			if(e[i].f == 0)

			{

				if(e[i].to == x[k] + m)puts("1");

				else puts("0");

			}

		}

	}

	return 0;

}