Submission #5462845


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int nth_bit(int64_t num, int n){
    return (num >> n) & 1;
}

int main(){
    int M, K;
    cin >> M >> K;
    if(M == 1){
        if(K == 0){
            cout << "0 0 1 1" << endl;
        }else{
            cout << -1 << endl;
        }
        return 0;
    }
    int MX = 1<<M;
    if(K >= MX){
        cout << -1 << endl;
        return 0;
    }
    vector<int> ans;
    for(int i=0; i<MX; i++) if(i != K) ans.push_back(i);
    ans.push_back(K);
    for(int i=MX-1; i>=0; i--) if(i != K) ans.push_back(i);
    ans.push_back(K);
    for(int i=0; i<2*MX; i++) cout << ans[i] << " \n"[i==2*MX-1];
    return 0;
}

Submission Info

Submission Time
Task F - XOR Matching
User betrue12
Language C++14 (GCC 5.4.1)
Score 600
Code Size 694 Byte
Status AC
Exec Time 26 ms
Memory 2932 KiB

Judge Result

Set Name All Sample
Score / Max Score 600 / 600 0 / 0
Status
AC × 43
AC × 3
Set Name Test Cases
All sample_01, sample_02, sample_03, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18, testcase_19, testcase_20, testcase_21, testcase_22, testcase_23, testcase_24, testcase_25, testcase_26, testcase_27, testcase_28, testcase_29, testcase_30, testcase_31, testcase_32, testcase_33, testcase_34, testcase_35, testcase_36, testcase_37, testcase_38, testcase_39, testcase_40
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
sample_01 AC 1 ms 256 KiB
sample_02 AC 1 ms 256 KiB
sample_03 AC 1 ms 256 KiB
testcase_01 AC 1 ms 256 KiB
testcase_02 AC 1 ms 256 KiB
testcase_03 AC 1 ms 256 KiB
testcase_04 AC 1 ms 256 KiB
testcase_05 AC 1 ms 256 KiB
testcase_06 AC 26 ms 2932 KiB
testcase_07 AC 26 ms 2932 KiB
testcase_08 AC 26 ms 2932 KiB
testcase_09 AC 26 ms 2932 KiB
testcase_10 AC 26 ms 2932 KiB
testcase_11 AC 26 ms 2932 KiB
testcase_12 AC 26 ms 2932 KiB
testcase_13 AC 26 ms 2932 KiB
testcase_14 AC 1 ms 256 KiB
testcase_15 AC 1 ms 256 KiB
testcase_16 AC 1 ms 256 KiB
testcase_17 AC 1 ms 256 KiB
testcase_18 AC 1 ms 256 KiB
testcase_19 AC 1 ms 256 KiB
testcase_20 AC 1 ms 256 KiB
testcase_21 AC 1 ms 256 KiB
testcase_22 AC 1 ms 256 KiB
testcase_23 AC 1 ms 256 KiB
testcase_24 AC 1 ms 256 KiB
testcase_25 AC 1 ms 256 KiB
testcase_26 AC 3 ms 512 KiB
testcase_27 AC 1 ms 256 KiB
testcase_28 AC 2 ms 256 KiB
testcase_29 AC 2 ms 256 KiB
testcase_30 AC 1 ms 256 KiB
testcase_31 AC 1 ms 256 KiB
testcase_32 AC 2 ms 256 KiB
testcase_33 AC 1 ms 256 KiB
testcase_34 AC 7 ms 1020 KiB
testcase_35 AC 1 ms 256 KiB
testcase_36 AC 1 ms 256 KiB
testcase_37 AC 1 ms 256 KiB
testcase_38 AC 1 ms 256 KiB
testcase_39 AC 1 ms 256 KiB
testcase_40 AC 1 ms 256 KiB