oj.uz

Submission #469561

# Submission time Handle Problem Language Result Execution time Memory
469561 2021-09-01T10:54:04 Z FatihSolak Rack (eJOI19_rack) C++17
40 / 100
 1000 ms 448 KB 
#include <bits/stdc++.h>
#define N 1000005
#define int long long
using namespace std;
const int mod = 1e9+7;
int pw(int b){
    int ret = 1;
    for(int i=0;i<b;i++){
        ret = min((int)2e18,ret*2);
    }
    return ret;
}
int pw2(int b){
    int ret = 1;
    for(int i=0;i<b;i++){
        ret = ret*2%mod;
    }
    return ret;
}
int get(int n,int k){
    if(n == 0)return 1;
    int ret = 0;
    if(k > pw(n-1)){
        ret = 1;
        k -= pw(n-1);
    }
    return (2*get(n-1,k) -1 +ret+mod)%mod;
}
void solve(){
    int n,k;
    cin >> n >> k;
    cout << get(n,k);
}

int32_t main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
    #ifdef Local
    cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 24 ms 340 KB Output is correct
14 Execution timed out 1088 ms 448 KB Time limit exceeded
15 Halted 0 ms 0 KB -