1148 werewolf - Simple Version (20 points)

maxmin

1148 Werewolf - Simple Version (20 branch )

The question

Yes n A creature , There are two wolves , The others are people , Every creature says a word . Expressed as an integer . Negative numbers indicate wolves , A positive number means a person .-1 He thinks the first one is a wolf .+1 He thinks the first one is a man .
There is a wolf and a man lying among all creatures , Please find two wolves . Multiple results output the smallest number . No result output No Solution

Ideas

Make i j For the wolf , from 1,2 To n-1, n List two wolves .i,j For the wolf , The others are people .
Then judge the liar from the words of all creatures , If there are exactly two liars and one is a wolf , This situation meets the conditions .

Code

#include<stdio.h>
#include<vector>
using namespace std;
int main()
{
    
	vector<int>p;
	int x[10007],n,vis[10007];
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
    
		scanf("%d",&x[i]);
	}
	for(int i=1;i<n;i++){
    
		for(int j=i+1;j<=n;j++){
    
			fill(vis,vis+n+1,1);
			vis[i]=vis[j]=-1;
			p.clear();
			for(int k=1;k<=n;k++){
    
				if(x[k]<0&&vis[-x[k]]>0||x[k]>0&&vis[x[k]]<0){
    
					p.push_back(k);
				}
			}
			if(p.size()==2&&vis[p[0]]+vis[p[1]]==0){
    
				printf("%d %d\n",i,j);
				return 0;
			}
		}
	}
	printf("No Solution\n");
	return 0;
}