結果

問題 No.1189 Sum is XOR
コンテスト
ユーザー firiexp
提出日時 2020-08-22 15:05:36
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 2,943 bytes
コンパイル時間 1,760 ms
コンパイル使用メモリ 101,976 KB
最終ジャッジ日時 2025-01-13 09:09:20
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 2
other AC * 8 WA * 13
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 998244353;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

template<u32 M = 1000000007>
struct modint{
    u32 val;
    modint(): val(0){}
    template<typename T>
    modint(T t){t %= (T)M; if(t < 0) t += (T)M; val = t;}

    modint pow(ll k) const {
        modint res(1), x(val);
        while(k){
            if(k&1) res *= x;
            x *= x;
            k >>= 1;
        }
        return res;
    }
    template<typename T>
    modint& operator=(T t){t %= (T)M; if(t < 0) t += (T)M; val = t; return *this;}
    modint inv() const {return pow(M-2);}
    modint& operator+=(modint a){val += a.val; if(val >= M) val -= M; return *this;}
    modint& operator-=(modint a){if(val < a.val) val += M-a.val; else val -= a.val; return *this;}
    modint& operator*=(modint a){val = (u64)val*a.val%M; return *this;}
    modint& operator/=(modint a){return (*this) *= a.inv();}
    modint operator+(modint a) const {return modint(val) +=a;}
    modint operator-(modint a) const {return modint(val) -=a;}
    modint operator*(modint a) const {return modint(val) *=a;}
    modint operator/(modint a) const {return modint(val) /=a;}
    modint operator-(){return modint(M-val);}
    bool operator==(const modint a) const {return val == a.val;}
    bool operator!=(const modint a) const {return val != a.val;}
    bool operator<(const modint a) const {return val < a.val;}
};
using mint = modint<MOD>;

int main() {
    int n, k;
    cin >> n >> k;
    if(k > 10){
        puts("0");
        return 0;
    }
    auto dp = make_v(1 << 10, 11, mint(0));
    for (int i = 0; i < n; ++i) {
        int x;
        cin >> x;
        dp[x][1] += 1;
    }
    for (int S = 0; S < (1 << 10); ++S) {
        for (int T = S; ; T = (T-1)&S) {
            int U = T^S;
            if(T < U){
                for (int i = 1; i <= 10; ++i) {
                    for (int j = 1; i+j <= 10; ++j) {
                        dp[S][i+j] += dp[T][i]*dp[U][j];
                    }
                }
            }
            if (T==0) break;
        }
    }
    mint ans = 0;
    for (int i = 0; i < (1 << 10); ++i) {
        ans += dp[i][k];
        cout << i << " " << dp[i][k].val << "\n";
    }
    cout << ans.val << "\n";
    return 0;
}
0