PAT 甲级 1148  Werewolf - Simple Version

1148 Werewolf - Simple Version （20 point(s)）

Werewolf（狼人杀） is a game in which the players are partitioned into two parties: the werewolves and the human beings. Suppose that in a game,

• player #1 said: "Player #2 is a werewolf.";
• player #2 said: "Player #3 is a human.";
• player #3 said: "Player #4 is a werewolf.";
• player #4 said: "Player #5 is a human."; and
• player #5 said: "Player #4 is a human.".

Given that there were 2 werewolves among them, at least one but not all the werewolves were lying, and there were exactly 2 liars. Can you point out the werewolves?

Now you are asked to solve a harder version of this problem: given that there were N players, with 2 werewolves among them, at least one but not all the werewolves were lying, and there were exactly 2 liars. You are supposed to point out the werewolves.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (5≤N≤100). Then N lines follow and the i-th line gives the statement of the i-th player (1≤i≤N), which is represented by the index of the player with a positive sign for a human and a negative sign for a werewolf.

Output Specification:

If a solution exists, print in a line in ascending order the indices of the two werewolves. The numbers must be separated by exactly one space with no extra spaces at the beginning or the end of the line. If there are more than one solution, you must output the smallest solution sequence -- that is, for two sequences A=a[1],...,a[M] and B=b[1],...,b[M], if there exists 0≤k<M such that a[i]=b[i] (i≤k) and a[k+1]<b[k+1], then A is said to be smaller than B. In case there is no solution, simply print No Solution.

Sample Input 1:

5
-2
+3
-4
+5
+4

Sample Output 1:

1 4

Sample Input 2:

6
+6
+3
+1
-5
-2
+4

Sample Output 2 (the solution is not unique):

1 5

Sample Input 3:

5
-2
-3
-4
-5
-1

Sample Output 3:

No Solution

经验总结：

emmmm    做的第三遍了，不得不说，刚开始看还是要萌比一会。。。。这题的逻辑性很强，必须能拐过来，才能想通。。。
首先穷举所有狼人的所有可能性，用一个flag数组存储所有人的身份，狼人用-1，村民用1，然后再遍历所有人说过的话，如果这个人说的话是假话，根据这个人的身份累计撒谎的人数，如果撒谎的狼人和撒谎的村民都是一个，说明这是解决方案，直接输出，退出循环（由于穷举得从前往后性，保证了第一个发现的就是最小的），如果穷举完仍然没找到，就输出无解，啊。。。。感觉考场上遇到这样的题目，还是要冷静，不然，脑子一乱，根本想不出来 〒▽〒

AC代码

#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=110;
int n,m,a[maxn];
int flag[maxn];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i)
		scanf("%d",&a[i]);
	bool f=false;
	for(int i=1;i<=n;++i)
	{
		for(int j=i+1;j<=n;++j)
		{
			int lieworf=0,liehum=0;
			fill(flag,flag+maxn,1);
			flag[i]=flag[j]=-1;
			for(int k=1;k<=n;++k)
			{
				if(flag[abs(a[k])]*a[k]<0)
				{
					if(flag[k]==1)
						++liehum;
					else
						++lieworf;
				}
			}
			if(liehum==1&&lieworf==1)
			{
				f=true;
				printf("%d %d\n",i,j);
				break;
			}
		}
		if(f==true)
			break;
	}
	if(f==false)
		printf("No Solution\n");
	return 0;
}