# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
232179 |
2020-05-16T10:38:24 Z |
PanTkd |
Rack (eJOI19_rack) |
C++14 |
|
15 ms |
8192 KB |
//
// main.cpp
// Hanging Rack
//
// Created by Panagiotis Hadjicostas on 16/05/2020.
// Copyright © 2020 Panagiotis Hadjicostas. All rights reserved.
//
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
#define MOD ll(1e9+7)
ll din[1000006];
ll reverse(ll num,ll n)
{
ll b=0;
for (ll i = 0; i <= n-1; i++){
if((din[i]&num)==din[i]){
b+=(din[n-i-1]);
if(b>MOD){
b-=MOD;
}
//b%=MOD;
}
}
return b;
}
int main() {
ll n,k;cin>>n>>k;
din[0]=1;
for(ll i=1;i<1000006;i++){
din[i]=(din[i-1]*2)%MOD;
}
cout<<(reverse(k-1, n)+1)%MOD<<endl;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
8192 KB |
Output is correct |
2 |
Correct |
12 ms |
8192 KB |
Output is correct |
3 |
Correct |
12 ms |
8192 KB |
Output is correct |
4 |
Correct |
12 ms |
8192 KB |
Output is correct |
5 |
Correct |
12 ms |
8192 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
8192 KB |
Output is correct |
2 |
Correct |
12 ms |
8192 KB |
Output is correct |
3 |
Correct |
12 ms |
8192 KB |
Output is correct |
4 |
Correct |
12 ms |
8192 KB |
Output is correct |
5 |
Correct |
12 ms |
8192 KB |
Output is correct |
6 |
Correct |
12 ms |
8192 KB |
Output is correct |
7 |
Correct |
12 ms |
8156 KB |
Output is correct |
8 |
Correct |
15 ms |
8192 KB |
Output is correct |
9 |
Correct |
12 ms |
8192 KB |
Output is correct |
10 |
Correct |
12 ms |
8192 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
8192 KB |
Output is correct |
2 |
Correct |
12 ms |
8192 KB |
Output is correct |
3 |
Correct |
12 ms |
8192 KB |
Output is correct |
4 |
Correct |
12 ms |
8192 KB |
Output is correct |
5 |
Correct |
12 ms |
8192 KB |
Output is correct |
6 |
Correct |
12 ms |
8192 KB |
Output is correct |
7 |
Correct |
12 ms |
8156 KB |
Output is correct |
8 |
Correct |
15 ms |
8192 KB |
Output is correct |
9 |
Correct |
12 ms |
8192 KB |
Output is correct |
10 |
Correct |
12 ms |
8192 KB |
Output is correct |
11 |
Correct |
12 ms |
8192 KB |
Output is correct |
12 |
Incorrect |
12 ms |
8192 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |