Uva/Uva665.cpp at master · Dobromi/Uva · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include <iostream>
#include <math.h>
#include <cstdio>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <algorithm>
#include <map>
#include <sstream>
using namespace std;

int main()
{
    int M;
    scanf("%d",&M);
    while(M--){
        int N,K;
        cout<<endl;
        scanf("%d %d",&N,&K);
        bool *arr=new bool[N];
        for(int i=0;i<N;i++)arr[i]=false;
        int numberOfCoins;
        vector<int> Coins;
        int coin;
        char result;
        bool twoCoint=false;
        for(int i=0;i<K;i++){
            scanf("%d",&numberOfCoins);

            for(int j=0;j<numberOfCoins*2;j++){
                scanf("%d",&coin);
                Coins.push_back(coin);
            }
            cin>>result;
            if(numberOfCoins==1){
                twoCoint=true;
                break;
            }

            if(result=='='){
                for(int k=0;k<Coins.size();k++){
                    arr[Coins[k]-1]=true;
                }
            }
            else if(result=='<'){
                for(int k=0;k<Coins.size()/2;k++){
                    arr[Coins[k]-1]=true;
                }
            }
            else if(result=='>'){
                for(int k=Coins.size()/2;k<Coins.size();k++){
                    arr[Coins[k]-1]=true;
                }
            }
            Coins.clear();

        }

        if(twoCoint){
            cout<<0<<endl;
        }
        else{
            int c=0;
            int index;
            for(int i=0;i<N;i++){
                if(arr[i]==false){
                    c++;
                    index=i;
                }
            }
            if(c==1){
                cout<<index+1<<endl;
            }
            else{
                cout<<0<<endl;
            }
        }

        delete [] arr;

    }
    return 0;
}