oj.uz

Submission #966730

# Submission time Handle Problem Language Result Execution time Memory
966730 2024-04-20T09:11:49 Z manizare Party (INOI20_party) C++17
100 / 100
 1717 ms 395340 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("O3,unroll-loops")
#define pb push_back
#define F first
#define S second 
#define ld long double
#define all(a) a.begin(),a.end()
#define pii pair <int,int>
#define ll long long 
#define PII pair<pii , pii>
#define sz(v) (int)v.size()
#define rep(i , a , b) for(int i=a;i <= (b);i++)
#define per(i , a , b) for(int i=a;i >= (b);i--)
#define deb(x) cout <<#x << " : " << x << "\n" ;
using namespace std ;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll maxn = 5e7+10 + 10,  inf = 1e9+10 , mod = 1e9 + 7 ;
ll a2[maxn] , dp[70][70][130] , pr[140] ;

ll po2(int b){
    if(b==0)return 1 ;
    if(b < maxn)return a2[b]; 
    ll v =po2(b/2); 
    v=v *v % mod ;
    if(b&1) v= v*2% mod;
    return v; 
}
ll po(ll a,ll b){
    if(b==0)return 1 ;
    ll v =po(a,b/2); 
    v=v *v % mod ;
    if(b&1) v= v*a % mod;
    return v; 
}
ll ch(ll x ,ll d , ll k){
    if(d==-1)return 0;
    d = min(d , k-x);
    return ((1ll<<(d+1))-1);
}
ll ans =0 , N , d[130] ;
vector <ll> cal(ll p){
    ll x = p , k= 0 ;
    vector <ll> h; 
    while(x*2 <= N){
        x *= 2 ;
        k++;
    }
    rep(i , 0 , k)h.pb((1ll<<i)) ;    
    if((x+(1ll<<k)-1) <= N){
        return h ;
    }
    ll az = (x+(1ll<<k)-1) - N ;
    h.back()-=az;
    return h ; 

}

