PAT甲级——A1148 WerewolfSimpleVersion【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). Then Nlines follow and the i-th line gives the statement of the i-th player (1), 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 [ and [, if there exists 0 such that [ (i≤k) and [, 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
 
Solution：

　　mmp，看了半天题目，以为要用一个复杂算法来推导，半天想不出来，后来才发现，20分的题，你千万不要看高了他，该暴力就暴力，该遍历就遍历，不要想用什么高大上的算法！！！

　　这道题就是使用暴力遍历，从1开始，每两个个人假设为狼人，然后去验证几个人说谎了，并且是不是一个好人和一个狼人说谎了，对，就这么简单，就他妈的用遍历！！！

　　

 #include <iostream>
 #include <vector>
 #include <algorithm>
 using namespace std;
 int main()
 {
     int n;
     cin >> n;
     vector<int>speak(n + ), name(n + , );
     for (int i = ; i <= n; ++i)cin >> speak[i];
     for (int i = ; i <= n; ++i)//假设i，j是狼人
     {
         for (int j = i + ; j <= n; ++j)
         {
             vector<int>lie, v(n + , );//都是好人
             v[i] = v[j] = -;//标记狼人
             for (int t = ; t <= n; ++t)
                 if (v[abs(speak[t])] * speak[t] < )//说是好人，但实际是狼人，他说谎了
                     lie.push_back(t);
             if (lie.size() ==  && v[lie[]] + v[lie[]] == )//一个好人撒谎，一个坏人撒谎
             {
                 cout << i << " " << j << endl;
                 return ;
             }
         }
     }
     cout << "No Solution" << endl;
     return ;
 }