本文主要是介绍PAT 1148 Werewolf - Simple Version (20)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
1148 Werewolf - Simple Version (20) （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 liers. 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 liers. 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
+4Sample Output 1:
1 4Sample Input 2:
6
+6
+3
+1
-5
-2
+4Sample Output 2 (the solution is not unique):
1 5Sample Input 3:
5
-2
-3
-4
-5
-1Sample Output 3:
No Solution思路：
说谎的两个人一个是狼，一个是村民，所以我们可以枚举两只狼的位置，剩下的位置全是村民，如果狼说某个人是狼但他却是村民或者说某个人是村民但他却是狼，那么说谎的狼的数量就要+1，如果村民说某个人是狼但他却是村民或者说某个人是村民但他却是狼，那么说谎的村民的数量就要+1，最后如果说谎的狼和说谎的村民数量都为1，那么就直接输出并且结束程序，否则就输出No Solution。
代码：
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
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++){int wolf = 0, man = 0;for (int k = 1; k <= n; k++){if (k == i || k == j){//狼撒谎 if (v[k] > 0 && (v[k] == i || v[k] == j))wolf++;else if (v[k] < 0 && abs(v[k]) != i && abs(v[k]) != j)wolf++;}else{//村民撒谎 if (v[k] > 0 && (v[k] == i || v[k] == j))man++;else if (v[k] < 0 && abs(v[k]) != i && abs(v[k]) != j)man++;}}if (wolf == 1 && man == 1){cout << i << " " << j << endl;return 0;}}}cout << "No Solution" << endl;return 0;
}
这篇关于PAT 1148 Werewolf - Simple Version (20)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
