oj.uz

Submission #399607

# Submission time Handle Problem Language Result Execution time Memory
399607 2021-05-06T09:04:31 Z cadmiumsky Rack (eJOI19_rack) C++14
40 / 100
 9 ms 8128 KB 
#include <iostream>
#define mod 1000000007
#define int long long


using namespace std;

int p2[1000001];

int n;

static int getnum(int poz, int step, int val=0) {
  if(step==n)
    return val;
  int len=p2[n-step-1];
  if(poz>=len) {
    val=(val+p2[step])%mod;
    poz-=len;
  }
  return getnum(poz,step+1,val);
}

signed main() {
  p2[0]=1;
  for(int i=1; i<=1000000; i++)
    p2[i]=((long long)p2[i-1]*2LL)%mod;
  int k;
  cin >> n >> k;
  cout << 1+getnum(k-1,0) <<'\n';
  return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8012 KB Output is correct
2 Correct 8 ms 8072 KB Output is correct
3 Correct 8 ms 8124 KB Output is correct
4 Correct 8 ms 8080 KB Output is correct
5 Correct 9 ms 8012 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8012 KB Output is correct
2 Correct 8 ms 8072 KB Output is correct
3 Correct 8 ms 8124 KB Output is correct
4 Correct 8 ms 8080 KB Output is correct
5 Correct 9 ms 8012 KB Output is correct
6 Correct 8 ms 8012 KB Output is correct
7 Correct 8 ms 8128 KB Output is correct
8 Correct 8 ms 8012 KB Output is correct
9 Correct 8 ms 8012 KB Output is correct
10 Correct 9 ms 8124 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8012 KB Output is correct
2 Correct 8 ms 8072 KB Output is correct
3 Correct 8 ms 8124 KB Output is correct
4 Correct 8 ms 8080 KB Output is correct
5 Correct 9 ms 8012 KB Output is correct
6 Correct 8 ms 8012 KB Output is correct
7 Correct 8 ms 8128 KB Output is correct
8 Correct 8 ms 8012 KB Output is correct
9 Correct 8 ms 8012 KB Output is correct
10 Correct 9 ms 8124 KB Output is correct
11 Incorrect 8 ms 8012 KB Output isn't correct
12 Halted 0 ms 0 KB -