oj.uz

답안 #966728

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966728 2024-04-20T09:08:26 Z manizare Party (INOI20_party) C++17
63 / 100
 3000 ms 395192 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 ;
            }
        }
    }
    int T ;
    cin >> T ;
    while(T--){
        rep(i ,0 , 120)d[i] =0 ;
        ll n;
        cin >> n ;
        N = n ;
        ans =0 ;
        f();
        cout << ans * po(po(2,n)-1 , mod-2)%mod << "\n"; 
    }
    return 0 ;
}
/*


*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 394404 KB Output is correct
2 Correct 295 ms 394544 KB Output is correct
3 Correct 281 ms 394552 KB Output is correct
4 Correct 281 ms 394556 KB Output is correct
5 Correct 285 ms 394548 KB Output is correct
6 Correct 283 ms 394576 KB Output is correct
7 Correct 278 ms 394508 KB Output is correct
8 Correct 276 ms 394580 KB Output is correct
9 Correct 278 ms 394444 KB Output is correct
10 Correct 271 ms 394496 KB Output is correct
11 Correct 271 ms 394580 KB Output is correct
12 Correct 277 ms 394836 KB Output is correct
13 Correct 281 ms 394684 KB Output is correct
14 Correct 283 ms 394520 KB Output is correct
15 Correct 290 ms 394576 KB Output is correct
16 Correct 282 ms 394452 KB Output is correct
17 Correct 279 ms 394816 KB Output is correct
18 Correct 275 ms 394828 KB Output is correct
19 Correct 275 ms 394636 KB Output is correct
20 Correct 274 ms 394576 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 277 ms 394580 KB Output is correct
2 Correct 278 ms 394576 KB Output is correct
3 Correct 278 ms 394488 KB Output is correct
4 Correct 278 ms 394688 KB Output is correct
5 Correct 276 ms 394576 KB Output is correct
6 Correct 278 ms 394576 KB Output is correct
7 Correct 277 ms 394576 KB Output is correct
8 Correct 278 ms 394576 KB Output is correct
9 Correct 278 ms 394432 KB Output is correct
10 Correct 278 ms 394576 KB Output is correct
11 Correct 443 ms 394704 KB Output is correct
12 Correct 444 ms 394576 KB Output is correct
13 Correct 440 ms 394576 KB Output is correct
14 Correct 441 ms 394844 KB Output is correct
15 Correct 451 ms 394736 KB Output is correct
16 Correct 442 ms 394672 KB Output is correct
17 Correct 442 ms 394604 KB Output is correct
18 Correct 445 ms 394580 KB Output is correct
19 Correct 439 ms 394668 KB Output is correct
20 Correct 441 ms 394580 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 415 ms 394940 KB Output is correct
2 Correct 433 ms 394820 KB Output is correct
3 Correct 405 ms 394708 KB Output is correct
4 Correct 414 ms 394820 KB Output is correct
5 Correct 418 ms 394832 KB Output is correct
6 Correct 426 ms 395060 KB Output is correct
7 Correct 414 ms 394576 KB Output is correct
8 Correct 437 ms 395092 KB Output is correct
9 Correct 276 ms 394576 KB Output is correct
10 Correct 277 ms 394708 KB Output is correct
11 Correct 294 ms 394648 KB Output is correct
12 Correct 293 ms 394504 KB Output is correct
13 Correct 884 ms 394984 KB Output is correct
14 Correct 855 ms 394656 KB Output is correct
15 Correct 854 ms 394832 KB Output is correct
16 Correct 856 ms 394676 KB Output is correct
17 Correct 308 ms 394556 KB Output is correct
18 Correct 306 ms 394652 KB Output is correct
19 Correct 312 ms 394472 KB Output is correct
20 Correct 308 ms 394580 KB Output is correct

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 354 ms 394404 KB Output is correct
2 Correct 295 ms 394544 KB Output is correct
3 Correct 281 ms 394552 KB Output is correct
4 Correct 281 ms 394556 KB Output is correct
5 Correct 285 ms 394548 KB Output is correct
6 Correct 283 ms 394576 KB Output is correct
7 Correct 278 ms 394508 KB Output is correct
8 Correct 276 ms 394580 KB Output is correct
9 Correct 278 ms 394444 KB Output is correct
10 Correct 271 ms 394496 KB Output is correct
11 Correct 271 ms 394580 KB Output is correct
12 Correct 277 ms 394836 KB Output is correct
13 Correct 281 ms 394684 KB Output is correct
14 Correct 283 ms 394520 KB Output is correct
15 Correct 290 ms 394576 KB Output is correct
16 Correct 282 ms 394452 KB Output is correct
17 Correct 279 ms 394816 KB Output is correct
18 Correct 275 ms 394828 KB Output is correct
19 Correct 275 ms 394636 KB Output is correct
20 Correct 274 ms 394576 KB Output is correct
21 Correct 277 ms 394580 KB Output is correct
22 Correct 278 ms 394576 KB Output is correct
23 Correct 278 ms 394488 KB Output is correct
24 Correct 278 ms 394688 KB Output is correct
25 Correct 276 ms 394576 KB Output is correct
26 Correct 278 ms 394576 KB Output is correct
27 Correct 277 ms 394576 KB Output is correct
28 Correct 278 ms 394576 KB Output is correct
29 Correct 278 ms 394432 KB Output is correct
30 Correct 278 ms 394576 KB Output is correct
31 Correct 443 ms 394704 KB Output is correct
32 Correct 444 ms 394576 KB Output is correct
33 Correct 440 ms 394576 KB Output is correct
34 Correct 441 ms 394844 KB Output is correct
35 Correct 451 ms 394736 KB Output is correct
36 Correct 442 ms 394672 KB Output is correct
37 Correct 442 ms 394604 KB Output is correct
38 Correct 445 ms 394580 KB Output is correct
39 Correct 439 ms 394668 KB Output is correct
40 Correct 441 ms 394580 KB Output is correct
41 Correct 415 ms 394940 KB Output is correct
42 Correct 433 ms 394820 KB Output is correct
43 Correct 405 ms 394708 KB Output is correct
44 Correct 414 ms 394820 KB Output is correct
45 Correct 418 ms 394832 KB Output is correct
46 Correct 426 ms 395060 KB Output is correct
47 Correct 414 ms 394576 KB Output is correct
48 Correct 437 ms 395092 KB Output is correct
49 Correct 276 ms 394576 KB Output is correct
50 Correct 277 ms 394708 KB Output is correct
51 Correct 294 ms 394648 KB Output is correct
52 Correct 293 ms 394504 KB Output is correct
53 Correct 884 ms 394984 KB Output is correct
54 Correct 855 ms 394656 KB Output is correct
55 Correct 854 ms 394832 KB Output is correct
56 Correct 856 ms 394676 KB Output is correct
57 Correct 308 ms 394556 KB Output is correct
58 Correct 306 ms 394652 KB Output is correct
59 Correct 312 ms 394472 KB Output is correct
60 Correct 308 ms 394580 KB Output is correct
61 Correct 287 ms 394836 KB Output is correct
62 Correct 290 ms 394576 KB Output is correct
63 Correct 1670 ms 395052 KB Output is correct
64 Correct 1681 ms 394836 KB Output is correct
65 Correct 1735 ms 394864 KB Output is correct
66 Correct 1706 ms 395088 KB Output is correct
67 Correct 1746 ms 395192 KB Output is correct
68 Correct 1727 ms 394704 KB Output is correct
69 Correct 1698 ms 395100 KB Output is correct
70 Correct 1714 ms 394944 KB Output is correct
71 Correct 344 ms 394572 KB Output is correct
72 Correct 339 ms 394596 KB Output is correct
73 Correct 448 ms 394580 KB Output is correct
74 Correct 458 ms 394900 KB Output is correct
75 Execution timed out 3028 ms 395088 KB Time limit exceeded
76 Halted 0 ms 0 KB -