CodeForces-Solutions/2000C.cpp at main · garvit018/CodeForces-Solutions · 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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
<<<<<<< HEAD
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ll tt;
    cin >> tt;
    while (tt--)
    {
        int n, m;
        cin >> n;
        int arr[n];
        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
        }
        cin >> m;
        while (m--)
        {
            string s;
            cin >> s;
            map<int, char> m1;
            map<char, int> m2;
            if (s.size() != n)
            {
                cout << "NO" << endl;
                continue;
            }
            int flag = 1;
            for (int i = 0; i < s.size(); i++)
            {
                int num = arr[i];
                char ch = s[i];
                if (m1.count(num) == 0 && m2.count(ch) == 0)
                {
                    m1[num] = ch;
                    m2[ch] = num;
                }

                if (m1[num] != ch || m2[ch] != num)
                {
                    flag = 0;
                    break;
                }
            }
            if (flag == 0)
            {
                cout << "NO" << endl;
            }
            else
            {
                cout << "YES" << endl;
            }
        }
    }
=======
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
    ll tt;
    cin >> tt;
    while (tt--)
    {
        int n, m;
        cin >> n;
        int arr[n];
        for (int i = 0; i < n; i++)
        {
            cin >> arr[i];
        }
        cin >> m;
        while (m--)
        {
            string s;
            cin >> s;
            map<int, char> m1;
            map<char, int> m2;
            if (s.size() != n)
            {
                cout << "NO" << endl;
                continue;
            }
            int flag = 1;
            for (int i = 0; i < s.size(); i++)
            {
                int num = arr[i];
                char ch = s[i];
                if (m1.count(num) == 0 && m2.count(ch) == 0)
                {
                    m1[num] = ch;
                    m2[ch] = num;
                }

                if (m1[num] != ch || m2[ch] != num)
                {
                    flag = 0;
                    break;
                }
            }
            if (flag == 0)
            {
                cout << "NO" << endl;
            }
            else
            {
                cout << "YES" << endl;
            }
        }
    }
>>>>>>> 4bb7f1e9c9149de1c5c4e3b2a9a463945e04b545
}