結果
問題 | No.1710 Minimum OR is X |
ユーザー |
![]() |
提出日時 | 2021-10-15 23:29:42 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 40 ms / 2,000 ms |
コード長 | 5,590 bytes |
コンパイル時間 | 2,876 ms |
コンパイル使用メモリ | 120,844 KB |
最終ジャッジ日時 | 2025-01-25 01:12:30 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 30 |
ソースコード
#include <iostream>#include <algorithm>#include <iomanip>#include <vector>#include <queue>#include <set>#include <map>#include <tuple>#include <cmath>#include <numeric>#include <functional>#include <cassert>#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }using namespace std;typedef long long ll;const ll MOD = 998244353;class ModInt{public:ll v;ModInt(ll _v = 0){if(_v < 0) _v = (_v%MOD)+MOD;if(_v >= MOD) _v %= MOD;v = _v;}ModInt operator+(ll n){return ModInt((v+n)%MOD);}ModInt operator-(ll n){return ModInt((v-n+MOD)%MOD);}ModInt operator*(ll n){if(n >= MOD) n %= MOD;return ModInt((v*n)%MOD);}ModInt operator/(ll n){return ModInt((ModInt(n).inv()*v).v%MOD);}void operator+=(ll n){v = (v+n)%MOD;}void operator-=(ll n){v = (v-n+MOD)%MOD;}void operator*=(ll n){v = (v*n+MOD)%MOD;}ModInt operator+(ModInt n){return ModInt((v+n.v)%MOD);}ModInt operator-(ModInt n){return ModInt((v-n.v+MOD)%MOD);}ModInt operator*(ModInt n){return ModInt((v*n.v)%MOD);}ModInt operator/(ModInt n){return ModInt((n.inv()*v).v%MOD);}void operator+=(ModInt n){v = (v+n.v)%MOD;}void operator-=(ModInt n){v = (v-n.v+MOD)%MOD;}void operator*=(ModInt n){v = (v*n.v)%MOD;}void operator=(ModInt n){v = n.v;}bool operator==(ModInt n){return v == n.v;}bool operator!=(ModInt n){return v != n.v;}void operator=(ll n){v = n%MOD;}ModInt inv(){if(v == 1) return ModInt(1);else return ModInt(MOD-ModInt(MOD%v).inv().v*(MOD/v)%MOD);}};ostream& operator<<(ostream& os, const ModInt& m){os << m.v;return os;}istream & operator >> (istream &in, ModInt &m){in >> m.v;return in;}ModInt pow(ModInt a, ll n) {assert(n >= 0);ModInt ans = 1;ModInt tmp = a;for (int i = 0; i <= 60; i++) {ll m = (ll)1 << i;if (m & n) {ans *= tmp;}tmp *= tmp;}return ans;}#define N_MAX 200002ModInt inv[N_MAX],fac[N_MAX],finv[N_MAX], pow2[N_MAX];void init(){fac[0]=1;fac[1]=1;finv[0]=1;finv[1]=1;inv[1]=1;pow2[0] = 1;pow2[1] = 2;for(int i=2;i<N_MAX;i++){inv[i]=ModInt(MOD)-inv[MOD%i]*(MOD/i);fac[i]=fac[i-1]*(ll) i;finv[i]=finv[i-1]*inv[i];pow2[i] = pow2[i-1]*2;}}ModInt comb(ll n, ll r){if(n < r){return ModInt(0);}else{return fac[n]*finv[r]*finv[n-r];}}template<typename T>vector<vector<T>> vec2d(int n, int m, T v){return vector<vector<T>>(n, vector<T>(m, v));}template<typename T>vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));}template<typename T>void print_vector(vector<T> v, char delimiter=' '){for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;cout << v.back() << endl;}using mint = ModInt;string inc(string x){reverse(x.begin(), x.end());int m = x.size();string y;bool ok = false;for(int i = 0; i < m; i++){if(ok){y += x[i];}else{if(x[i] == '0'){y += '1';ok = true;}else{y += '0';}}}reverse(y.begin(), y.end());return y;}mint n1, n_all;mint comb_upper[300][300];void init_up(){for(int i = 0; i < 300; i++){comb_upper[i][i] = 1;for(int j = i-1; j >= 0; j--){comb_upper[i][j] = comb_upper[i][j+1]+comb(i, j);}}}mint cb_upper(int n, int r){if(r < 0) return comb_upper[n][0];if(r > n) return mint(0);return comb_upper[n][r];}mint sub_calc(string x, int n, int k){int m = x.size();auto dp = vec2d(m+1, n+1, mint(0));// debug_value(x)dp[0][n] = 1;for(int i = 0; i < m; i++){for(int j = k; j <= n; j++){if(x[i] == '1'){// dp[i+1][j] += dp[i][j]*n1;for(int l = 0; l <= k-1; l++){dp[i+1][j] += dp[i][j]*comb(j, l)*pow2[n-j];}}else{for(int l = k; l <= j; l++){dp[i+1][l] += dp[i][j]*comb(j, l)*pow2[n-j];}}}// cout << i << endl;// for(int j = 0; j <= n; j++) cout << dp[i+1][j] << ' ';// cout << endl;}mint ans = 0;for(int j = k; j <= n; j++){ans += dp[m][j];}// debug_value(ans)return ans;}bool all_one(string x){for(char c: x){if(c == '0') return false;}return true;}int main(){ios::sync_with_stdio(false);cin.tie(0);cout << setprecision(10) << fixed;init();init_up();int n, m, k; cin >> n >> m >> k;string x; cin >> x;n_all = pow(mint(2), n);for(int i = 0; i <= k-1; i++) n1 += comb(n, i);mint ans = sub_calc(x, n, k);cout << ans << endl;}