#1166222 (C++17) No.3554 Rurumaru Function Problem 2

• 問題: No.3554 Rurumaru Function Problem 2
• ユーザー: 👑 potato167
• 提出日時: 2026-05-22 23:35:22
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 6 ms / 2,000 ms
• コード長: 4,366 bytes
• コンパイル時間: 1,368 ms
• コンパイル使用メモリ: 218,544 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-05-22 23:35:26
• 合計ジャッジ時間: 2,701 ms
• ジャッジサーバーID （参考情報）: judge2_1 / judge3_0

ファイルパターン	結果
sample	AC * 3
other	AC * 12

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using pq_ = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(int)(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}

int f(int x, int y) {
    int d = 0;
    int res = 0;
    while (max(x, y)) {
        if (d % 2 == 1) {
            if (x % 2 + y % 2) res += (1 << d);
        }
        else {
            if (x % 2 + y % 2 == 2) res += (1 << d);
        }
        x /= 2, y /= 2;
        d++;
    }
    return res;
}

void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    /*
    const int N = 1000;
    int fr = -1;
    rep(i, 1, N) {
        map<int, int> m;
        rep(x, 0, i) rep(y, 0, i) {
            m[f(x, y)]++;
        }
        int ans = 0;
        for (auto [a, b] : m) {
            if (m[ans] < b) ans = a;
        }
        if (fr != ans) {
            fr = ans;
            cout << i << " " << ans << endl;
        }
    }*/
    const int D = 30;
    vector<int> p = {0}, q = {0};
    rep(d, 0, D) if (d % 2 == 1) {
        p.push_back(p.back() + (1 << d));
    }
    // upper 未満同士で、val になるものの数
    auto f = [&](ll upper, ll val) -> ll {
        vector dp(3, vector<ll>(3));
        dp[1][1] = 1;
        rep(d, 0, D) {
            vector n_dp(3, vector<ll>(3));
            rep(a, 0, 2) rep(b, 0, 2) {
                rep(i, 0, 3) rep(j, 0, 3) {
                    int x = i, y = j;
                    if (a == 0 && (upper & (1 << d)) != 0) x = 0;
                    if (a == 1 && (upper & (1 << d)) == 0) x = 2;
                    if (b == 0 && (upper & (1 << d)) != 0) y = 0;
                    if (b == 1 && (upper & (1 << d)) == 0) y = 2;
                    if (d % 2 == 0) {
                        if (((a & b) == 0) ^ ((val & (1 << d)) == 0)) continue;
                    }
                    else {
                        if (((a | b) == 0) ^ ((val & (1 << d)) == 0)) continue;
                    }
                    n_dp[x][y] += dp[i][j];
                }
            }
            swap(n_dp, dp);
        }
        return dp[0][0];
    };
    rep(i, 1, p.size()) {
        ll l = 0, r = (1ll << D);
        while (r - l > 1) {
            ll m = (l + r) / 2;
            if (f(m, p[i - 1]) >= f(m, p[i])) l = m;
            else r = m;
        }
        q.push_back(r);
        // cout << p[i] << " " << q.back() << "\n";
    }
    // cout << f(3, 0) << " " << f(3, 2) << "\n";
    ll N;
    cin >> N;
    ll ans = 0;
    rep(i, 1, p.size()) {
        ans += (p[i] - p[i - 1]) * max(0ll, N - q[i] + 1);
    }
    cout << ans << "\n";
}

/*
 * 2^0,2^2, 2^4, ... は流石に 0 だと思っていい
 * g([1,2]) = 0
 * g([3,10]) = 2
 * g([11,42]) = 10
 * g([43,171]) = 42
 * g([172,686]) = 170
 * g([687,????]) = 682
 * 682 = 2 + 8 + 32 + 128 + 512
 */