LeetCode-Solutions/C++/count-connected-subgraphs-with-even-node-sum.cpp at master · kamyu104/LeetCode-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
// Time:  O((n + e) * 2^n)
// Space: O(n + e)

// bitmask, dfs
class Solution {
public:
    int evenSumSubgraphs(vector<int>& nums, vector<vector<int>>& edges) {
        int odd_mask = 0;
        const auto& even = [&](int mask) {
            return !(__builtin_popcount(mask & odd_mask) % 2);
        };

        vector<vector<int>> adj(size(nums));
        const auto& connected = [&](int mask) {
            int i = 0;
            for (; i < size(nums); ++i) {
                if (mask & (1 << i)) {
                    break;
                }
            }
            mask ^= 1 << i;
            vector<int> stk = {i};
            while (!empty(stk)) {
                const int u = stk.back(); stk.pop_back();
                for (const auto& v : adj[u]) {
                    if (!(mask & (1 << v))) {
                        continue;
                    }
                    mask ^= 1 << v;
                    stk.emplace_back(v);
                }
            }
            return !mask;
        };

        for (const auto& e : edges) {
            adj[e[0]].emplace_back(e[1]);
            adj[e[1]].emplace_back(e[0]);
        }
        for (int i = 0; i < size(nums); ++i) {
            if (nums[i]) {
                odd_mask |= 1 << i;
            }
        }
        int result = 0;
        for (int mask = 1; mask < (1 << size(nums)); ++mask) {
            if (even(mask) && connected(mask)) {
                ++result;
            }
        }
        return result;
    }
};

// Time:  O((n + e) * 2^n)
// Space: O(n + e)
// bitmask, dfs
class Solution2 {
public:
    int evenSumSubgraphs(vector<int>& nums, vector<vector<int>>& edges) {
        const auto& even = [&](int mask) {
            int parity = 0;
            for (int i = 0; i < size(nums); ++i) {
                if (mask & (1 << i)) {
                    parity ^= nums[i];
                }
            }
            return !parity;
        };

        vector<vector<int>> adj(size(nums));
        const auto& connected = [&](int mask) {
            int i = 0;
            for (; i < size(nums); ++i) {
                if (mask & (1 << i)) {
                    break;
                }
            }
            mask ^= 1 << i;
            vector<int> stk = {i};
            while (!empty(stk)) {
                const int u = stk.back(); stk.pop_back();
                for (const auto& v : adj[u]) {
                    if (!(mask & (1 << v))) {
                        continue;
                    }
                    mask ^= 1 << v;
                    stk.emplace_back(v);
                }
            }
            return !mask;
        };

        for (const auto& e : edges) {
            adj[e[0]].emplace_back(e[1]);
            adj[e[1]].emplace_back(e[0]);
        }
        int result = 0;
        for (int mask = 1; mask < (1 << size(nums)); ++mask) {
            if (even(mask) && connected(mask)) {
                ++result;
            }
        }
        return result;
    }
};