题目1486:False coin

#include <iostream>
#include <queue>
#include <vector>
#include <cstring>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <stack>
#include <cmath>
using namespace std;
int visit[1001];
int light[1001];
int heavy[1001];
int main()
{
    int n,k;
    while(cin>>n>>k)
    {
        memset(visit,0,sizeof(visit));
        memset(light,0,sizeof(light));
        memset(heavy,0,sizeof(heavy));
        int ans=-1;
        int cas=0;
        for(int i=1;i<=k;i++)
        {
            int p;
            cin>>p;
            vector<int> V1;
            vector<int> V2;
            for(int j=1;j<=2*p;j++)
            {
                int x;
                cin>>x;
                if(j<=p)
                    V1.push_back(x);
                else
                    V2.push_back(x);
            }
            char ch;
            cin>>ch;
            if(ch=='=')
            {
                for(int v1=0;v1<V1.size();v1++)
                    visit[V1[v1]]=1;
                for(int v2=0;v2<V2.size();v2++)
                    visit[V2[v2]]=1;
            }
            else if(ch=='<')
            {
                cas++;
                for(int i=0;i<p;i++)
                {
                    light[V1[i]]++;
                    heavy[V2[i]]++;
                }
            }
            else if(ch=='>')
            {
                cas++;
                for(int i=0;i<p;i++)
                {
                    light[V2[i]]++;
                    heavy[V1[i]]++;
                }
            }
        }
        int pos;
        int cnt=0;
        for(int i=1;i<=n;i++)
        {
            if(visit[i]==1)
                continue;
            if(heavy[i]==cas||light[i]==cas)
            {
                pos=i;
                cnt++;
            }
        }
        if(cnt==1)
            cout<<pos<<endl;
        else
            cout<<0<<endl;
    }
    return 0;
}
/**************************************************************
    Problem: 1486
    User: cust123
    Language: C++
    Result: Accepted
    Time:60 ms
    Memory:1532 kb
****************************************************************/

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值