oj.uz

Submission #305709

# Submission time Handle Problem Language Result Execution time Memory
305709 2020-09-23T20:38:43 Z fishy15 "The Lyuboyn" code (IZhO19_lyuboyn) C++14
8 / 100
 329 ms 6684 KB 
#include <iostream>
#include <iomanip>
#include <fstream>
#include <vector>
#include <array>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>

#define ll long long
#define ld long double
#define eps 1e-8
#define MOD 1000000007

#define INF 0x3f3f3f3f
#define INFLL 0x3f3f3f3f3f3f3f3f

// change if necessary
#define MAXN 1000000

using namespace std;

int n, k, t;
string s;
int start;

int main() {
    cin.tie(0)->sync_with_stdio(0);

    cin >> n >> k >> t;
    cin >> s;
    for (int i = 0; i < n; i++) {
        start += (1 << i) * (s[n - i - 1] - '0');
    }

    if (k % 2 == 0 || (n > 1 && k >= n)) {
        cout << "-1\n";
        return 0;
    }

    vector<int> ans = {0, 1};
    for (int i = 1; i < n; i++) {
        int num = 1 << i;
        if (i > k) {
            num += (1 << k) - 1;
        }
        for (int j = (1 << i) - 1; j >= 0; j--) {
            ans.push_back(ans[j] ^ num);
        }
        if (i == k) {
            for (int j = 0; j < (1 << i); j++) {
                ans[2 * j + 1] ^= (1 << (i + 1)) - 1; 
            }
        }
    }

    rotate(ans.begin(), find(ans.begin(), ans.end(), start), ans.end());

    cout << (1 << n) << '\n';
    for (int i : ans) {
        for (int j = n - 1; j >= 0; j--) {
            cout << ((i & (1 << j)) > 0);
        }
        cout << '\n';
    }

    return 0;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Ok

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Ok

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Ok
2 Correct 0 ms 384 KB Ok
3 Correct 1 ms 384 KB Ok
4 Correct 1 ms 384 KB Ok
5 Correct 1 ms 384 KB Ok
6 Correct 1 ms 384 KB Ok
7 Correct 1 ms 384 KB Ok
8 Correct 1 ms 384 KB Ok

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 287 ms 6684 KB Fail, not exactly k bits are different: line = 3
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 KB Fail, not exactly k bits are different: line = 15
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 329 ms 6656 KB Fail, not exactly k bits are different: line = 103
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 287 ms 6684 KB Fail, not exactly k bits are different: line = 3
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 132 ms 3432 KB Fail, not exactly k bits are different: line = 35228
2 Halted 0 ms 0 KB -