# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
634255 | 2022-08-24T08:00:06 Z | antimirage | Rack (eJOI19_rack) | C++14 | 10 ms | 8112 KB |
#include <iostream> #include <algorithm> #include <vector> #include <math.h> #include <set> #include <map> using namespace std; const int N = 1e6 + 5; long long n, k, ans, mod = 1e9 + 7, two[N]; main(){ cin >> n >> k; two[0] = 1; for (int i = 1; i < N; i++) { two[i] = two[i - 1] * 2 % mod; } long long pw = n; for (long long j = 0; j <= n; j++) { if (k <= (1 << j)) { if (j > 0) ans = (ans + two[pw]) % mod; else ans++; k -= (1 << (j - 1)); pw = n; j = -1; } else { pw--; } if (k == 0) break; } cout << ans << endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 8020 KB | Output is correct |
2 | Correct | 8 ms | 8020 KB | Output is correct |
3 | Correct | 8 ms | 8060 KB | Output is correct |
4 | Correct | 10 ms | 8020 KB | Output is correct |
5 | Correct | 8 ms | 8088 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 8020 KB | Output is correct |
2 | Correct | 8 ms | 8020 KB | Output is correct |
3 | Correct | 8 ms | 8060 KB | Output is correct |
4 | Correct | 10 ms | 8020 KB | Output is correct |
5 | Correct | 8 ms | 8088 KB | Output is correct |
6 | Correct | 10 ms | 8072 KB | Output is correct |
7 | Correct | 8 ms | 8084 KB | Output is correct |
8 | Correct | 8 ms | 8020 KB | Output is correct |
9 | Correct | 9 ms | 8020 KB | Output is correct |
10 | Correct | 8 ms | 8020 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 8020 KB | Output is correct |
2 | Correct | 8 ms | 8020 KB | Output is correct |
3 | Correct | 8 ms | 8060 KB | Output is correct |
4 | Correct | 10 ms | 8020 KB | Output is correct |
5 | Correct | 8 ms | 8088 KB | Output is correct |
6 | Correct | 10 ms | 8072 KB | Output is correct |
7 | Correct | 8 ms | 8084 KB | Output is correct |
8 | Correct | 8 ms | 8020 KB | Output is correct |
9 | Correct | 9 ms | 8020 KB | Output is correct |
10 | Correct | 8 ms | 8020 KB | Output is correct |
11 | Correct | 8 ms | 8112 KB | Output is correct |
12 | Incorrect | 9 ms | 8112 KB | Output isn't correct |
13 | Halted | 0 ms | 0 KB | - |