PAT 1148 Werewolf - Simple Version

原题连接：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

题目大意：

狼人杀游戏，已知 N 名玩家中有 2 人扮演狼人角色，有 2 人说的不是实话，有且只有一只狼在说谎。要求你找出2名狼人。
如果解不唯一，则输出最小序列解。
若无解则输出 No Solution。

方法一：枚举

思路：

由于只有2个狼人，那么可以遍历所有可能的狼人组合，此时便能判断出谁在撒谎。
最有根据有2人撒谎以及撒谎的人中一狼一名来判断本轮组合是否成立。
成立的话就输出（此时一定是所有解中的最小序列解），最终输出No Solution

C++代码：

// pat 1148 
#include <iostream>
#include <vector>
using namespace std;

int n;
vector<int> v(n+1);	// v存储每个人的判定 

int main(){
	cin >> n;
	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;	// lie存储说谎人的编号 
			vector<int> a(n + 1, 1);	// a存储真实身份 -1为狼 1为民 
			a[i] = a[j] = -1;	// 假设i和j是狼 
			
            for (int k = 1; k <= n; k++)
                if (v[k] * a[abs(v[k])] < 0) // k说的那个人v[k]和v[k]的真实身份a[abs(v[k])]不同 说明k说谎了 
					lie.push_back(k);
			
			// 当说谎的人数为2 且 说谎的2人一个是狼一个是平民时 此时找到了答案 
			if(lie.size() == 2 && a[lie[0]] + a[lie[1]] == 0) {
				cout << i << " " << j;
				return 0; 
			}
		}
	} 
	
	cout << "No Solution" << endl;
	
	return 0;
}

复杂度分析：

• 时间复杂度：O(n²)，2重循环
• 空间复杂度：O(n)