最大密度子图

#include<bits/stdc++.h>
#define rep(i,a,b) for(register int i=(a);i<=(b);++i)
using namespace std;
const double inf=1e9;
const int N=2e3+10;
struct node{int y,n;double v;}e[N*10];
int lin[N*10],d[N],S,T,st1,st2,len=1,n,m,x,y;
double l,r,mid,ans;
void LK(int x,int y,double v)
{e[++len].y=y,e[len].v=v,e[len].n=lin[x],lin[x]=len;}
void add(int x,int y,double v)
{LK(x,y,v),LK(y,x,0.0);}
bool bfs(){
	queue<int> q;
	memset(d,0,sizeof(d));
	d[S]=1,q.push(S);
	while(q.size()){
		int x=q.front();q.pop();
		for(int i=lin[x];i;i=e[i].n){
			int y=e[i].y;
			if(e[i].v&&!d[y]){
				d[y]=d[x]+1,q.push(y);
			}
		}
	}return d[T]>0;
}
double dfs(int x,double minf){
	if(x==T)return minf;
	double flow=0,sum=0;
	for(int i=lin[x];i;i=e[i].n){
		int y=e[i].y;
		if(e[i].v&&d[y]==d[x]+1){
			flow=dfs(y,min(e[i].v,minf));
			if(flow==0)d[y]=0;
			sum+=flow,minf-=flow,e[i].v-=flow,e[i^1].v+=flow;
			if(minf==0)return sum;
		}
	}return sum;
}
bool judge(double mid){
	for(int i=2;i<=st1;i+=2)e[i].v=1.0,e[i^1].v=0;
	for(int i=st1+1;i<=st2;i+=2)e[i].v=inf,e[i^1].v=0;
	for(int i=st2+1;i<=len;i+=2)e[i].v=mid,e[i^1].v=0.0;
	double tot=m;
	while(bfs())tot-=dfs(S,inf);
	return tot>0;
}
int main()
{
	scanf("%d%d",&n,&m); S=0,T=n+m+1;
	rep(i,1,m)add(S,i,1.0);
	st1=len;
	rep(i,1,m){
		scanf("%d%d",&x,&y);
		add(i,x+m,inf),add(i,y+m,inf);
	}
	st2=len;
	rep(i,1,n)add(i+m,T,0);
	l=0.0,r=m/2;
	while(l+0.0001<=r){//注意精度问题
		mid=(l+r)/2;
		if(judge(mid))ans=mid,l=mid;
		else r=mid;
	}
	printf("%.3lf\n",ans);
	return 0;
}