2020 BIT冬训-模拟与暴力 C - False coin POJ - 1029

Problem Description

The "Gold Bar"bank received information from reliable sources that in their last group of N coins exactly one coin is false and differs in weight from other coins (while all other coins are equal in weight). After the economic crisis they have only a simple balance available (like one in the picture). Using this balance, one is able to determine if the weight of objects in the left pan is less than, greater than, or equal to the weight of objects in the right pan.
In order to detect the false coin the bank employees numbered all coins by the integers from 1 to N, thus assigning each coin a unique integer identifier. After that they began to weight various groups of coins by placing equal numbers of coins in the left pan and in the right pan. The identifiers of coins and the results of the weightings were carefully recorded.
You are to write a program that will help the bank employees to determine the identifier of the false coin using the results of these weightings.

Input

The first line of the input file contains two integers N and K, separated by spaces, where N is the number of coins (2<=N<=1000 ) and K is the number of weightings fulfilled (1<=K<=100). The following 2K lines describe all weightings. Two consecutive lines describe each weighting. The first of them starts with a number Pi (1<=Pi<=N/2), representing the number of coins placed in the left and in the right pans, followed by Pi identifiers of coins placed in the left pan and Pi identifiers of coins placed in the right pan. All numbers are separated by spaces. The second line contains one of the following characters: '<', '>', or '='. It represents the result of the weighting:
'<' means that the weight of coins in the left pan is less than the weight of coins in the right pan,
'>' means that the weight of coins in the left pan is greater than the weight of coins in the right pan,
'=' means that the weight of coins in the left pan is equal to the weight of coins in the right pan.

Output

Write to the output file the identifier of the false coin or 0, if it cannot be found by the results of the given weightings.

Sample Input

5 3
2 1 2 3 4
<
1 1 4
=
1 2 5
=

Sample Output

3

如果一组数据两侧相等，那么他们必然是真的。

错误硬币出现过的次数必定和不等号出现的次数相同

由于只有一个硬币是假的。那么他的轻重就是确定的。即永远只会出现在重的那一侧或轻的那一侧。

 

如果最终结果有多个硬币是假的，说明没有判断成功，输出0。

#include<stdio.h>
int n,k,pi;
int jud[1005],temp[1005],ans,flag,cnt;//flag用来判断是否只有一个可疑的硬币 .cnt判断不等号次数 
char op;
int main(){
    scanf("%d%d",&n,&k);
    while(k--){
        scanf("%d",&pi);
        for(int i=0;i<2*pi;i++)    
            scanf("%d",&temp[i]);
        getchar();
        op=getchar();
        if(op=='=')
            for(int i=0;i<2*pi;i++)    
                jud[temp[i]-1]=105;
        else if(op=='<'){
            cnt++;
            for(int i=0;i<pi;i++)    
                if(jud[temp[i]-1]==-cnt+1)
                    jud[temp[i]-1]=-cnt;
                else
                    jud[temp[i]-1]=105;
            for(int i=pi;i<2*pi;i++)
                if(jud[temp[i]-1]==cnt-1)
                    jud[temp[i]-1]=cnt;
                else
                    jud[temp[i]-1]=105;
        }else{
            cnt++;
            for(int i=0;i<pi;i++)    
                if(jud[temp[i]-1]==cnt-1)
                    jud[temp[i]-1]=cnt;
                else
                    jud[temp[i]-1]=105;
            for(int i=pi;i<2*pi;i++)
                if(jud[temp[i]-1]==-cnt+1)
                    jud[temp[i]-1]=-cnt;
                else
                    jud[temp[i]-1]=105;
        }
    }
    for(int i=0;i<n;i++){
        if(jud[i]==cnt||jud[i]==-cnt){
            ans=i+1;
            if(flag==0)
                flag=1;
            else{
                flag=0;
                break;
            }
        }
    }
    if(flag)
        printf("%d",ans);    
    else
        printf("0");
    return 0;
}