結果
問題 | No.1531 く2 |
ユーザー | PCTprobability |
提出日時 | 2021-05-08 01:36:11 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 5,283 bytes |
コンパイル時間 | 5,699 ms |
コンパイル使用メモリ | 304,728 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-17 03:15:36 |
合計ジャッジ時間 | 7,138 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,944 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 1 ms
6,940 KB |
testcase_13 | AC | 2 ms
6,940 KB |
testcase_14 | AC | 2 ms
6,940 KB |
testcase_15 | AC | 2 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 1 ms
6,940 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 2 ms
6,940 KB |
testcase_22 | AC | 1 ms
6,944 KB |
testcase_23 | AC | 2 ms
6,944 KB |
testcase_24 | AC | 2 ms
6,940 KB |
testcase_25 | AC | 1 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,940 KB |
testcase_27 | AC | 1 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,944 KB |
testcase_29 | AC | 2 ms
6,940 KB |
testcase_30 | AC | 2 ms
6,944 KB |
testcase_31 | AC | 1 ms
6,940 KB |
testcase_32 | AC | 2 ms
6,940 KB |
testcase_33 | AC | 2 ms
6,940 KB |
testcase_34 | AC | 2 ms
6,940 KB |
testcase_35 | AC | 2 ms
6,944 KB |
testcase_36 | AC | 2 ms
6,944 KB |
testcase_37 | AC | 2 ms
6,940 KB |
testcase_38 | AC | 2 ms
6,944 KB |
testcase_39 | AC | 2 ms
6,940 KB |
testcase_40 | AC | 2 ms
6,940 KB |
testcase_41 | AC | 1 ms
6,944 KB |
testcase_42 | AC | 1 ms
6,940 KB |
testcase_43 | AC | 2 ms
6,940 KB |
testcase_44 | AC | 2 ms
6,944 KB |
testcase_45 | AC | 2 ms
6,940 KB |
testcase_46 | AC | 2 ms
6,940 KB |
testcase_47 | AC | 2 ms
6,940 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> #include <unistd.h> using namespace std; #if __has_include(<atcoder/all>) #include <atcoder/all> using namespace atcoder; #endif using ll = long long; using ld = long double; using ull = long long; #define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i)) #define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define ALL(x) begin(x), end(x) #define all(s) (s).begin(),(s).end() //#define rep2(i, m, n) for (int i = (m); i < (n); ++i) //#define rep(i, n) rep2(i, 0, n) #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) #define rever(vec) reverse(vec.begin(), vec.end()) #define sor(vec) sort(vec.begin(), vec.end()) #define fi first #define se second #define pb push_back #define P pair<ll,ll> #define REP(i, n) for (int i = 0; i < (n); ++i) #define in scanner.read_int() const ll mod = 998244353; //const ll mod = 1000000007; const ll inf = 4500000000000000000ll; static const long double pi = 3.141592653589793; template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];} template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;} void YesNo(bool a){if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}} void YESNO(bool a){if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}} template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;} template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;} template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}} template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));} ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; } const ll t0=1,t1=10,t2=100,t3=1000,t4=10000,t5=100000,t6=1000000,t7=10000000,t8=t7*10,t9=t8*10,t10=t9*10,t11=t10*10,t12=t11*10,t13=t12*10,t14=t13*10,t15=t14*10,t16=t15*10,t17=t16*10,t18=t17*10; class Scanner { vector<char> buffer; ssize_t n_written; ssize_t n_read; public: Scanner(): buffer(1024*1024) { do_read(); } int64_t read_int() { int64_t ret = 0, sgn = 1; int ch = current_char(); while (isspace(ch)) { ch = next_char(); } if (ch == '-') { sgn = -1; ch = next_char(); } for (; isdigit(ch); ch = next_char()) ret = (ret * 10) + (ch - '0'); return sgn * ret; } private: void do_read() { ssize_t r = read(0, &buffer[0], buffer.size()); if (r < 0) { throw runtime_error(strerror(errno)); } n_written = r; n_read = 0; } inline int next_char() { ++n_read; if (n_read == n_written) { do_read(); } return current_char(); } inline int current_char() { return (n_read == n_written) ? EOF : buffer[n_read]; } }; //Scanner scanner; //void vin(vector<ll> &n){for(int i=0;i<int(n.size());i++) n[i]=in;} void cincout(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); cout<< fixed << setprecision(20); } // sum { n or a == n } 2^(popcount(a+k)) // dp[bitをどこまで見たか][popcount(a+k)][次に繰り上がりがあるか] // O(log^2N) using mint = modint998244353; mint dp[100][100][2]; int main() { cincout(); ll n,k; cin>>n>>k; assert(0<=n&&n<=1000000000000000000ll&&0<=k&&k<=1000000000000000000ll); for(int i=0;i<100;i++){ for(int j=0;j<100;j++){ for(int u=0;u<2;u++){ dp[i][j][u]=0; } } } dp[0][0][0]=1; // n%2=0 k%2=0 // dp[i][j][u] seni // a -> 0 // dp[i+1][j][0]+=dp[i][j][0] // dp[i+1][j+1][0]+=dp[i][j][1] // n%2=0 k%2=1 // dp[i][j][u] seni // a -> 0 // dp[i+1][j+1][0]+=dp[i][j][0] // dp[i+1][j][1]+=dp[i][j][1] // n%2=1 k%2=0 // dp[i][j][u] seni // a -> 0 // dp[i+1][j][0]+=dp[i][j][0] // dp[i+1][j+1][0]+=dp[i][j][1] // a -> 1 // dp[i+1][j+1][0]+=dp[i][j][0] // dp[i+1][j][1]+=dp[i][j][0] // n%2=1 k%2=1 // dp[i][j][u] seni // a -> 0 // dp[i+1][j+1][0]+=dp[i][j][0] // dp[i+1][j][1]+=dp[i][j][1] // a -> 1 // dp[i+1][j][1]+=dp[i][j][0] // dp[i+1][j+1][1]+=dp[i][j][1] vector<ll> N(100),K(100); for(int i=0;i<100;i++){ N[i]=n%2; n/=2; K[i]=k%2; k/=2; } for(ll i=0;i<100;i++){ ll a=N[i],b=K[i]; for(ll j=0;j<100;j++){ if(a==0&&b==0){ dp[i+1][j][0]+=dp[i][j][0]; dp[i+1][j+1][0]+=dp[i][j][1]; } else if(a==0&&b==1){ dp[i+1][j+1][0]+=dp[i][j][0]; dp[i+1][j][1]+=dp[i][j][1]; } else if(a==1&&b==0){ dp[i+1][j][0]+=dp[i][j][0]; dp[i+1][j+1][0]+=dp[i][j][1]; dp[i+1][j+1][0]+=dp[i][j][0]; dp[i+1][j][1]+=dp[i][j][1]; } else{ dp[i+1][j+1][0]+=dp[i][j][0]; dp[i+1][j][1]+=dp[i][j][1]; dp[i+1][j][1]+=dp[i][j][0]; dp[i+1][j+1][1]+=dp[i][j][1]; } } } mint ans=0; for(int i=0;i<100;i++){ ans+=dp[99][i][0]*mint(2).pow(i); } cout<<ans.val()<<endl; }