ProblemSolving/UVa-665.cpp at master · hawashra/ProblemSolving · 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
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main() {

    int M;

    cin >> M;

    string trash;
    while (M--) {

        getline(cin, trash);

        int N, K;

        cin >> N >> K;

        int p;


        bool true_coins[N];

        for (int i = 0; i < N; i++)
            true_coins[i] = false;

        char c;

        for (int i = 0; i < K; i++) {

            cin >> p;

            int left[p];
            int right[p];

            for (int j = 0; j < p; j++)
                cin >> left[j];

            for (int j = 0; j < p; j++)
                cin >> right[j];

            sort(left, left + p);
            sort(right, right + p);

            cin >> c;

            if (c == '=')
                for (int j = 0; j < p; j++) {
                    true_coins[left[j] - 1] = true;
                    true_coins[right[j] - 1] = true;
                }

            else { // c == '<' or c == '>'

                for (int j = 0; j < N; j++) {
                    if ((binary_search(left, left + p, j + 1) < 0) and (binary_search(right, right + p, j + 1) < 0))
                        true_coins[j] = true;
                }
            }
        }

        int count = 0;
        int coin;

        for (int i = 0; i < N; i++) {
            if (true_coins[i] == false) {
                count++;
                coin = i + 1;
            }
        }

        if (count == 1)
            cout << coin << endl;
        else
            cout << 0 << endl;


        if (M != 0)
            cout << endl;

    }
    return 0;
}