oj.uz

답안 #966729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966729 2024-04-20T09:10:26 Z manizare Party (INOI20_party) C++17
7 / 100
 439 ms 394908 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 <int,int> 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

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 394648 KB Output is correct
2 Correct 275 ms 394644 KB Output is correct
3 Correct 274 ms 394676 KB Output is correct
4 Correct 287 ms 394812 KB Output is correct
5 Correct 275 ms 394504 KB Output is correct
6 Correct 278 ms 394552 KB Output is correct
7 Correct 283 ms 394576 KB Output is correct
8 Correct 277 ms 394616 KB Output is correct
9 Correct 280 ms 394412 KB Output is correct
10 Correct 275 ms 394576 KB Output is correct
11 Correct 275 ms 394732 KB Output is correct
12 Correct 274 ms 394580 KB Output is correct
13 Correct 287 ms 394712 KB Output is correct
14 Correct 277 ms 394472 KB Output is correct
15 Correct 278 ms 394508 KB Output is correct
16 Correct 274 ms 394908 KB Output is correct
17 Correct 277 ms 394580 KB Output is correct
18 Correct 276 ms 394748 KB Output is correct
19 Correct 275 ms 394496 KB Output is correct
20 Correct 283 ms 394572 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 278 ms 394580 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 409 ms 394832 KB Output is correct
2 Correct 439 ms 394844 KB Output is correct
3 Correct 410 ms 394764 KB Output is correct
4 Correct 410 ms 394664 KB Output is correct
5 Incorrect 284 ms 394904 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 394648 KB Output is correct
2 Correct 275 ms 394644 KB Output is correct
3 Correct 274 ms 394676 KB Output is correct
4 Correct 287 ms 394812 KB Output is correct
5 Correct 275 ms 394504 KB Output is correct
6 Correct 278 ms 394552 KB Output is correct
7 Correct 283 ms 394576 KB Output is correct
8 Correct 277 ms 394616 KB Output is correct
9 Correct 280 ms 394412 KB Output is correct
10 Correct 275 ms 394576 KB Output is correct
11 Correct 275 ms 394732 KB Output is correct
12 Correct 274 ms 394580 KB Output is correct
13 Correct 287 ms 394712 KB Output is correct
14 Correct 277 ms 394472 KB Output is correct
15 Correct 278 ms 394508 KB Output is correct
16 Correct 274 ms 394908 KB Output is correct
17 Correct 277 ms 394580 KB Output is correct
18 Correct 276 ms 394748 KB Output is correct
19 Correct 275 ms 394496 KB Output is correct
20 Correct 283 ms 394572 KB Output is correct
21 Incorrect 278 ms 394580 KB Output isn't correct
22 Halted 0 ms 0 KB -