#634656 (C++17) No.1444 !Andd

• 問題: No.1444 !Andd
• ユーザー: rniya
• 提出日時: 2021-03-26 22:26:39
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 79 ms / 2,000 ms
• コード長: 5,150 bytes
• コンパイル時間: 2,231 ms
• コンパイル使用メモリ: 204,796 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-28 23:59:03
• 合計ジャッジ時間: 3,906 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	19 ms; 5,248 KB
testcase_04	AC	14 ms; 5,248 KB
testcase_05	AC	32 ms; 5,248 KB
testcase_06	AC	15 ms; 5,248 KB
testcase_07	AC	13 ms; 5,248 KB
testcase_08	AC	33 ms; 5,248 KB
testcase_09	AC	20 ms; 5,248 KB
testcase_10	AC	21 ms; 5,248 KB
testcase_11	AC	26 ms; 5,248 KB
testcase_12	AC	40 ms; 5,248 KB
testcase_13	AC	55 ms; 5,248 KB
testcase_14	AC	37 ms; 5,248 KB
testcase_15	AC	53 ms; 5,248 KB
testcase_16	AC	78 ms; 5,248 KB
testcase_17	AC	67 ms; 5,248 KB
testcase_18	AC	79 ms; 5,248 KB
testcase_19	AC	78 ms; 5,248 KB
testcase_20	AC	78 ms; 5,248 KB
testcase_21	AC	79 ms; 5,248 KB
testcase_22	AC	79 ms; 5,248 KB

ソースコード

#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;

const int MAX = 1 << 10;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;

    vector<vector<int>> dp1(2, vector<int>(MAX, 0)),
        dp2(2, vector<int>(MAX, 0));  // dp1:maskが存在するか、dp2:MAX以上で下10桁がmask
    dp1[0][1] = 1;

    for (int i = 0; i < N; i++) {
        int A;
        cin >> A;
        int nxt = (i + 1) & 1, cur = i & 1;
        if (A == 0)
            dp1[nxt][0] = 1;
        else {
            for (int mask = 0; mask < MAX; mask++) {
                if (dp1[cur][mask]) {
                    if (mask * A >= MAX)
                        dp2[nxt][(mask * A) & (MAX - 1)]++;
                    else
                        dp1[nxt][mask * A] = 1;
                    dp1[nxt][mask & A] = 1;
                }
                dp2[nxt][(mask * A) & (MAX - 1)] += dp2[cur][mask];
                if (dp2[cur][mask]) dp1[nxt][mask & A] = 1;
            }
        }

        int sum = 0;
        for (int mask = 0; mask < MAX; mask++) {
            sum += dp1[nxt][mask] + dp2[nxt][mask];
            dp1[cur][mask] = dp2[cur][mask] = 0;
        }
        cout << sum << '\n';
    }
    return 0;
}