PAT A1148 2019.08.16 【枚举】

1148 Werewolf - Simple Version (20 分)

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

思路分析

传说中的狼人杀。

因为数据量很小，骗子和狼有且只有两个，所以可以直接暴力枚举。

两种思路：

枚举两匹狼，之后找出说谎的人数与说谎的狼数：日沉云起-博客

枚举两骗子，之后找到两骗子并判断其一狼一人：（柳神代码如下）

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

int main()
{
	int n;cin>>n;
	vector<int> v(n+1);
	for(int i=1;i<=n;i++)cin>>v[i];
	
	for(int i=1;i<=n;i++)
	{
		for(int j=i+1;j<=n;j++)
		{
			vector<int> lie,a(n+1,1);
			a[i]=a[j]=-1;//a数组表明是好人还是坏人 正数好人 负数坏人 
			
			for(int k=1;k<=n;k++)//k说的话与真实情况不同 则k在说谎 
			  if(v[k]*a[abs(v[k])]<0)lie.push_back(k);
			
			//说谎人数==2 并且一个好人一个坏人 
			if(lie.size()==2&&a[lie[0]]+a[lie[1]]==0)
			{
				cout<<i<<" "<<j;
				return 0;
			} 
			
		}
	}
	
	cout<<"No Solution";
	
}