oj.uz

답안 #581008

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
581008 2022-06-22T08:14:30 Z pakapu Rack (eJOI19_rack) C++14
40 / 100
 3 ms 1364 KB 
#include <iostream>
#include <vector>
#include <numeric>
#include <algorithm>
#include <queue>
#include <bitset>
#include <math.h>

using namespace std;

const int MOD = 1e9 + 7;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, k;
    cin >> n >> k;

    string s = bitset<1000001>(k - 1).to_string();

    reverse(s.begin(), s.end());

    long long pos = 1;
    for(int i = 0; i < n; i++) {
        if(s[i] == '1') {
            pos = (pos * 2) % MOD;
        }
        else {
            pos = (pos * 2 - 1) % MOD;
        }
    }

    cout << pos;


    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1364 KB Output is correct
2 Correct 3 ms 1364 KB Output is correct
3 Correct 2 ms 1364 KB Output is correct
4 Correct 2 ms 1364 KB Output is correct
5 Correct 2 ms 1336 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1364 KB Output is correct
2 Correct 3 ms 1364 KB Output is correct
3 Correct 2 ms 1364 KB Output is correct
4 Correct 2 ms 1364 KB Output is correct
5 Correct 2 ms 1336 KB Output is correct
6 Correct 2 ms 1364 KB Output is correct
7 Correct 3 ms 1364 KB Output is correct
8 Correct 3 ms 1364 KB Output is correct
9 Correct 3 ms 1364 KB Output is correct
10 Correct 3 ms 1364 KB Output is correct

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1364 KB Output is correct
2 Correct 3 ms 1364 KB Output is correct
3 Correct 2 ms 1364 KB Output is correct
4 Correct 2 ms 1364 KB Output is correct
5 Correct 2 ms 1336 KB Output is correct
6 Correct 2 ms 1364 KB Output is correct
7 Correct 3 ms 1364 KB Output is correct
8 Correct 3 ms 1364 KB Output is correct
9 Correct 3 ms 1364 KB Output is correct
10 Correct 3 ms 1364 KB Output is correct
11 Correct 2 ms 1364 KB Output is correct
12 Incorrect 2 ms 1364 KB Output isn't correct
13 Halted 0 ms 0 KB -