結果

問題 No.737 PopCount
ユーザー pione
提出日時 2020-05-31 00:30:05
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 3 ms / 1,000 ms
コード長 2,671 bytes
コンパイル時間 1,715 ms
コンパイル使用メモリ 170,728 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-09 00:32:49
合計ジャッジ時間 2,562 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n) for (long long i = ((long long)(n)); i > 0; i--)
#define irep(i, m, n) for (long long i = (long long)(m); i < (long long)(n); ++i)
#define ireps(i, m, n) for (long long i = (long long)(m); i <= (long long)(n); ++i)
#define SORT(v, n) sort(v, v + n);
#define REVERSE(v, n) reverse(v, v+n);
#define vsort(v) sort(v.begin(), v.end());
#define all(v) v.begin(), v.end()
#define mp(n, m) make_pair(n, m);
#define cout(d) cout<<d<<endl;
#define coutd(d) cout<<std::setprecision(10)<<d<<endl;
#define cinline(n) getline(cin,n);
#define replace_all(s, b, a) replace(s.begin(),s.end(), b, a);
#define PI (acos(-1))
#define FILL(v, n, x) fill(v, v + n, x);
#define sz(x) long long(x.size())
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vs = vector<string>;
using vpll = vector<pair<ll, ll>>;
using vtp = vector<tuple<ll,ll,ll>>;
using vb = vector<bool>;
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; }
const ll INF = 1e9;
const ll MOD = 1e9+7;
const ll LINF = 1e18;
ll modpow(ll a, ll n) {
  ll res = 1;
  while (n > 0) {
    if (n & 1) res = res * a % MOD;
    (a *= a) %= MOD;
    n >>= 1;
  }
  return res;
}
string to_binary(ll N, int digit = 0) {
    string res = "";
    while (N) {
        if (N & 1) res = "1" + res;
        else res = "0" + res;
        N >>= 1;
    }
    if (0 < digit) {
        int n = digit - res.length();
        rep(i, n) res = "0" + res;
    }
    return res;
}
ll cnt[61][2][61]; // pos, isLess, count of 1 := 1の個数がkとなるときの通り数
ll sum[61][2][61]; // .. := n以下において、1の個数がkとなる総和
signed main()
{
  cin.tie( 0 ); ios::sync_with_stdio( false );
  string s; cin>>s;
  s=to_binary(stoll(s));
  ll n=s.size();
  
  cnt[0][0][0]=1;
  
  rep(i,n) rep(j,2) rep(k,n+1){
    ll now=s[i]-'0';
    rep(nxt,2){
      if(nxt>now&&j==0) continue;
      ll nj=j|nxt<now, nk=k+nxt;
      
      (cnt[i+1][nj][nk]+=cnt[i][j][k])%=MOD;
      (sum[i+1][nj][nk]+=sum[i][j][k]*2+cnt[i][j][k]*nxt)%=MOD;
      
    }
  }
  
  ll ans=0;
  rep(j,2) rep(k,n+2) (ans+=sum[n][j][k]*k%MOD)%=MOD;
  
  cout<<ans<<endl;
  
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0