#827806 (C++17) No.2171 OR Assignment

• 問題: No.2171 OR Assignment
• ユーザー: t33f
• 提出日時: 2022-12-23 00:39:15
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 446 ms / 3,500 ms
• コード長: 3,236 bytes
• コンパイル時間: 943 ms
• コンパイル使用メモリ: 107,468 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-29 05:49:06
• 合計ジャッジ時間: 7,880 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	125 ms; 5,376 KB
testcase_13	AC	127 ms; 5,376 KB
testcase_14	AC	127 ms; 5,376 KB
testcase_15	AC	38 ms; 5,376 KB
testcase_16	AC	44 ms; 5,376 KB
testcase_17	AC	82 ms; 5,376 KB
testcase_18	AC	262 ms; 5,376 KB
testcase_19	AC	211 ms; 5,376 KB
testcase_20	AC	346 ms; 5,376 KB
testcase_21	AC	363 ms; 5,376 KB
testcase_22	AC	446 ms; 5,376 KB
testcase_23	AC	333 ms; 5,376 KB
testcase_24	AC	426 ms; 5,376 KB
testcase_25	AC	410 ms; 5,376 KB
testcase_26	AC	397 ms; 5,376 KB
testcase_27	AC	396 ms; 5,376 KB
testcase_28	AC	404 ms; 5,376 KB
testcase_29	AC	380 ms; 5,376 KB
testcase_30	AC	332 ms; 5,376 KB
testcase_31	AC	399 ms; 5,376 KB

ソースコード

#include <map>
#include <set>
#include <cmath>
#include <vector>
#include <iostream>
using namespace std;

template<int mod>
class modint {
    int val = 0;
    constexpr static int normalize(long long x) {
        if (0 <= x and x < mod) return static_cast<int>(x);
        else { x %= mod; return static_cast<int>(x >= 0 ? x : x + mod); }
    }
public:
    static const int modulus = mod;
    modint() {}
    constexpr modint(long long n) : val(normalize(n)) {}
    constexpr int value() const { return val; }
    constexpr modint operator-() const { return modint(mod - val); }
    constexpr modint inverse() const {
        long long x = mod, y = val, p = 1, q = 0, r = 0, s = 1;
        while (y != 0) {
            long long u = x / y;
            long long x0 = y; y = x - y * u; x = x0;
            long long r0 = p - r * u, s0 = q - s * u;
            p = r; r = r0; q = s; s = s0;
        }
        return modint(q);
    }
    constexpr const modint pow(long long e) const {
        if (e < 0) return pow(-e).inverse();
        long long ans = 1, p = val;
        while (e > 0) {
            if (e % 2 != 0) ans = (ans * p) % mod;
            p = (p * p) % mod;
            e >>= 1;
        }
        return modint(ans);
    }
    constexpr modint &operator+=(const modint r) {
        val += r.value();
        if (val >= mod) val -= mod;
        return *this;
    }
    constexpr modint &operator-=(const modint r) {
        val -= r.value();
        if (val < 0) val += mod;
        return *this;
    }
    constexpr modint &operator*=(const modint r) {
        val = (long long)val * r.value() % mod;
        return *this;
    }
    constexpr modint &operator/=(const modint r) {
        if (r.value() == 2) {
            val = (val % 2 ? val + mod : val) / 2;
        } else {
            val = (long long)val * r.inverse().value() % mod;
        }
        return *this;
    }

    friend constexpr modint operator+(const modint l, const modint r) {
        const int newval = l.value() + r.value();
        return newval >= mod ? newval - mod : newval;
    }
    friend constexpr modint operator-(const modint l, const modint r) { return l + (- r); }
    friend constexpr modint operator*(const modint l, const modint r) { return (long long)l.value() * r.value(); }
    friend constexpr modint operator/(const modint l, const modint r) { return l * r.inverse(); }
    friend constexpr bool operator==(const modint l, const modint r) { return l.value() == r.value(); }
    friend constexpr bool operator!=(const modint l, const modint r) { return l.value() != r.value(); }
};

constexpr int M = 998244353;
using mint = modint<M>;

int main() {
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    map<int, mint> v, p;
    p[a[0]] = 1;
    for (int i = 1; i < n; ++i) {
        v.clear();
        mint total = 0;
        for (const auto [k, x] : p) total += x;
        mint sub = 0;
        v[a[i]] = total;
        for (const auto [k, x] : p) {
            if (v.find(a[i] | k) == v.end())
                v[a[i] | k] += total - sub;
            sub += x;
        }

        v.swap(p);
    }
    mint ans = 0;
    for (auto [k, x] : p) ans += x;
    cout << ans.value() << endl;
}