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
#include <bits/stdc++.h>
#define ft first
#define sc second
#define pb push_back
#define FOR(i,n) for(int i=0; i<n; i++)
#define FORX(i,a,b) for(int i=(a); i<=(b); i++)
#define watch(x) cerr << (#x) << " == " << (x) << endl
typedef long long ll;
typedef long double ld;
using namespace std;

const ll mod = 1e9+7;
unordered_set<vector<bool>> all, curr;
vector<pair<int,int>> sw;
vector<bool> zar;

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

int n,m;
cin>>n>>m;

zar.resize(n);

FOR(i,n){
    bool x;
    cin>>x;
    zar[i] = x;
}

FOR(i,m){
    int a,b;
    cin>>a>>b;
    sw.pb({--a,--b});
}

curr.insert(zar);
while (1) {
    unordered_set<vector<bool>> nxt;
    for (auto &z : curr) {
        for (auto &s : sw) {
            if (z[s.ft] == z[s.sc]) {
                vector<bool> z2 = z;
                z2[s.ft] = !z2[s.ft];
                z2[s.sc] = !z2[s.sc];
                if (!curr.contains(z2) && !all.contains(z2)) {
                    nxt.insert(z2);
                }
            }
        }
    }
    all.insert(curr.begin(), curr.end());
    if (nxt.empty()) {break;}
    curr = nxt;
}

cout << all.size() << "\n";

return 0;
}