Submission #1003333

#	Time	Username	Problem	Language	Result	Execution time	Memory
1003333		vjudge1	Party (INOI20_party)	C++17	0 / 100	3014 ms	1048576 KiB

Main

#include <bits/stdc++.h>
#pragma optimize("O3")
using namespace std;

#define int long long
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define oo 1e9

const int MAX = 2e18 + 8, MOD = 1e9 + 7, LOGMAX = 200;
int n;
int Hcnt[LOGMAX][LOGMAX];
int RHcnt[LOGMAX][LOGMAX];

int binpow(int a, int b){
    if(b == 0) return 1;
    if(b & 1) return binpow(a, b - 1) % MOD * a % MOD;
    else return binpow(a * a % MOD, b / 2) % MOD;
}
int inv(int a){
    return binpow(a, MOD - 2);
}

void solve(){
    cin >> n;
    int ans = 0;
    int LG = 0;
    int T = 1;
    while(T <= n / 2){LG++; T *= 2;};
    // if(n != (1ll << (LG + 1)) - 1){
    //     cout << "0\n";
    //     return;
    // }
    for(int i = 0; (1ll << i) <= n; i++){
        for(int j = 0; j <= LG + i; j++){
            Hcnt[i][j] = 0;
            RHcnt[i][j] = 0;
        }
        for(int j = 0; j <= LG - i; j++){
            Hcnt[i][j] = (1ll << j);
            RHcnt[i][j] = (1ll << max(0ll, j - 1));
        }
        if(i != 0){
            for(int j = 0; j <= LG + i - 1; j++){
                RHcnt[i][j + 1] += RHcnt[i - 1][j];
                Hcnt[i][j + 1] += RHcnt[i - 1][j];
            }
        }
        // for(int j = 0; j <= LG + i; j++) cout << Hcnt[i][j] << ' ';
        // cout << '\n';
        int oth = n;
        for(int j = 0; j <= LG + i; j++){
            oth -= Hcnt[i][j];
            ans = (ans + j * (binpow(2, Hcnt[i][j]) - 1 + MOD) % MOD * binpow(2, oth + i) % MOD) % MOD;
        }
    }
    cout << ans * inv((binpow(2, n) - 1 + MOD) % MOD) % MOD << '\n';
}

signed main(){
    // ios::sync_with_stdio(0);
    // cin.tie(0);
    // cout.tie(0);
    int t; cin >> t;
    while(t--){
        solve();
    }
}

Compilation message (stderr)

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize("O3")
      |

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 33
• Subtask 4: 0 / 37