oj.uz

Submission #343189

# Submission time Handle Problem Language Result Execution time Memory
343189 2021-01-03T13:31:15 Z IZhO_2021_I_want_Silver "The Lyuboyn" code (IZhO19_lyuboyn) C++14
8 / 100
 1000 ms 3564 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <iomanip>
#include <cassert>
#include <stack>
#include <queue>
#include <bitset>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>-

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

// template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//  order_of_key (k) : Number of items strictly smaller than k .
//  find_by_order(k) : K-th element in a set (counting from zero).
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define pb push_back
#define ppb pop_back
#define mkp make_pair
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define show(a) cerr << #a <<" -> "<< a <<" "
#define nl cerr <<"\n"
//#define int ll

const int N = 3e5 + 5;
const int oo = 1e9 + 5;

int n, k, t, x, pre[N];
bitset <N> was;
vector <int> ans;
string s;

void show_bits(int x) {
    for (int i = 0; i < n; ++i) {
        if (x & (1 << i)) { cout << 1; }
        else { cout << 0; }
    }
    cout << "\n";
}

void go(int pos, int last) {
    if (pos == (1 << n) + 1) {
        while (pre[last]) {
            ans.pb(last);
            last = pre[last];
        }
        ans.pb(last);
        ans.pb(x);
        reverse(all(ans));

        cout << sz(ans) <<"\n";
        for (int i = 0; i < sz(ans); ++i) { show_bits(ans[i]); }
        exit(0);
    }
    for (int i = 0; i < (1 << n); ++i) {
        if (was[i]) { continue; }
        if (__builtin_popcount((last ^ i)) != k) { continue; }

        was[i] = 1; pre[i] = last;
        go(pos + 1, i);
        was[i] = 0; pre[i] = 0;
    }
}

void solve() {
    cin >> n >> k >> t;
    cin >> s;
    if (k % 2 == 0) { cout << -1; return; }
    x = 0;
    for (int i = 0; i < n; ++i) {
        if (s[i] == '1') { x += (1 << i); }
    }
    was[x] = 1;
    pre[x] = 0;
    go(2, x);
}

 main () {
	//ios_base::sync_with_stdio(false);
	//cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/

Compilation message

lyuboyn.cpp:91:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   91 |  main () {
      |        ^

Subtask #1
0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB The output is neither -1 nor the length of the answer

Subtask #2
5.0 / 5.0

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

Subtask #3
3.0 / 3.0

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

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 3352 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Ok
2 Correct 62 ms 1260 KB Ok
3 Execution timed out 1089 ms 3564 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1057 ms 3564 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 3352 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 1516 KB Time limit exceeded
2 Halted 0 ms 0 KB -