結果
問題 | No.2060 AND Sequence |
ユーザー | woodywoody |
提出日時 | 2022-08-27 04:28:58 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 648 ms / 2,000 ms |
コード長 | 4,330 bytes |
コンパイル時間 | 4,104 ms |
コンパイル使用メモリ | 228,104 KB |
実行使用メモリ | 81,620 KB |
最終ジャッジ日時 | 2024-04-22 05:18:49 |
合計ジャッジ時間 | 24,799 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 114 ms
81,284 KB |
testcase_01 | AC | 115 ms
81,420 KB |
testcase_02 | AC | 381 ms
81,620 KB |
testcase_03 | AC | 115 ms
81,340 KB |
testcase_04 | AC | 112 ms
81,408 KB |
testcase_05 | AC | 114 ms
81,388 KB |
testcase_06 | AC | 114 ms
81,280 KB |
testcase_07 | AC | 114 ms
81,280 KB |
testcase_08 | AC | 113 ms
81,384 KB |
testcase_09 | AC | 114 ms
81,280 KB |
testcase_10 | AC | 114 ms
81,484 KB |
testcase_11 | AC | 112 ms
81,404 KB |
testcase_12 | AC | 116 ms
81,348 KB |
testcase_13 | AC | 114 ms
81,280 KB |
testcase_14 | AC | 253 ms
81,408 KB |
testcase_15 | AC | 306 ms
81,336 KB |
testcase_16 | AC | 413 ms
81,536 KB |
testcase_17 | AC | 301 ms
81,408 KB |
testcase_18 | AC | 220 ms
81,340 KB |
testcase_19 | AC | 269 ms
81,384 KB |
testcase_20 | AC | 488 ms
81,348 KB |
testcase_21 | AC | 429 ms
81,420 KB |
testcase_22 | AC | 172 ms
81,516 KB |
testcase_23 | AC | 514 ms
81,408 KB |
testcase_24 | AC | 635 ms
81,280 KB |
testcase_25 | AC | 644 ms
81,520 KB |
testcase_26 | AC | 648 ms
81,324 KB |
testcase_27 | AC | 626 ms
81,384 KB |
testcase_28 | AC | 645 ms
81,536 KB |
testcase_29 | AC | 630 ms
81,564 KB |
testcase_30 | AC | 645 ms
81,344 KB |
testcase_31 | AC | 631 ms
81,408 KB |
testcase_32 | AC | 635 ms
81,316 KB |
testcase_33 | AC | 633 ms
81,536 KB |
testcase_34 | AC | 644 ms
81,408 KB |
testcase_35 | AC | 641 ms
81,280 KB |
testcase_36 | AC | 642 ms
81,408 KB |
testcase_37 | AC | 626 ms
81,280 KB |
testcase_38 | AC | 644 ms
81,280 KB |
testcase_39 | AC | 630 ms
81,408 KB |
testcase_40 | AC | 630 ms
81,408 KB |
testcase_41 | AC | 640 ms
81,388 KB |
testcase_42 | AC | 638 ms
81,280 KB |
testcase_43 | AC | 630 ms
81,280 KB |
testcase_44 | AC | 648 ms
81,408 KB |
testcase_45 | AC | 644 ms
81,536 KB |
ソースコード
// #define _GLIBCXX_DEBUG #include<bits/stdc++.h> #include<atcoder/all> #define rep(i,b) for(int i=0;i<b;i++) #define rrep(i,b) for(int i=b-1;i>=0;i--) #define rep1(i,b) for(int i=1;i<b;i++) #define repx(i,x,b) for(int i=x;i<b;i++) #define rrepx(i,x,b) for(int i=b-1;i>=x;i--) #define fore(i,a) for(auto i:a) #define fore1(i,a) for(auto &i:a) #define rng(x) (x).begin(), (x).end() #define rrng(x) (x).rbegin(), (x).rend() #define sz(x) ((int)(x).size()) #define pb push_back #define fi first #define se second #define pcnt __builtin_popcountll using namespace std; using namespace atcoder; using ll = long long; using ld = long double; template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>; template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; } template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}} #define dame { cout << "No" << endl; return 0;} #define dame1 { cout << -1 << endl; return 0;} #define test(x) cout << "test" << x << endl; #define deb(x,y) cout << x << " " << y << endl; #define debp(p) cout << p.fi << " " << p.se << endl; #define deb3(x,y,z) cout << x << " " << y << " " << z << endl; #define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl; #define out cout << ans << endl; #define outd cout << fixed << setprecision(20) << ans << endl; #define outm cout << ans.val() << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define outdv fore(yans , ans) cout << yans.val() << "\n"; #define show(x) cerr<<#x<<" = "<<x<<endl; #define showdeb(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl; #define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;} #define showv2(v) fore(vy , v) cout << vy << "\n"; #define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;} #define showvm2(v) fore(vy , v) cout << vy.val() << "\n"; using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>; using tp = tuple<int ,int ,int>; using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>; using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>; using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>; using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>; using mint = modint998244353; using vm = vector<mint>; using vvm = vector<vector<mint>>; vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} #define yes {cout <<"Yes"<<endl;} #define yesr { cout <<"Yes"<<endl; return 0;} #define no {cout <<"No"<<endl;} #define nor { cout <<"No"<<endl; return 0;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; const int mod = 998244353; struct combination { vector<mint> fact, ifact; combination(int n):fact(n+1),ifact(n+1) { assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } } com(10000005); int main(){ int n,m; cin>>n>>m; vm cnt(32); int now = 0; rrep(i,30){ if ((m >> i & 1) == 1){ rep(j,i+1){ if (now+j >= 32) break; cnt[now+j] += com(i,j); } now++; } } // rep(i,32) cout << cnt[i].val() << " "; // cout << endl; int k = pcnt(m); cnt[k]++; vm dp = cnt; rep(i,n-1){ vm tmp(32); swap(tmp,dp); rep(j,32){ rep(k,j+1) dp[k] += tmp[j] * com(j,k); } } mint ans = 0; rep(i,32) ans += dp[i]; outm; // 消せ!!!!!! #define _GLIBCXX_DEBUG // priority_queue でしぬ return 0; }