POJ3155【最大密度子图】

似乎被卡精度了.不明觉厉.

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <map>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 20010;
const int inf = 0x3f3f3f3f;
const int P = 1000000007;
const double eps = 1e-9;

inline ll read()
{
	ll x = 0, f = 1; char c = getchar();
	while (c < '0' || c > '9')
		f = (c == '-' ? -1 : 1), c = getchar();
	while (c >= '0' && c <= '9')
		x = x * 10 + c - '0', c = getchar();
	return x * f;
}

struct edge
{
	int v; double a; int next;
} e[maxn * 2];

int n, m, s, t, cnt, head[maxn], cur[maxn], dis[maxn], q[maxn],
    u[maxn], v[maxn];

void insert(int u, int v, double a)
{
	e[cnt] = (edge) {v, a, head[u]}, head[u] = cnt++;
	e[cnt] = (edge) {u, 0, head[v]}, head[v] = cnt++;
}

int bfs()
{
	memset(dis, -1, sizeof dis);

	int l = 0, r = 1;
	q[0] = s, dis[s] = 0;

	while (l != r) {
		int u = q[l++];

		for (int i = head[u]; i != -1; i = e[i].next) {
			int v = e[i].v;
			if (e[i].a > eps && dis[v] == -1)
				dis[v] = dis[u] + 1, q[r++] = v;
		}
	}
	
	return dis[t] != -1;
}

double dfs(int u, double a)
{
	if (u == t)
		return a;

	double f, flow = 0;

	for (int i = cur[u]; a && i != -1; i = e[i].next) {
		int v = e[i].v;
		if (dis[v] == dis[u] + 1 && e[i].a > eps) {
			f = dfs(v, min(a, e[i].a));
			e[i].a -= f, a -= f;
			e[i ^ 1].a += f, flow += f;
			if (e[i].a)
				cur[u] = i;
		}
	}

	if (!flow)
		dis[u] = -1;
	return flow;
}

double maxflow()
{
	double ans = 0;
	while (bfs()) {
		memcpy(cur, head, sizeof head);
		ans += dfs(s, inf);
	}
	return ans;
}

double query(double rho)
{
	cnt = 0;
	memset(head, -1, sizeof head);

	for (int i = 1; i <= m; i++) {
		insert(n + i, u[i], inf);
		insert(n + i, v[i], inf);
	}
	for (int i = 1; i <= n; i++)
		insert(i, t, rho);
	for (int i = 1; i <= m; i++)
		insert(s, n + i, 1);

	return m - maxflow();
}

int main()
{
	while (scanf("%d%d", &n, &m) != EOF) {
		if (m == 0) {
			printf("%d\n%d\n", 1, 1);
			continue;
		}      	

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

		for (int i = 1; i <= m; i++)
			u[i] = read(), v[i] = read();

		double l = 0, r = inf;

		while (r - l >= 1e-6) {
			double mid = (l + r) / 2;

			if (query(mid) > eps)
				l = mid;
			else
				r = mid;
		}
	
		query((l + r) / 2 - 1e-6), bfs();

		int ans = 0;
		for (int i = 1; i <= n; i++)
			ans += (dis[i] != -1);

		printf("%d\n", ans);
		for (int i = 1; i <= n; i++)
			if (dis[i] != -1)
				printf("%d\n", i);
	}	

	return 0;
}