AcWing 3682. 图的连通分量

#include <iostream>
#include <string>
#include <stack>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
using namespace std;
#define ll long long
#define PII pair<int, int>
#define TUP tuple<int, int, int>
#define inf 0x3f3f3f3f
const int mod = 1e9 + 7;
const int N = 1e7 + 10;

int n, m, lim;
int arr[N], st[N], vis[N];
int lb(int x) {
    return x & -x;
}
void dfs(int x) {
    if (vis[x]) return;
    vis[x] = 1;
    if (st[x]) dfs(x ^ lim);
    int t = x;
    while (t) {
        dfs(x - lb(t));
        t &= t - 1;
    }
    return;
}
int main() {
    while (~scanf("%d%d", &n, &m)) {
        memset(st, 0, sizeof st);
        memset(vis, 0, sizeof vis);
        lim = (1 << n) - 1;
        int f = 0;
        for (int i = 0; i < m; i++) {
            cin >> arr[i];
            st[arr[i]] = 1;
            if (arr[i] == 0) f = 1;
        }
        if (f) {
            cout << 1 << endl;
            continue;
        }
        int ans = 0;
        for (int i = 0; i < m; i++) {
            if (vis[arr[i]]) continue;
            ++ans;
            dfs(arr[i] ^ lim);
        }
        cout << ans << endl;
    }

    return 0;
}