oj.uz

Submission #1003364

# Submission time Handle Problem Language Result Execution time Memory
1003364 2024-06-20T09:16:14 Z vjudge1 Party (INOI20_party) C++17
0 / 100
 3000 ms 684 KB 
#include <bits/stdc++.h>
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){
    int res = 1;
    while(b){
        if(b & 1) res = res * a % MOD;
        b /= 2;
        a = a * a % MOD;
    }
    return res;
}
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();
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 604 KB Output is correct
2 Correct 109 ms 628 KB Output is correct
3 Correct 90 ms 604 KB Output is correct
4 Correct 76 ms 600 KB Output is correct
5 Correct 93 ms 604 KB Output is correct
6 Correct 88 ms 600 KB Output is correct
7 Correct 91 ms 600 KB Output is correct
8 Correct 84 ms 604 KB Output is correct
9 Correct 89 ms 604 KB Output is correct
10 Correct 96 ms 604 KB Output is correct
11 Execution timed out 3033 ms 684 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -