PAT-A1148/B1089 Werewolf - Simple Version/狼人杀-简单版 题目内容及题解

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.

以下文字摘自《灵机一动·好玩的数学》：“狼人杀”游戏分为狼人、好人两大阵营。在一局“狼人杀”游戏中，1 号玩家说：“2 号是狼人”，2 号玩家说：“3 号是好人”，3 号玩家说：“4 号是狼人”，4 号玩家说：“5 号是好人”，5 号玩家说：“4 号是好人”。已知这 5 名玩家中有 2 人扮演狼人角色，有 2 人说的不是实话，有狼人撒谎但并不是所有狼人都在撒谎。扮演狼人角色的是哪两号玩家？

本题是这个问题的升级版：已知 N 名玩家中有 2 人扮演狼人角色，有 2 人说的不是实话，有狼人撒谎但并不是所有狼人都在撒谎。要求你找出扮演狼人角色的是哪几号玩家？

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.

输入在第一行中给出一个正整数 N（5≤N≤100）。随后 N 行，第 i 行给出第 i 号玩家说的话（1≤i≤N），即一个玩家编号，用正号表示好人，负号表示狼人。

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.

如果有解，在一行中按递增顺序输出 2 个狼人的编号，其间以空格分隔，行首尾不得有多余空格。如果解不唯一，则输出最小序列解 —— 即对于两个序列 A=a[1],...,a[M] 和 B=b[1],...,b[M]，若存在 0≤k<M 使得 a[i]=b[i] （i≤k），且 a[k+1]<b[k+1]，则称序列 A 小于序列 B。若无解则输出 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

解题思路

1. 读入发言记录并储存；
2. 双层嵌套循环并用标记数组的方式尝试狼人组合；
3. 循环中对每组发言数出有多少撒谎者，其中狼人撒谎者有几个；
4. 发现符合“两个说谎者，其中一名狼人说谎者”的边界条件时退出循环；
5. 输出结果并返回零值。

代码

#include<stdio.h>
#define maxn 110
int wolf[maxn],st[maxn];
int N;

int main(){
    int i,j,k;
    int w,lair;
    scanf("%d",&N);
    for(i=1;i<=N;i++){
        scanf("%d",&st[i]);
    }
    for(i=1;i<N;i++){
        wolf[i]=1;
        for(j=i+1;j<=N;j++){
            wolf[j]=1;
            w=0;
            lair=0;
            for(k=1;k<=N;k++){
                if(st[k]>0&&wolf[st[k]]==1){//lie
                    lair++;
                    if(k==i||k==j){
                        w++;
                    }
                }else if(st[k]<0&&wolf[-st[k]]==0){
                    lair++;
                    if(k==i||k==j){
                        w++;
                    }
                }
            }
            if(lair==2&&w==1){
                printf("%d %d\n",i,j);
                return 0;
            }
            wolf[j]=0;
        }
        wolf[i]=0;
    }
    printf("No Solution\n");
    return 0;
}

运行结果