結果
問題 | No.737 PopCount |
ユーザー | shotoyoo |
提出日時 | 2021-09-01 23:44:08 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 9 ms / 1,000 ms |
コード長 | 6,574 bytes |
コンパイル時間 | 1,946 ms |
コンパイル使用メモリ | 214,672 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-28 20:58:49 |
合計ジャッジ時間 | 2,748 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
6,816 KB |
testcase_01 | AC | 6 ms
6,820 KB |
testcase_02 | AC | 5 ms
6,816 KB |
testcase_03 | AC | 6 ms
6,820 KB |
testcase_04 | AC | 7 ms
6,820 KB |
testcase_05 | AC | 8 ms
6,816 KB |
testcase_06 | AC | 9 ms
6,816 KB |
testcase_07 | AC | 7 ms
6,816 KB |
testcase_08 | AC | 9 ms
6,820 KB |
testcase_09 | AC | 7 ms
6,816 KB |
testcase_10 | AC | 5 ms
6,816 KB |
testcase_11 | AC | 4 ms
6,816 KB |
testcase_12 | AC | 8 ms
6,820 KB |
testcase_13 | AC | 7 ms
6,820 KB |
testcase_14 | AC | 5 ms
6,820 KB |
testcase_15 | AC | 4 ms
6,816 KB |
testcase_16 | AC | 5 ms
6,816 KB |
testcase_17 | AC | 6 ms
6,820 KB |
ソースコード
bool TEST = false; using namespace std; #include<bits/stdc++.h> #include<fstream> #define rep(i,n) for(int (i)=0;(i)<(ll)(n);i++) #define rrep(i,n) for(int (i)=(ll)(n)-1;(i)>=0;i--) #define range(i,start,end,step) for(int (i)=start;(i)<(ll)(end);(i)+=(step)) #define rrange(i,start,end,step) for(int (i)=start;(i)>(ll)(end);(i)+=(step)) #define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n"; #define spa << " " << #define fi first #define se second #define all(a) (a).begin(),(a).end() #define allr(a) (a).rbegin(),(a).rend() using ld = long double; using ll = long long; using ull = unsigned long long; using pii = pair<int, int>; using pll = pair<ll, ll>; using pdd = pair<ld, ld>; template<typename T> using V = vector<T>; template<typename T> using VV = V<V<T>>; template<typename T, typename T2> using P = pair<T, T2>; template<typename T, typename T2> using M = map<T, T2>; template<typename T> using S = set<T>; template<typename T, typename T2> using UM = unordered_map<T, T2>; template<typename T> using PQ = priority_queue<T, V<T>, greater<T>>; template<typename T> using rPQ = priority_queue<T, V<T>, less<T>>; template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); } template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); } template<class SS, class T> ostream& operator << (ostream& os, const pair<SS, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;} template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; } template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;} struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_; template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());} 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 (a>b) { a=b; return 1; } return 0; } void fail() { cout << -1 << '\n'; exit(0); } inline int popcount(const int x) { return __builtin_popcount(x); } inline int popcount(const ll x) { return __builtin_popcountll(x); } template<typename T> void debug(vector<vector<T>>&v){for(ll i=0;i<v.size();i++) {cerr<<v[i][0];for(ll j=1;j<v[i].size();j++)cerr spa v[i][j];cerr<<"\n";}}; template<typename T> void debug(vector<T>&v){if(v.size()!=0)cerr<<v[0]; for(ll i=1;i<v.size();i++)cerr spa v[i]; cerr<<"\n";}; template<typename T> P<T,T> divmod(T a, T b) {return make_pair(a/b, a%b);} const ll INF = (1ll<<62); // const ld EPS = 1e-10; // const ld PI = acos(-1.0); template< int mod > struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int) (1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while(n > 0) { if(n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); } static int get_mod() { return mod; } }; using m17 = ModInt<1'000'000'007>; using m98 = ModInt<998'244'353>; using MOD = m17; ll mod = 1'000'000'007; MOD g1[100001]; MOD g2[100001]; MOD inverse[100001]; void prepare() { g1[0] = g1[1] = g2[0] = g2[1] = 1; inverse[0] = 0; inverse[1] = 1; range(i,2,100001,1) { g1[i] = g1[i-1]*i; inverse[i] = -inverse[mod%i]*(mod/i); g2[i] = g2[i-1]*inverse[i]; } } template<typename T> MOD cmb(T n, T r) { assert(g1[0]==1); if (r<0 || r>n) return 0; r = min(r, n-r); return g1[n]*g2[r]*g2[n-r]; } template<typename T> MOD perm(T n, T r) { if (r<0 || r>n) return 0; return g1[n]*g2[n-r]; } struct HashPair { static size_t m_hash_pair_random; template<class T1, class T2> size_t operator()(const pair<T1, T2> &p) const { auto hash1 = hash<T1>{}(p.first); auto hash2 = hash<T2>{}(p.second); size_t seed = 0; seed ^= hash1 + 0x9e3779b9 + (seed << 6) + (seed >> 2); seed ^= hash2 + 0x9e3779b9 + (seed << 6) + (seed >> 2); seed ^= m_hash_pair_random + 0x9e3779b9 + (seed << 6) + (seed >> 2); return seed; } }; size_t HashPair::m_hash_pair_random = (size_t) random_device()(); using MM = unordered_map<P<ll, int>, P<MOD,MOD>, HashPair>; MM m; P<MOD,MOD> sub(ll n, int v) { if (n==0) { if (v==0) return {1,0}; return {0,0}; } else if (n<0) return {0,0}; if (m.find({n,v})!=m.end()) return m[{n,v}]; MOD res = 0; MOD num = 0; auto [n0,v0]= sub(n/2, v); auto [n1,v1] = sub((n-1)/2, v-1); num = n0 + n1; res = v0*2 + v1*2 + n1; m[{n,v}] = {num,res}; return {num,res}; } void Main(){ prepare(); ll n; cin >> n; int c = 100; MOD ans = 0; rep(i, c+1) { auto [num, res] = sub(n, i); ans += res * i; } cout << ans << endl; } int main(void){ std::ifstream in("tmp_in"); if (TEST) { std::cin.rdbuf(in.rdbuf()); std::cout << std::fixed << std::setprecision(15); } else { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(15); } Main(); }