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

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 名玩家中有 2 人扮演狼人，一定有 2 人撒谎，且这 2 人中只有 1 个狼人。找出扮演狼人角色的是哪几号玩家，如果有解，在一行中按递增顺序输出 2 个狼人的编号；如果解不唯一，则输出最小序列解；若无解则输出 No Solution。

分析：暴力枚举所有可能说谎的人，检查当说谎的人为 i 和 j 且 i 为狼人 j 不为狼人，或者 i 不为狼人 j 为狼人时是否满足游戏条件。如果有符合的情况，则记录。最后全部枚举完了，如果没有记录过解，则输出 No Solution；否则输出最小的序列。

#include<algorithm>
#include <iostream>
#include  <cstdlib>
#include  <cstring>
#include   <string>
#include   <vector>
#include   <cstdio>
#include    <queue>
#include    <stack>
#include    <ctime>
#include    <cmath>
#include      <map>
#include      <set>
#define INF 0xffffffff
#define db1(x) cout<<#x<<"="<<(x)<<endl
#define db2(x,y) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<endl
#define db3(x,y,z) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<", "<<#z<<"="<<(z)<<endl
#define db4(x,y,z,r) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<", "<<#z<<"="<<(z)<<", "<<#r<<"="<<(r)<<endl
#define db5(x,y,z,r,w) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<", "<<#z<<"="<<(z)<<", "<<#r<<"="<<(r)<<", "<<#w<<"="<<(w)<<endl
using namespace std;

int main(void)
{
    #ifdef test
    freopen("in.txt","r",stdin);
    //freopen("in.txt","w",stdout);
    clock_t start=clock();
    #endif //test

    int n,finds=0;scanf("%d",&n);
    int num[n+5]={0},ans[2]={10000,10000};
    for(int i=1;i<=n;++i)scanf("%d",&num[i]);

    for(int i=1;i<=n;++i)
    {
        for(int j=i+1;j<=n;++j)
        {
            int temp[n+5]={0},flag[n+5]={0},cnt=0,findans=0;
            for(int k=1;k<=n;++k)temp[k]=num[k];temp[i]*=-1,temp[j]*=-1;
            for(int k=1;k<=n;++k)
            {
                int f=temp[k]>0?1:-1,index=fabs(temp[k]);
//                db4(i,j,f,temp[k]);
                if(flag[index]==0)flag[index]=f;
                else if(flag[index]==f)continue;
                else
                {
                    cnt=-1;break;
                }
                if(flag[index]<0)cnt++;
            }
//            db3(i,j,cnt);
//
//            for(int k=1;k<=n;++k)
//                printf("%d ",flag[k]);
//            printf("\n");

            if(cnt==-1||cnt>2)continue;

            int tans[n+5]={0},t=0;

            if(flag[i]!=1&&flag[j]!=-1)
            {
                if(flag[i]!=-1&&cnt==2)continue;

                tans[t++]=i;
                for(int k=1;k<=n;++k)
                {
                    if(k==i)continue;
                    else if(flag[k]<=0&&k!=j)tans[t++]=k;
                    if(t==2)break;
                }
                int a=tans[0],b=tans[1];
                tans[0]=min(a,b),tans[1]=max(a,b);
                if(t==2)finds=1,findans=1;
            }
            else if(flag[i]!=-1&&flag[j]!=1)
            {
                if(flag[j]!=-1&&cnt==2)continue;

                tans[t++]=j;
                for(int k=1;k<=n;++k)
                {
                    if(k==j)continue;
                    else if(flag[k]<=0&&k!=i)tans[t++]=k;
                    if(t==2)break;
                }
                int a=tans[0],b=tans[1];
                tans[0]=min(a,b),tans[1]=max(a,b);
                if(t==2)finds=1,findans=1;
            }

            if(findans)
            {
//                db5(findans,tans[0],tans[1],ans[0],ans[1]);
                if(tans[0]<ans[0])ans[0]=tans[0],ans[1]=tans[1];
                else if(tans[0]==ans[0]&&tans[1]<ans[1])ans[0]=tans[0],ans[1]=tans[1];
            }
        }
    }
    if(!finds)printf("No Solution\n");
    else printf("%d %d\n",ans[0],ans[1]);

    #ifdef test
    clockid_t end=clock();
    double endtime=(double)(end-start)/CLOCKS_PER_SEC;
    printf("\n\n\n\n\n");
    cout<<"Total time:"<<endtime<<"s"<<endl;        //s为单位
    cout<<"Total time:"<<endtime*1000<<"ms"<<endl;    //ms为单位
    #endif //test
    return 0;
}