LA3713--Astronauts(2-sat)

最新推荐文章于 2018-06-30 16:36:45 发布

SCUT_Pein

最新推荐文章于 2018-06-30 16:36:45 发布

阅读量770

点赞数

分类专栏：图论_2-sat 文章标签： LA3713

本文链接：https://blog.csdn.net/scut_pein/article/details/21823859

版权

图论_2-sat 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

The Bandulu Space Agency (BSA) has plans for the following three space missions:

Mission A: Landing on Ganymede, the largest moon of Jupiter.
Mission B: Landing on Callisto, the second largest moon of Jupiter.
Mission C: Landing on Titan, the largest moon of Saturn.

Your task is to assign a crew for each mission. BSA has trained a number of excellent astronauts; everyone of them can be assigned to any mission. However, if two astronauts hate each other, then it is not wise to put them on the same mission. Furthermore, Mission A is clearly more prestigious than Mission B; who would like to go to the second largest moon if there is also a mission to the largest one? Therefore, the assignments have to be done in such a way that only young, inexperienced astronauts go to Mission B, and only senior astronauts are assigned to Mission A. An astronaut is considered young if their age is less than the average age of the astronauts and an astronaut is senior if their age is at least the averageage. Every astronaut can be assigned to Mission C, regardless of their age (but you must not assign two astronauts to the same mission if they hate each other).

Input

The input contains several blocks of test cases. Each case begins with a line containing two integers 1 $\le$ n $\le$ 100000 and 1 $\le$ m $\le$ 100000 . The number n is the number of astronauts. The next n lines specify the age of the n astronauts; each line contains a single integer number between 0 and 200. The next m lines contains two integers each, separated by a space. A line containing i and j (1 $\le$ i, j $\le$ n) means that the i -th astronaut and the j -th astronaut hate each other.

The input is terminated by a block with n = m = 0 .

Output

For each test case, you have to output n lines, each containing a single letter. This letter is either `A', `B', or `C'. The i -th line describes which mission the i -th astronaut is assigned to. Astronauts that hate each other should not be assigned to the same mission, only young astronauts should be assigned to Mission B and only senior astronauts should be assigned to Mission A. If there is no such assignment, then output the single line `No solution.' (without quotes).

Sample Input

Sample Output

B
C
C
B
C
B
C
B
A
C
C
A
C
A
C
A

题意：有A,B,C三个人物要分配个N个宇航员，每个宇航员恰好要分配一个任务，设平均年龄为X，只有年龄大于或等于X的宇航员才能分配任务A。只有年龄严格小于X的宇航员才能分配任务B。而任务C没有限制。有M对宇航员相互讨厌，因此不能分配到同一任务。编程找出一个满足上述所有要求的任务分配方案。

思路：显然宇航员分为两类。第一类可以做任务A，C。第二类可以做任务B,C。

     对于同类的宇航员，只能一个做A一个做C。

     对于异类的宇航员，只要不都做C即可。

     vis[2*u] = 1表示做A或B任务（具体看他对应类型）

     vis[2*u+1] = 1表示做C任务。

     2-sat对应该连的边：

     if(Type[u] == Type[v])

          AddEdge(2*u,2*v+1);

          AddEdge(2*u+1,2*v);

          AddEdge(2*v,2*u+1);

          AddEdge(2*v+1,2*u);

     else

          AddEdge(2*u+1,2*v);

          AddEdge(2*v+1,2*u);

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
#define maxn 200080
#define maxm 1000080
int first[maxn];
int vv[maxm],nxt[maxm],S[maxm];
int e,c,n,m;
bool vis[maxn];
bool Type[maxn];
int key[maxn];
void AddEdge(int u,int v)
{
	vv[e] = v;	nxt[e] = first[u];	first[u] = e++;
}

bool dfs(int u)//现在要将u置1
{
	if(vis[u^1])	return 0;
	if(vis[u])	return 1;
	vis[u] = 1;
	S[c++] = u;
	for(int i = first[u];i != -1;i = nxt[i])
	{
		int v = vv[i];
		if(!dfs(v))	return false;
	}
	return true;
}

bool Judge()
{
	for(int i = 0;i < n*2;i+=2)
	{
		if(!vis[i] && !vis[i+1])
		{
			c = 0;
			if(!dfs(i))
			{
				while(c > 0)	vis[S[--c]] = 0;
				if(!dfs(i+1))	return false;
			}
		}
	}
	return true;
}

int main()
{
	//freopen("in.txt","r",stdin);
	while(scanf("%d%d",&n,&m)==2 && (n|m))
	{
		memset(first,-1,sizeof(first));
		memset(vis,0,sizeof(vis));
		e = 0;
		double average = 0;
		for(int i = 0;i < n;i++)
		{
			scanf("%d",&key[i]);
			average += key[i];
		}
		average /= n;
		for(int i = 0;i < n;i++)	if(key[i] >= average)	Type[i] = 0;
		else Type[i] = 1;
		for(int i = 0;i < m;i++)
		{
			int u,v;
			scanf("%d%d",&u,&v);
			u--;v--;
			if(Type[u] == Type[v])
			{
				AddEdge(2*u,2*v+1);
				AddEdge(2*u+1,2*v);
				AddEdge(2*v,2*u+1);
				AddEdge(2*v+1,2*u);
			}
			else 
			{
				AddEdge(2*u+1,2*v);
				AddEdge(2*v+1,2*u);
			}
		}
		if(!Judge())	puts("No solution.");
		else 
		{
			for(int i = 0;i < 2*n;i+=2)
			{
				if(!vis[i])	puts("C");
				else if(!Type[i/2])	puts("A");
				else puts("B");
			}
		}
	}
	return 0;
}