提出 #54097162

---

ソースコード 拡げる

// #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf (ll)1e18
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define lll __int128
const int N = 105;
ll c[N], a[N][N];
char r[N];
void solve() {
    ll n, m, K;
    cin >> n >> m >> K;
    ll mx = (1ll << n) - 1;
    ll ans = 0;
    for (ll i = 1; i <= m; i++) {
        cin >> c[i];
        for (ll j = 1; j <= c[i]; j++) {
            cin >> a[i][j];
            a[i][j]--;
        }
        cin >> r[i];
    }
    for (ll k = 0; k <= mx; k++) {
        bool ok = true;
        for (ll i = 1; i <= m; i++) {
            ll s = 0;
            for (ll j = 1; j <= c[i]; j++) {
                s += k >> a[i][j] & 1;
            }
            char be = s >= K ? 'o' : 'x';
            if (be != r[i]) {
                ok = false;
                break;
            }
        }
        ans += ok;
    }
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

提出情報

ジャッジ結果