【PAT甲级A1148】Werewolf - Simple Version (20分)（c++）

1148 Werewolf - Simple Version (20分)

作者：CHEN, Yue
单位：浙江大学
代码长度限制：16 KB
时间限制：400 ms
内存限制：64 MB

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

题意：

总共两个狼人，有且只有一只狼撒谎（题目说是至少一只狼说谎，但不是所有的狼说谎，说这么绕干啥），所有人共两人说谎，也就是说一只狼和一个好人说谎。让你找出两只狼。

思路：

用i和j表示两只狼，i从0到n-1，j从i+1到n，这样求出的两只狼是序列最小的。然后用一数组标记假设的狼人和好人，狼人取-1，好人取1，判断每个是否说谎，当每个人所认为的好人或狼人与标记的好人或狼人的乘积为负，则表示与假设相反，他说谎了（放入容器），最后判断说谎的人数为2且是一个好人一个狼人则输出i和j。

参考代码：

#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    int n;
    scanf("%d",&n);
    vector<int> v(n+1);
    for(int i=1;i<=n;i++)scanf("%d",&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;
            for(int k=1;k<=n;k++){
                if(v[k]*a[abs(v[k])]<0)lie.push_back(k);
            }
            if(lie.size()==2&&a[lie[0]]+a[lie[1]]==0){
                printf("%d %d",i,j);
                return 0;
            }
        }
    }
    printf("No Solution");
    return 0;
}

如有错误，欢迎指正