oj.uz

Submission #1003137

# Submission time Handle Problem Language Result Execution time Memory
1003137 2024-06-20T06:39:19 Z vjudge1 Party (INOI20_party) C++17
7 / 100
 188 ms 604 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 = 203, MOD = 1e9 + 7;
int n;
int vis[MAX];
int Hcnt[MAX];
int pw[MAX];

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 dfs(int node, int h){
    if(vis[node] || node > n || node < 1) return;
    vis[node] = 1;
    Hcnt[h]++;
    dfs(node * 2, h + 1);
    dfs(node * 2 + 1, h + 1);
    dfs(node / 2, h + 1);
}

void solve(){
    cin >> n;
    int ans = 0;
    for(int i = 1; i <= n; i++){
        for(int j = 0; j <= n; j++){
            vis[j] = 0;
            Hcnt[j] = 0;
        } 
        dfs(i, 0);
        int oth = n;
        for(int j = 0; j <= n; j++){
            if(!Hcnt[j]) break;
            oth -= Hcnt[j];
            ans = (ans + j * (pw[Hcnt[j]] - 1) % MOD * pw[oth] % MOD) % MOD;
        }
    }
    cout << ans * inv(pw[n] - 1) % MOD << '\n';
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t; cin >> t;
    pw[0] = 1;
    for(int i = 1; i < MAX; i++){
        pw[i] = pw[i - 1] * 2 % MOD;
    }
    while(t--){
        solve();
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 6 ms 464 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 4 ms 456 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 160 ms 468 KB Output is correct
12 Correct 155 ms 460 KB Output is correct
13 Correct 180 ms 600 KB Output is correct
14 Correct 173 ms 472 KB Output is correct
15 Correct 180 ms 348 KB Output is correct
16 Correct 188 ms 344 KB Output is correct
17 Correct 92 ms 348 KB Output is correct
18 Correct 135 ms 456 KB Output is correct
19 Correct 95 ms 348 KB Output is correct
20 Correct 92 ms 464 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 6 ms 464 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 4 ms 456 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 160 ms 468 KB Output is correct
12 Correct 155 ms 460 KB Output is correct
13 Correct 180 ms 600 KB Output is correct
14 Correct 173 ms 472 KB Output is correct
15 Correct 180 ms 348 KB Output is correct
16 Correct 188 ms 344 KB Output is correct
17 Correct 92 ms 348 KB Output is correct
18 Correct 135 ms 456 KB Output is correct
19 Correct 95 ms 348 KB Output is correct
20 Correct 92 ms 464 KB Output is correct
21 Runtime error 1 ms 600 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -