POJ 3565 KM算法

Ants
Time Limit: 5000MS Memory Limit: 65536K
Total Submissions: 1842 Accepted: 527 Special Judge

Description

Young naturalist Bill studies ants in school. His ants feed on plant-louses that live on apple trees. Each ant colony needs its own apple tree to feed itself.

Bill has a map with coordinates of n ant colonies and n apple trees. He knows that ants travel from their colony to their feeding places and back using chemically tagged routes. The routes cannot intersect each other or ants will get confused and get to the wrong colony or tree, thus spurring a war between colonies.

Bill would like to connect each ant colony to a single apple tree so that all n routes are non-intersecting straight lines. In this problem such connection is always possible. Your task is to write a program that finds such connection.

On this picture ant colonies are denoted by empty circles and apple trees are denoted by filled circles. One possible connection is denoted by lines.

Input

The first line of the input file contains a single integer number n (1 ≤ n ≤ 100) — the number of ant colonies and apple trees. It is followed by n lines describing n ant colonies, followed by n lines describing n apple trees. Each ant colony and apple tree is described by a pair of integer coordinates x and y (−10 000 ≤ x, y ≤ 10 000) on a Cartesian plane. All ant colonies and apple trees occupy distinct points on a plane. No three points are on the same line.

Output

Write to the output file n lines with one integer number on each line. The number written on i-th line denotes the number (from 1 to n) of the apple tree that is connected to the i-th ant colony.

Sample Input

5
-42 58
44 86
7 28
99 34
-13 -59
-47 -44
86 74
68 -75
-68 60
99 -60

Sample Output

4
2
1
5
3

Source

可以用匹配来写,因为在最小权匹配的时候所有线段一定不相交!!!
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#define inf 99999999.0

using namespace std;

struct Point
{
	double x;
	double y;
};

Point ant[105];
Point tree[105];
double map[105][105];
int link[105];
double lx[105];
double ly[105];
bool x[105];
bool y[105];
int n;

double dist(Point a,Point b)
{
	return -sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

void init()
{
	int i,j;
	for(i=0;i<105;i++)
	{
		lx[i]=inf;
		ly[i]=0;
		link[i]=-1;
	}
	for(i=0;i<105;i++)
		for(j=0;j<105;j++)
			map[i][j]=0;
}

bool judge(int v,int i)
{
	double esp;
	esp=0.0001;
	double r=lx[v]+ly[i];
	double z=map[v][i];
	if(abs(r-z)<=esp)
		return true;
	else
		return false;
}

bool find(int v)
{
	int i;
	x[v]=true;
	for(i=1;i<=n;i++)
	{
		if(!y[i]&&judge(v,i))
		{
			y[i]=true;
			if(link[i]==-1||find(link[i]))
			{
				link[i]=v;
				return true;
			}
		}
	}
	return false;
}

int main()
{
	int i,j,k;
	double d;
	init();
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		scanf("%lf%lf",&ant[i].x,&ant[i].y);
	for(i=1;i<=n;i++)
		scanf("%lf%lf",&tree[i].x,&tree[i].y);
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			map[i][j]=dist(ant[i],tree[j]);
	//		printf("%lf ",map[i][j]);
		}
	//	printf("/n");
	}
	for(k=1;k<=n;k++)
	{
		while(1)
		{
			memset(x,0,sizeof(x));
			memset(y,0,sizeof(y));
			if(find(k))
				break;
			d=inf;
			for(i=1;i<=n;i++)
				if(x[i])
					for(j=1;j<=n;j++)
						if(!y[j]&&(lx[i]+ly[j]-map[i][j]<d))
							d=lx[i]+ly[j]-map[i][j];
			for(i=1;i<=n;i++)
				if(x[i])
					lx[i]=lx[i]-d;
			for(i=1;i<=n;i++)
				if(y[i])
					ly[i]=ly[i]+d;
		}
	}
	double uva=0.0;
	for(i=1;i<=n;i++)
		for(j=1;j<=n;j++)
		{
			if(link[j]==i)
			{
				printf("%d/n",j);
				break;
			}
		}
	return 0;
}


阅读更多
个人分类: 图论
上一篇POJ 3298 递推,DP
下一篇POJ 2584 最大匹配。匈牙利算法
想对作者说点什么? 我来说一句

POJ 3565 Ants (KM

题意: 给n

lwt36 lwt36

2015-10-05 22:26:35

阅读数:226

没有更多推荐了,返回首页

关闭
关闭