oj.uz

답안 #146201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146201 2019-08-22T19:46:06 Z imeimi2000 "The Lyuboyn" code (IZhO19_lyuboyn) C++17
3 / 100
 139 ms 5368 KB 
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

char _S[20];
int B[1 << 18];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, k, t;
    cin >> n >> k >> t >> _S;
    if (k + 1 & 1) {
        cout << "-1\n";
        return 0;
    }
    int S = 0;
    for (int i = 0; i < n; ++i) S = S << 1 | _S[i] - '0';
    for (int i = 0; i <= k; ++i)
        B[1 << i] = (1 << k + 1) - (1 << i) - 1;
    for (int i = k + 1; i < n; ++i)
        B[1 << i] = (1 << k - 1) + (1 << i) - 1;
    cout << (1 << n);
    for (int i = 0; i < (1 << n); ++i) {
        S ^= B[i & -i];
        for (int j = n; j--; ) cout << (char)(((S >> j) & 1) + '0');
        cout << '\n';
    }
    return 0;
}

Compilation message

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:13:11: warning: suggest parentheses around '+' in operand of '&' [-Wparentheses]
     if (k + 1 & 1) {
         ~~^~~
lyuboyn.cpp:18:52: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
     for (int i = 0; i < n; ++i) S = S << 1 | _S[i] - '0';
                                              ~~~~~~^~~~~
lyuboyn.cpp:20:29: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
         B[1 << i] = (1 << k + 1) - (1 << i) - 1;
                           ~~^~~
lyuboyn.cpp:22:29: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
         B[1 << i] = (1 << k - 1) + (1 << i) - 1;
                           ~~^~~

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB The output is neither -1 nor the length of the answer

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB The output is neither -1 nor the length of the answer

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Ok
2 Correct 2 ms 376 KB Ok
3 Correct 2 ms 380 KB Ok
4 Correct 2 ms 376 KB Ok
5 Correct 2 ms 380 KB Ok
6 Correct 2 ms 376 KB Ok
7 Correct 2 ms 376 KB Ok
8 Correct 2 ms 376 KB Ok

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 139 ms 5368 KB Expected integer, but "262144000000000000000000" found
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB The output is neither -1 nor the length of the answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 139 ms 5368 KB Expected integer, but "262144010101010011010100" found
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 139 ms 5368 KB Expected integer, but "262144000000000000000000" found
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 67 ms 2768 KB Expected integer, but "13107201011001010101101" found
2 Halted 0 ms 0 KB -