제출 #343235

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
343235		IZhO_2021_I_want_Silver	"The Lyuboyn" code (IZhO19_lyuboyn)	C++14	100 / 100	372 ms	35408 KiB

lyuboyn

#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;
bitset <N> was;
vector <int> vec, good;
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) {
    if (pos == (1 << n) + 1) {
        if (t == 1) {
            if (__builtin_popcount(vec[0] ^ vec.back()) == k) {
                cout << sz(vec) <<"\n";
                for (int i = 0; i < sz(vec); ++i) {
                    show_bits(vec[i]);
                }
                exit(0);
            }
        }
        else {
            cout << sz(vec) <<"\n";
            for (int i = 0; i < sz(vec); ++i) {
                show_bits(vec[i]);
            }
            exit(0);
        }
        return;
    }
    for (int i = 0; i < sz(good); ++i) {
        int x = (vec.back() ^ good[i]);
        if (was[x]) { continue; }
        if (__builtin_popcount((vec.back() ^ x)) != k) { continue; }

        was[x] = 1;
        vec.pb(x);
        go(pos + 1);
        was[x] = 0;
        vec.ppb();
    }
}

void solve() {
    cin >> n >> k >> t;
    cin >> s;

    if (k % 2 == 0) { cout << -1; return; }

    for (int i = 0; i < (1 << n); ++i) {
        if (__builtin_popcount(i) == k) { good.pb(i); }
    }

    int x = 0;
    for (int i = 0; i < n; ++i) {
        if (s[i] == '1') { x += (1 << i); }
    }
    was[x] = 1;
    vec.pb(x);
    go(2);
}

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

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 0 / 0
• Subtask 2: 5 / 5
• Subtask 3: 3 / 3
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 18 / 18
• Subtask 7: 31 / 31
• Subtask 8: 17 / 17