結果

問題 No.1560 majority x majority
ユーザー rniyarniya
提出日時 2021-06-25 22:22:37
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 379 ms / 2,000 ms
コード長 5,081 bytes
コンパイル時間 2,108 ms
コンパイル使用メモリ 203,044 KB
実行使用メモリ 83,588 KB
最終ジャッジ日時 2023-09-07 14:36:44
合計ジャッジ時間 5,994 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 379 ms
83,492 KB
testcase_01 AC 346 ms
83,588 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 278 ms
77,404 KB
testcase_04 AC 243 ms
69,052 KB
testcase_05 AC 256 ms
68,964 KB
testcase_06 AC 31 ms
9,840 KB
testcase_07 AC 9 ms
4,540 KB
testcase_08 AC 145 ms
35,320 KB
testcase_09 AC 59 ms
16,280 KB
testcase_10 AC 2 ms
4,384 KB
testcase_11 AC 11 ms
4,820 KB
testcase_12 AC 4 ms
4,376 KB
testcase_13 AC 12 ms
5,628 KB
testcase_14 AC 5 ms
4,380 KB
testcase_15 AC 47 ms
12,216 KB
testcase_16 AC 2 ms
4,376 KB
testcase_17 AC 185 ms
35,488 KB
testcase_18 AC 38 ms
9,344 KB
testcase_19 AC 2 ms
4,380 KB
testcase_20 AC 2 ms
4,380 KB
testcase_21 AC 3 ms
4,380 KB
testcase_22 AC 88 ms
16,172 KB
testcase_23 AC 2 ms
4,380 KB
testcase_24 AC 2 ms
4,380 KB
testcase_25 AC 74 ms
14,284 KB
testcase_26 AC 2 ms
4,380 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 2 ms
4,376 KB
testcase_29 AC 1 ms
4,376 KB
testcase_30 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, M;
    cin >> N >> M;
    vector<vector<int>> S(N, vector<int>(M));
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < M; j++) {
            cin >> S[i][j];
        }
    }

    vector<vector<int>> alive(1 << M, vector<int>(N, 1));
    for (int mask = 0; mask < (1 << M); mask++) {
        for (int i = 0; i < M; i++) {
            if (mask >> i & 1) continue;
            for (int j = 0; j < N; j++) {
                alive[mask][j] &= S[j][i];
            }
        }
    }

    vector<int> dp(1 << M, 0);
    dp[0] = 1;
    for (int mask = 0; mask < (1 << M); mask++) {
        for (int i = 0; i < M; i++) {
            if (mask >> i & 1) continue;
            int nmask = mask | 1 << i;
            int sum0 = 0, sum1 = 0;
            for (int j = 0; j < N; j++) {
                if (alive[nmask][j]) {
                    (S[j][i] ? sum1 : sum0)++;
                }
            }
            if (sum1 >= sum0) dp[nmask] += dp[mask];
        }
    }

    int ans = dp.back();
    cout << ans << '\n';
    return 0;
}
0