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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
// Arti1990, II UWr

#include <bits/stdc++.h>

#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(auto iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(auto iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,K,FUN)             ({auto SSS=P, PPP = P-1, KKK=(K)+1; while(PPP+1!=KKK) {SSS = (PPP+(KKK-PPP)/2); if(FUN(SSS)) KKK = SSS; else PPP = SSS;} PPP;})
#define testy()                     int _tests; cin>>_tests; FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#define FOR(i, a, b)                for(int i=a; i<=b; i++)
#define FORD(i, a, b)               for(int i=a; i>=b; i--)
#define MP                          make_pair
#define PB                          push_back
#define ff                          first
#define ss                          second
#define deb(X)                      X;
#define SIZE(coll) 					((int)coll.size())

#define M 1000000007
#define INF 1000000007LL

using namespace std;

int n, m, k, a, b, numer;
int ile[1000007], pom[1000007], kiedy[1000007], skonczony[1000007];
vector <int> gdzie[1000007], col_to_join;

struct miasto
{
    int kol;
    int o;
    int rozm;
    vector <int> l;
    map <int, int> mapa; // <kolor, reprezentant>
};
miasto tab[1000007];

int Find(int nr)
{
    if(nr == tab[nr].o)
        return nr;
    tab[nr].o = Find(tab[nr].o);
    return tab[nr].o;
}

bool Union(int a, int b)
{
    a = Find(a);
    b = Find(b);
    
    if(a == b)
        return 0;

    if(tab[a].rozm < tab[b].rozm)
        swap(a, b);

    //cout << "laczy " << a << " i " << b << '\n';

    if(tab[a].kol == tab[b].kol)
    {
        ile[tab[a].kol]--;
        if(ile[tab[a].kol] == 1)
            col_to_join.PB(tab[a].kol);
    }

    tab[a].rozm += tab[b].rozm;
    tab[b].o = a;
    
    if(tab[a].mapa.size() < tab[b].mapa.size())
        swap(tab[a].mapa, tab[b].mapa);

    for(auto el : tab[b].mapa)
        if(!skonczony[el.ff])   
        {
            if(tab[a].mapa.count(el.ff) > 0)
            {
                Union(tab[a].mapa[el.ff], el.ss);
            }
            else
                tab[a].mapa[el.ff] = el.ss;
        }
    
    return 1;
}

int solve()
{
    cin >> n >> m >> k;
    FOR(i, 1, k)
    {
        ile[i] = 0;
        gdzie[i].clear();
        skonczony[i] = 0;
    }
    FOR(i, 1, n)
    {   
        cin >> tab[i].kol;
        gdzie[tab[i].kol].PB(i);
        ile[tab[i].kol]++;
        tab[i].o = i;
        tab[i].rozm = 1;
        tab[i].l.clear();
        tab[i].mapa.clear();
    }
    FOR(i, 1, k)
        if(ile[i] == 1)
            col_to_join.PB(i);

    forr(i, m)
    {
        cin >> a >> b;
        if(tab[a].kol == tab[b].kol)
            Union(a, b);
        else
        {
            tab[a].l.PB(b);
            tab[b].l.PB(a);
        }
    }

    while(col_to_join.size() > 0)
    {
        int kol1 = col_to_join.back();
        col_to_join.pop_back();
        //numer++;
        skonczony[kol1] = 1;

        //cout << "laczymy kolor " << kol << '\n';

        for(auto nr1 : gdzie[kol1])
            for(auto nr2 : tab[nr1].l)
            {
                int k2 = tab[nr2].kol;
                if(skonczony[k2])
                {
                    Union(nr1, nr2);
                }
                else
                {
                    if(tab[Find(nr1)].mapa.count(k2) > 0)
                        Union(tab[Find(nr1)].mapa[k2], nr2);
                    else
                        tab[Find(nr1)].mapa[k2] = nr2;
                }

                /*
                if(kiedy[k2] == numer)
                {
                    Union(pom[k2], nr2);
                }
                else
                {
                    kiedy[k2] = numer;
                    pom[k2] = nr2;
                }
                */
            }
    }
    
    FOR(i, 1, k)
        if(ile[i] > 1)
            return 0;

    return 1;
}

int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    testy()
        cout << (solve() ? "TAK" : "NIE") << '\n';

    return 0;
}