提出 #54119467

---

ソースコード 拡げる

#include <iostream>
#include <vector>
#include <tuple>
#include <bitset>

using namespace std;

int main() {
    int N, M, K;
    cin >> N >> M >> K;

    vector<tuple<vector<int>, char>> tests;
    for (int i = 0; i < M; ++i) {
        int c;
        cin >> c;
        vector<int> keys(c);
        for (int j = 0; j < c; ++j) {
            cin >> keys[j];
            keys[j]--;  // 0-based index
        }
        char result;
        cin >> result;
        tests.push_back(make_tuple(keys, result));
    }

    auto is_valid_combination = [&](const bitset<100>& combination) {
        for (auto& test : tests) {
            const auto& keys = get<0>(test);
            char result = get<1>(test);
            int count = 0;
            for (int key : keys) {
                if (combination[key]) count++;
            }
            if ((result == 'o' && count < K) || (result == 'x' && count >= K)) {
                return false;
            }
        }
        return true;
    };

    int valid_count = 0;
    int max_combinations = 1 << N;  // 2^N combinations
    for (int i = 0; i < max_combinations; ++i) {
        bitset<100> combination(i);
        if (is_valid_combination(combination)) {
            valid_count++;
        }
    }

    cout << valid_count << endl;

    return 0;
}

提出情報

ジャッジ結果