PAT 1148 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.

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.


题解：我的想法是依次设出说谎的狼人和平民，根据统计的狼人个数及不一致性进行判断是否是合理。但最后一个点一直没过，暂时没找到原因TAT。

#include<iostream>
#include<string>
#include<set>
using namespace std;
string s[109];
int n;
int ans1=1111,ans2=1111;
void changeop(int i){
	if(s[i][0]=='-') s[i][0]='+';
	else if(s[i][0]=='+')s[i][0]='-';
}
void test(int wlfliar,int humanliar){
	set<int> v;
	v.insert(wlfliar);
	for(int i=1;i<=n;i++){
		int k=stoi(s[i].substr(1,s[i].length()-1));//player i表述的人；
		if(s[i][0]=='-') v.insert(k);
		if(k==wlfliar&&s[i][0]!='-'){
			return; 
		} 
		else if (k==humanliar&&s[i][0]!='+'){
			return;
		} 
	}
		if(v.size()!=2){
			return;
		} 
		else{
			auto it=v.begin();
			int nowans1,nowans2;
			nowans1=*(it++);
			nowans2=*it;
			if((ans1>nowans1)||(ans1==nowans1&&ans2>nowans2)){
				ans1=nowans1;
				ans2=nowans2;
			}
		v.clear();
		return;
	}
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++) cin>>s[i];
	for(int i=1;i<=n;i++){  //假定第i个人是狼人 
	    changeop(i);
		for(int j=1;j<=n;j++){ //假定j是说谎的平民 
		    if(i==j) continue;
			changeop(j);
			test(i,j);
			changeop(j);
		}
		changeop(i);
	}
	if(ans1==1111||ans2==1111) cout<<"No Solution"<<endl;
	else{
		cout<<ans1<<" "<<ans2<<endl; 
	}
	
}

---

看了一下其他的思路：用一个数组存储i是否是好人，一个是存储说的对象，直接假设i，j是两个狼人，通过判断找出说谎的人，如果刚好是一个狼人一个好人，就OK。

其实看别人的代码思路很清晰，代码也很简洁，但自己当时就是想不到，我知道这种能力是需要时间和精力去培养的，加油！
学到了vector的一种新型写法:
vector a(n+1,1);//初始化n+1大小的元素全为1的动态数组。