結果

問題 No.737 PopCount
ユーザー はまやんはまやんはまやんはまやん
提出日時 2018-09-30 10:03:24
言語 C++14
(gcc 11.1.0 + boost 1.77.0)
結果
AC  
実行時間 3 ms / 1,000 ms
コード長 4,115 Byte
コンパイル時間 1,516 ms
使用メモリ 3,680 KB
最終ジャッジ日時 2021-08-19 10:40:57
合計ジャッジ時間 2,627 ms
ジャッジサーバーID
(参考情報)
judge12 / judge15
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 1 ms
3,576 KB
testcase_01 AC 3 ms
3,436 KB
testcase_02 AC 2 ms
3,680 KB
testcase_03 AC 2 ms
3,580 KB
testcase_04 AC 2 ms
3,668 KB
testcase_05 AC 2 ms
3,564 KB
testcase_06 AC 2 ms
3,676 KB
testcase_07 AC 2 ms
3,520 KB
testcase_08 AC 2 ms
3,644 KB
testcase_09 AC 2 ms
3,508 KB
testcase_10 AC 1 ms
3,484 KB
testcase_11 AC 1 ms
3,640 KB
testcase_12 AC 2 ms
3,440 KB
testcase_13 AC 2 ms
3,644 KB
testcase_14 AC 2 ms
3,592 KB
testcase_15 AC 2 ms
3,512 KB
testcase_16 AC 2 ms
3,492 KB
testcase_17 AC 2 ms
3,556 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
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<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const {
        long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u);
    }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r;
}
typedef ModInt<1000000007> mint;
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \    | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/





ll N;
string B; int NB;
mint comb[61][62][2];
mint sum[61][62][2];
//---------------------------------------------------------------------------------------------------
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, 0, n) res = "0" + res;
    }
    return res;
}
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N;

    B = to_binary(N);
    NB = B.length();

    comb[0][0][0] = 1;
    sum[0][0][0] = 0;

    rep(dgt, 0, NB) rep(tot, 0, NB + 1) rep(isless, 0, 2) {
        int c = B[dgt] - '0';
        rep(nxt, 0, 2) {
            if (isless == 0 and c < nxt) continue;
            int isless2 = isless;
            if (nxt < c) isless2 = 1;
            comb[dgt + 1][tot + nxt][isless2] += comb[dgt][tot][isless];
            sum[dgt + 1][tot + nxt][isless2] += sum[dgt][tot][isless] * 2 + comb[dgt][tot][isless] * nxt;
        }
    }

    mint ans = 0;
    rep(tot, 0, NB + 2) rep(isless, 0, 2) ans += sum[NB][tot][isless] * tot;
    cout << ans << endl;
}
0