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
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#define st first
#define nd second
typedef long long ll;
using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n; cin >> n;
    int m; cin >> m;
    ll x = 0;
    for (int i = 0; i < n; i++) {
        int b; cin >> b;
        x += (b<<i);
    }
    vector<pair<int, int>> pary(m);
    for (int i = 0; i < m; i++) {
        cin >> pary[i].st >> pary[i].nd;
    }
    int ans = 0;
    queue<ll> bfs;
    bfs.push(x);
    set<ll> vis;
    ans++;
    while (!bfs.empty()) {
        int u = bfs.front();
        vis.insert(u);
        bfs.pop();
        for (int i = 0; i < m; i++) {
            if ((u&(1<<pary[i].st)>0) == (u&(1<<pary[i].nd)>0)) {
                ll v = u^(1<<pary[i].st)^(1<<pary[i].nd);
                if (vis.find(v) == vis.end()) bfs.push(v);
            }
        }
    }
    cout << ans ;
}