PAT(A) -- 2018.9.8秋季考试-甲级(1148-1151)详细题解

PAT(A) – 2018.9.8秋季考试-甲级

写在开头的话： 甲级考试多是考查数据结构和一些基础的算法，此次也是我第一次参加PAT考试，赛前约刷了90道题(一个月)，得到了一个80分以上的成绩，自我感觉得到了一下几方面的提升：

• 更加熟悉树、图相关数据结构及算法，其中如何利用前中序其二建树，如何最简单的表示邻接表，如何使用dijkstra算法及能记录路径等。
• 甲级考试中，例如动态规划这种算法基本见不着，多是并查集、BFS、DFS、复杂模拟等，综合来看甲级考试简单于CCF。
• 还需注意一些经典案例：GCD、素数、分数计算、二叉搜索树、质因子分解等，均是《算法笔记》（胡凡、曾磊著，强烈建议考PAT和参加计算机研究生复试同学购买）中的讲解需要掌握的知识点。

题解如下：

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 liers. Can you point out the werewolves?

Now you are asked to solve a harder version of this problem: given that there were Nplayers, 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
+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个玩家玩狼人杀，每个人都会说一个人是好人或者是狼，正数表示好人、负数表示狼，其中必须要注意“Given that there were 2 werewolves among them, at least one but not all the werewolves were lying, and there were exactly 2 liers. ”，这句话的意思是：必有一人和一狼说假话。考试时理解为至少有一狼说谎，因此第一个样例(6分)过不了，所以考甲级之前英语的过关啊。

分析： 由于数据规模N<=100，果断就3重循环暴力求解了。第一二层循环枚举狼，第三层循环验证N个人说的话是否满足一人一