結果
問題 | No.737 PopCount |
ユーザー |
![]() |
提出日時 | 2020-08-16 23:01:58 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 1,000 ms |
コード長 | 2,763 bytes |
コンパイル時間 | 1,364 ms |
コンパイル使用メモリ | 120,192 KB |
最終ジャッジ日時 | 2025-01-13 02:09:17 |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 15 |
コンパイルメッセージ
main.cpp: In function ‘void get(std::vector<long long int>&)’: main.cpp:25:38: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 25 | void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);} | ~~~~~^~~~~~~~~~~~~~ main.cpp: In function ‘void get(std::vector<std::vector<long long int> >&)’: main.cpp:26:56: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 26 | void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);} | ~~~~~^~~~~~~~~~~~~~~~~
ソースコード
#include <iostream>#include <string>#include <vector>#include <queue>#include <deque>#include <algorithm>#include <set>#include <map>#include <bitset>#include <cmath>#include <functional>#include <iomanip>#define vll vector<ll>#define vvvl vector<vvl>#define vvl vector<vector<ll>>#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));#define re(c, b) for(ll c=0;c<b;c++)#define rep(a,b,c) for(ll a=b;a<c;a++)#define all(obj) (obj).begin(), (obj).end()typedef long long int ll;typedef long double ld;using namespace std;void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}#define P 1000000007vll t(61, 1);ll n;vvvl dp = VVV(61, 61, 2, -1);ll f(ll keta, ll tgt, bool g){if(keta==-1) return 1;if(dp[keta][tgt][g]!=-1) return dp[keta][tgt][g];ll ret = 0;//1/0if(g){//0 or 1if(tgt==keta) ret = f(keta-1, tgt, g);else ret = (2*f(keta-1, tgt, g))%P;}else{if(tgt==keta){if((n>>keta)&1) ret = f(keta-1, tgt, g);else ret = 0;}else{if((n>>keta)&1){ret = (f(keta-1, tgt, 1) + f(keta-1, tgt, 0))%P;}else{ret = f(keta-1, tgt, 0); //0}}}return dp[keta][tgt][g] = ret;}vvvl dp2 = VVV(61, 61, 2, -1);ll ff(ll keta, ll tgt, bool g){if(keta==-1) return 0;if(dp2[keta][tgt][g]!=-1) return dp2[keta][tgt][g];ll ret = 0;//1/0ll t2 = t[keta]%P;ll y = f(keta-1, tgt, 0)%P;ll z = f(keta-1, tgt, 1)%P;if(g){//0 or 1if(tgt==keta) ret = (ff(keta-1, tgt, 1) + ((z*t2)%P))%P;//1else ret = (2*ff(keta-1, tgt, 1)+((z*t2)%P))%P;//0 or 1}else{if(tgt==keta){if((n>>keta)&1) ret = (ff(keta-1, tgt, g) + ((y*t2)%P))%P;//1else ret = 0;}else{if((n>>keta)&1){ll a = ff(keta-1, tgt, 1);//0ll b = (ff(keta-1, tgt, 0) + ((y*t2)%P))%P;//1ret = (a+b)%P;}else{ret = ff(keta-1, tgt, 0);//0}}}//if(tgt==0) std::cout << keta << " " << ret << " " << g << '\n';return dp2[keta][tgt][g] = ret;}int main(int argc, char const *argv[]) {std::cin >> n;for(int i=1;i<=60;i++) t[i] = t[i-1] * 2;// 0 ~ 60//i bit目が立つ数の和ll ans = 0;for(int i=0;i<=60;i++){if(t[i]>n) break;f(60, i, 0);}for(int i=0;i<=60;i++){if(t[i]>n) break;ans = (ans + ff(60, i, 0))%P;}//std::cout << f(60, 0, 0) << '\n';//std::cout << ff(60, 0, 0) << '\n';std::cout << ans << '\n';}