結果
| 問題 | No.1710 Minimum OR is X |
| ユーザー |
 snuke
|
| 提出日時 | 2021-10-27 05:24:48 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 78 ms / 2,000 ms |
| コード長 | 5,271 bytes |
| コンパイル時間 | 2,408 ms |
| コンパイル使用メモリ | 205,172 KB |
| 最終ジャッジ日時 | 2025-01-25 07:36:18 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 30 |
コンパイルメッセージ
main.cpp: In function ‘int getInt()’:
main.cpp:24:25: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
24 | int getInt(){int x;scanf("%d",&x);return x;}
| ~~~~~^~~~~~~~~
main.cpp: In member function ‘void Solver::solve()’:
main.cpp:114:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
114 | scanf("%d%d%d",&n,&m,&k);
| ~~~~~^~~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>#define rep(i,n) for(int i = 0; i < (n); ++i)#define rrep(i,n) for(int i = 1; i <= (n); ++i)#define drep(i,n) for(int i = (n)-1; i >= 0; --i)#define srep(i,s,t) for (int i = s; i < (t); ++i)#define rng(a) a.begin(),a.end()#define rrng(a) a.rbegin(),a.rend()#define fi first#define se second#define pb push_back#define eb emplace_back#define sz(x) (int)(x).size()#define pcnt __builtin_popcountll#define snuke srand((unsigned)clock()+(unsigned)time(NULL));#define newline puts("")using namespace std;template<typename T> using vc = vector<T>;template<typename T> using vv = vc<vc<T>>;template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>;using uint = unsigned; using ull = unsigned long long;using vi = vc<int>; using vvi = vv<int>;using ll = long long; using vl = vc<ll>; using vvl = vv<ll>;using P = pair<int,int>; using vp = vc<P>;int getInt(){int x;scanf("%d",&x);return x;}vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;}template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;}template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();}template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;}template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;}template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;}template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;}template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;}template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;}template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;}template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#define dame { puts("-1"); return;}#define yes { puts("Yes"); return;}#define no { puts("No"); return;}#define yn {puts("Yes");}else{puts("No");}const int MX = 200005;// Mod intconst uint mod = 998244353;struct mint {uint x;mint(): x(0) {}mint(ll x):x((x%mod+mod)%mod) {}mint operator-() const { return mint(0) - *this;}mint operator~() const { return mint(1) / *this;}mint& operator+=(const mint& a) { if((x+=a.x)>=mod) x-=mod; return *this;}mint& operator-=(const mint& a) { if((x+=mod-a.x)>=mod) x-=mod; return *this;}mint& operator*=(const mint& a) { x=(ull)x*a.x%mod; return *this;}mint& operator/=(const mint& a) { x=(ull)x*a.pow(mod-2).x%mod; return *this;}mint operator+(const mint& a) const { return mint(*this) += a;}mint operator-(const mint& a) const { return mint(*this) -= a;}mint operator*(const mint& a) const { return mint(*this) *= a;}mint operator/(const mint& a) const { return mint(*this) /= a;}mint pow(ll t) const {if(!t) return 1;mint res = pow(t/2);res *= res;return (t&1)?res*x:res;}bool operator<(const mint& a) const { return x < a.x;}bool operator==(const mint& a) const { return x == a.x;}bool operator!=(const mint& a) const { return x != a.x;}};mint ex(mint x, ll t) { return x.pow(t);}istream& operator>>(istream&i,mint&a) {i>>a.x;return i;}//*ostream& operator<<(ostream&o,const mint&a) {o<<a.x;return o;}/*/ostream& operator<<(ostream&o, const mint&x) {int a = x.x, b = 1;rep(s,2)rrep(i,1000) {int y = ((s?-x:x)*i).x;if (abs(a)+b > y+i) a = s?-y:y, b = i;}o<<a; if (b != 1) o<<'/'<<b; return o;}//*/using vm = vector<mint>;using vvm = vector<vm>;struct modinv {int n; vm d;modinv(): n(2), d({0,1}) {}mint operator()(int i) { while (n <= i) d.pb(-d[mod%n]*(mod/n)), ++n; return d[i];}mint operator[](int i) const { return d[i];}} invs;struct modfact {int n; vm d;modfact(): n(2), d({1,1}) {}mint operator()(int i) { while (n <= i) d.pb(d.back()*n), ++n; return d[i];}mint operator[](int i) const { return d[i];}} facs;struct modfactinv {int n; vm d;modfactinv(): n(2), d({1,1}) {}mint operator()(int i) { while (n <= i) d.pb(d.back()*invs(n)), ++n; return d[i];}mint operator[](int i) const { return d[i];}} ifacs;mint comb(int a, int b) {if (a < b || b < 0) return 0;return facs(a)*ifacs(b)*ifacs(a-b);}//struct Solver {void solve() {int n,m,k;scanf("%d%d%d",&n,&m,&k);string s;cin>>s;vm d(n+1);rep(i,n+1)srep(j,i-k+1,i+1) d[i] += comb(i,j);vm dp(n+1);dp[n] = 1;rep(i,m) {vm p(n+1); swap(dp,p);if (s[i] == '1') {rep(j,n+1) dp[j] += p[j]*d[j];} else {mint two = 1;srep(j,i+1,m) two *= 2;for (int j = n; j >= k; --j) {srep(nj,k,j+1) dp[nj] += p[j]*comb(j,nj)*two.pow(j-nj);}}}mint ans;rep(i,n+1) ans += dp[i];cout<<ans<<endl;}};int main() {int ts = 1;// scanf("%d",&ts);rrep(ti,ts) {Solver solver;solver.solve();}return 0;}