void f(ll p = 1){
    if(p > N)return ;
    ll x= p , k =0 ;
    while(x*2 <= N){
        k++;
        x*=2 ;
    }
    if((x+(1ll<<k)-1) <= N){
        pr[0] = 0 ;
        rep(i , 1 ,120)pr[i] = pr[i-1] + d[i] ;
        rep(i , 0 , k){
            ll sm = 0 ;
            rep(j , 0 , 120){
                ll t = dp[k][i][j] + (j >= i ? pr[j-i] : 0); 
                if(t == N)break ;
                sm = (sm + po2((N-t)%(mod-1))-1);
                if(sm > mod)sm -= mod ;
            }
            sm += mod;
            if(sm > mod)sm-=mod;
            ans = (ans + sm*po2(i))%mod ;
        }
        return ;
    }
    vector <ll> A = cal(p*2) ;
    vector <ll> B = cal(p*2+1) ;
    ll d2[130] , ls[130] ;
    rep(i , 0 , 120){
        d2[i] =0 ;
        ls[i] = d[i] ;
    }
    d2[1] = 1 ;
    rep(i , 1 , 120){
        d2[i] += d[i-1] ;
    }
    rep(i , 0 , sz(B)-1){
        d2[i+2] += B[i] ;
    }
    rep(i , 0 , 120){
        swap(d[i] , d2[i]) ;
    }
    f(p*2) ;
    rep(i , 0 , sz(B)-1){
        d[i+2] -= B[i] ;
    }
    rep(i , 0 ,sz(A)-1){
        d[i+2] += A[i] ;
    }
    f(p*2+1); 
    rep(i , 0 , 120)d[i] = ls[i] ;
    pr[0] = d[0] ;
    rep(i , 1, 120)pr[i] = pr[i-1] + d[i] ;
    rep(i , 1 , sz(A)-1)A[i] += A[i-1] ;
    rep(i , 1, sz(B)-1)B[i] += B[i-1] ;
    rep(i , 0 , 120){
        if(i ==0){
            ans = (ans + po2((N-1)%(mod-1))-1);
            if(ans > mod)ans-=mod;
            continue ;
        }
        ll t = pr[i] + A[min(sz(A)-1 , i-1)] + B[min(sz(B)-1 , i-1)]+1 ;
        ans = (ans + po2((N-t)%(mod-1))-1);
        if(ans > mod)ans -= mod ;
    }
}

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
    a2[0] = 1;
    rep(i , 1 ,maxn-1){
        a2[i] = a2[i-1]*2%mod ;
    }
    rep(k , 0 , 60){
        rep(i , 0 , k){
            rep(d , 0 , 120){
                ll ans = ch(i , d , k) ;
                ll x = i-1 , D = d-1 ;
                while(x!=-1 && D!=-1){
                    ans++ ;
                    ans = (ans + ch(x+1 , D-1 , k));
                    D--;
                    x--;
                }
                dp[k][i][d] = ans ;
            }
        }
    }
    map <ll,ll> mp ;
    int T ;
    cin >> T ;
    while(T--){
        rep(i ,0 , 120)d[i] =0 ;
        ll n;
        cin >> n ;
        if(mp[n]!=0){
            cout << mp[n] << "\n";
            continue ;
        }
        N = n ;
        ans =0 ;
        f();
        mp[n] = ans * po(po(2,n)-1 , mod-2)%mod;
        cout << ans * po(po(2,n)-1 , mod-2)%mod << "\n"; 
    }
    return 0 ;
}
/*


*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 394572 KB Output is correct
2 Correct 281 ms 394672 KB Output is correct
3 Correct 282 ms 394452 KB Output is correct
4 Correct 276 ms 394580 KB Output is correct
5 Correct 276 ms 394576 KB Output is correct
6 Correct 276 ms 394576 KB Output is correct
7 Correct 281 ms 394608 KB Output is correct
8 Correct 276 ms 394524 KB Output is correct
9 Correct 278 ms 394408 KB Output is correct
10 Correct 278 ms 394588 KB Output is correct
11 Correct 282 ms 394580 KB Output is correct
12 Correct 291 ms 394596 KB Output is correct
13 Correct 283 ms 394560 KB Output is correct
14 Correct 282 ms 394680 KB Output is correct
15 Correct 283 ms 394520 KB Output is correct
16 Correct 285 ms 394540 KB Output is correct
17 Correct 280 ms 394620 KB Output is correct
18 Correct 278 ms 394576 KB Output is correct
19 Correct 278 ms 394612 KB Output is correct
20 Correct 278 ms 394656 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 293 ms 394456 KB Output is correct
2 Correct 284 ms 394588 KB Output is correct
3 Correct 287 ms 394568 KB Output is correct
4 Correct 280 ms 394584 KB Output is correct
5 Correct 284 ms 394656 KB Output is correct
6 Correct 281 ms 394580 KB Output is correct
7 Correct 286 ms 394536 KB Output is correct
8 Correct 277 ms 394504 KB Output is correct
9 Correct 282 ms 394528 KB Output is correct
10 Correct 282 ms 394540 KB Output is correct
11 Correct 279 ms 394684 KB Output is correct
12 Correct 275 ms 394584 KB Output is correct
13 Correct 279 ms 394572 KB Output is correct
14 Correct 279 ms 394576 KB Output is correct
15 Correct 277 ms 394760 KB Output is correct
16 Correct 277 ms 394504 KB Output is correct
17 Correct 275 ms 394576 KB Output is correct
18 Correct 277 ms 394564 KB Output is correct
19 Correct 277 ms 394480 KB Output is correct
20 Correct 278 ms 394792 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 411 ms 394836 KB Output is correct
2 Correct 436 ms 394904 KB Output is correct
3 Correct 406 ms 394832 KB Output is correct
4 Correct 408 ms 394772 KB Output is correct
5 Correct 319 ms 394592 KB Output is correct
6 Correct 315 ms 394832 KB Output is correct
7 Correct 316 ms 394832 KB Output is correct
8 Correct 316 ms 394768 KB Output is correct
9 Correct 277 ms 394580 KB Output is correct
10 Correct 277 ms 394504 KB Output is correct
11 Correct 275 ms 394632 KB Output is correct
12 Correct 278 ms 394788 KB Output is correct
13 Correct 292 ms 394832 KB Output is correct
14 Correct 277 ms 394732 KB Output is correct
15 Correct 280 ms 394972 KB Output is correct
16 Correct 277 ms 394832 KB Output is correct
17 Correct 284 ms 394632 KB Output is correct
18 Correct 277 ms 394584 KB Output is correct
19 Correct 276 ms 394572 KB Output is correct
20 Correct 274 ms 394576 KB Output is correct

Subtask #4
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 273 ms 394572 KB Output is correct
2 Correct 281 ms 394672 KB Output is correct
3 Correct 282 ms 394452 KB Output is correct
4 Correct 276 ms 394580 KB Output is correct
5 Correct 276 ms 394576 KB Output is correct
6 Correct 276 ms 394576 KB Output is correct
7 Correct 281 ms 394608 KB Output is correct
8 Correct 276 ms 394524 KB Output is correct
9 Correct 278 ms 394408 KB Output is correct
10 Correct 278 ms 394588 KB Output is correct
11 Correct 282 ms 394580 KB Output is correct
12 Correct 291 ms 394596 KB Output is correct
13 Correct 283 ms 394560 KB Output is correct
14 Correct 282 ms 394680 KB Output is correct
15 Correct 283 ms 394520 KB Output is correct
16 Correct 285 ms 394540 KB Output is correct
17 Correct 280 ms 394620 KB Output is correct
18 Correct 278 ms 394576 KB Output is correct
19 Correct 278 ms 394612 KB Output is correct
20 Correct 278 ms 394656 KB Output is correct
21 Correct 293 ms 394456 KB Output is correct
22 Correct 284 ms 394588 KB Output is correct
23 Correct 287 ms 394568 KB Output is correct
24 Correct 280 ms 394584 KB Output is correct
25 Correct 284 ms 394656 KB Output is correct
26 Correct 281 ms 394580 KB Output is correct
27 Correct 286 ms 394536 KB Output is correct
28 Correct 277 ms 394504 KB Output is correct
29 Correct 282 ms 394528 KB Output is correct
30 Correct 282 ms 394540 KB Output is correct
31 Correct 279 ms 394684 KB Output is correct
32 Correct 275 ms 394584 KB Output is correct
33 Correct 279 ms 394572 KB Output is correct
34 Correct 279 ms 394576 KB Output is correct
35 Correct 277 ms 394760 KB Output is correct
36 Correct 277 ms 394504 KB Output is correct
37 Correct 275 ms 394576 KB Output is correct
38 Correct 277 ms 394564 KB Output is correct
39 Correct 277 ms 394480 KB Output is correct
40 Correct 278 ms 394792 KB Output is correct
41 Correct 411 ms 394836 KB Output is correct
42 Correct 436 ms 394904 KB Output is correct
43 Correct 406 ms 394832 KB Output is correct
44 Correct 408 ms 394772 KB Output is correct
45 Correct 319 ms 394592 KB Output is correct
46 Correct 315 ms 394832 KB Output is correct
47 Correct 316 ms 394832 KB Output is correct
48 Correct 316 ms 394768 KB Output is correct
49 Correct 277 ms 394580 KB Output is correct
50 Correct 277 ms 394504 KB Output is correct
51 Correct 275 ms 394632 KB Output is correct
52 Correct 278 ms 394788 KB Output is correct
53 Correct 292 ms 394832 KB Output is correct
54 Correct 277 ms 394732 KB Output is correct
55 Correct 280 ms 394972 KB Output is correct
56 Correct 277 ms 394832 KB Output is correct
57 Correct 284 ms 394632 KB Output is correct
58 Correct 277 ms 394584 KB Output is correct
59 Correct 276 ms 394572 KB Output is correct
60 Correct 274 ms 394576 KB Output is correct
61 Correct 286 ms 394564 KB Output is correct
62 Correct 294 ms 394924 KB Output is correct
63 Correct 1693 ms 395340 KB Output is correct
64 Correct 1687 ms 395152 KB Output is correct
65 Correct 1709 ms 395128 KB Output is correct
66 Correct 1717 ms 395268 KB Output is correct
67 Correct 323 ms 394820 KB Output is correct
68 Correct 322 ms 394836 KB Output is correct
69 Correct 322 ms 395172 KB Output is correct
70 Correct 316 ms 394644 KB Output is correct
71 Correct 280 ms 394456 KB Output is correct
72 Correct 277 ms 394576 KB Output is correct
73 Correct 277 ms 394912 KB Output is correct
74 Correct 273 ms 394804 KB Output is correct
75 Correct 277 ms 394884 KB Output is correct
76 Correct 279 ms 394996 KB Output is correct
77 Correct 275 ms 394884 KB Output is correct
78 Correct 309 ms 394712 KB Output is correct
79 Correct 280 ms 394468 KB Output is correct
80 Correct 280 ms 394576 KB Output is correct
81 Correct 277 ms 394536 KB Output is correct
82 Correct 275 ms 394504 KB Output is correct