HDU3622 二分+2-SAT

Problem Address：http://acm.hdu.edu.cn/showproblem.php?pid=3622

这道题当初做的时候想到的是二分加上某个东西。

后来知道是2-SAT，可惜没学过。

今天把2-SAT弄清楚了一点，做了道基础题。http://acm.hdu.edu.cn/showproblem.php?pid=3062

2-SAT主要还是难在建图上面。

所以模板的东西还是比较好写的。

【HDU3622代码】

#include <iostream>
#include <cmath>
using namespace std;

const int maxn = 200;
const int maxm = maxn*maxn;
const int size = maxn*2+5;

inline int min(int a, int b)
{
	if (a<=b) return a;
	else return b;
}

struct node
{
	int to, next;
}edge[maxm*2];
int edgenum;
int head[size];

struct bnode
{
	int x;
	int y;
}b[maxn+5];

int r[maxn+5];
int rct;

double dis(bnode x, bnode y)
{
	return sqrt((double)((x.x-y.x)*(x.x-y.x)+(x.y-y.y)*(x.y-y.y)));
}

void insertEdge(int from, int to)
{
	edge[edgenum].to = to;
	edge[edgenum].next = head[from];
	head[from] = edgenum;
	edgenum++;
}

void edgeInit(int n)
{
	int i;
	for (i=1; i<=n; i++) head[i] = 0;
	edgenum = 1;
}

int tct, sccnum, dfn[size], low[size], stack[size], scc[size], sTop;
bool visited[size];

void tarjan(int u)//求强连通分量
{
	int i;
	int v;
	dfn[u] = low[u] = ++tct;
	visited[u] = true;
	stack[sTop++] = u;
	for (i=head[u]; i!=0; i=edge[i].next)
	{
		v = edge[i].to;
		if (dfn[v]==0)
		{
			tarjan(v);
			low[u] = min(low[u], low[v]);
		}
		else if (visited[v])
		{
			low[u] = min(low[u], dfn[v]);
		}
	}
	if (dfn[u]==low[u])
	{
		do
		{
			v = stack[--sTop];
			visited[v] = false;
			scc[v] = sccnum;
		}while(u!=v);
		sccnum++;
	}
}

bool solve(double mid, int n)
{
	int i, j;
	tct = sTop = sccnum = 0;
	memset(dfn, 0, sizeof(dfn));
	memset(visited, false, sizeof(visited));
	edgeInit(2*n);
	for (i=1; i<=2*n; i++)
	{
		for (j=i+1; j<=2*n; j++)
		{
			if (dis(b[i], b[j])<2*mid)
			{
				int x = (i&1)?i+1:i-1;
				int y = (j&1)?j+1:j-1;
				insertEdge(i, y);
				insertEdge(j, x);
			}
		}
	}
	for (i=1; i<=2*n; i++)
	{
		if (!dfn[i]) tarjan(i);
	}
	for (i=1; i<=n; i++)
	{
		if (scc[2*i-1]==scc[2*i])
			return false;
	}
	return true;
}

int main()
{
	int n;
	int i;
	while(scanf("%d", &n)!=EOF)
	{
		for (i=1; i<=n; i++)//每个结点拆分为2*i-1和2*i
			scanf("%d %d %d %d", &b[2*i-1].x, &b[2*i-1].y, &b[2*i].x, &b[2*i].y);
		double left, right, mid, ans = 0;
		left = 0;
		right = 20000;
		while(fabs(left-right)>1e-3)//二分部分
		{
			mid = (left+right)/2;
			if (solve(mid, n))
			{
				ans = mid;
				left = mid;
			}
			else
			{
				right = mid;
			}
		}
		printf("%.2lf\n", ans);
	}
	return 0;
}