Submission #5892300

---

Source Code Expand

// {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
// }}}

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

static constexpr int mod = (int)1e9 + 7;
static constexpr int inf = 100100100;
static constexpr ll linf = 1e18;
static constexpr double eps = 1e-9;
static constexpr double pi = 3.14159265359;

#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (ll i = n; i >= 0; --i)
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define pb push_back
#define ist insert
#define fst first
#define snd second


ll N, M;
vector<ll> S[10];
vector<ll> P;

bool chk(ll x) {
    rep (m, M) {
        ll cnt = 0;
        for (auto s : S[m]) {
            if (x & (1 << s)) {
                ++cnt;
            }
        }
        if (cnt % 2 != P[m]) {
            return false;
        }
    }
    return true;
}

int main() {
    // cin.tie(0);
    // ios_base::sync_with_stdio(false);
    cin >> N >> M;
    rep (m, M) {
        ll K;
        cin >> K;
        rep (k, K) {
            ll s;
            cin >> s;
            S[m].pb(s - 1);
        }
    }
    rep (m, M) {
        ll p;
        cin >> p;
        P.pb(p);
    }
    ll ans = 0;
    for (ll x = 0; x < (1 << N); ++x) {
        if (chk(x)) {
            ++ans;
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result