Submission #343088

#	Time	Username	Problem	Language	Result	Execution time	Memory
343088		IZhO_2021_I_want_Silver	"The Lyuboyn" code (IZhO19_lyuboyn)	C++14	Compilation error	0 ms	0 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 = 2e5 + 5;
const int oo = 1e9 + 5;
 
int n, k, t;
string s;
bitset <N> was;
 
void show_bits(int x) {
    for (int i = 0; i < n; ++i) {
        if (x & (1 << i)) { cout << 1; }
        else { cout << 0; }
    }
    cout << "\n";
}
 
int g(int x) {
    return x ^ (x >> 1);
}
 
void solve() {
    cin >> n >> k >> t;
    cin >> s;
 
    cout << (1 << n) <<"\n";
 
    for (int i = 0; i < (1 << n); ++i) {
        show_bits(g(i));
    }
    return;
 
    int x = 0;
    for (int i = 0; i < n; ++i) {
        if (s[i] == '1') { x += (1 << i); }
    }
    was[x] = 1; show_bits(x);
 
    int st_pos = 0;
    for (int i = 1; i < (1 << n); ++i) {
        while (was[x]) {
            int pos = st_pos;
            for (int cnt = 0; cnt < k; ++cnt) {
                x ^= (1 << pos);
                ++pos; if (pos == n) { pos = 0; }
            }
            ++st_pos; if (st_pos == n) { st_pos = 0; }
        }
 
        was[x] = 1; show_bits(x);
    }
}
 
 main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tests = 1;
	//cin >> tests;
	while (tests --) {
		solve();
	}
	return 0;
}
/*
    Just Chalish!
*/#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 = 2e5 + 5;
const int oo = 1e9 + 5;
 
int n, k, t;
string s;
bitset <N> was;
 
void show_bits(int x) {
    for (int i = 0; i < n; ++i) {
        if (x & (1 << i)) { cout << 1; }
        else { cout << 0; }
    }
    cout << "\n";
}
 
int g(int x) {
    return x ^ (x >> 1);
}
 
void solve() {
    cin >> n >> k >> t;
    cin >> s;
 
  	if (k % 2 == 0) { cout << -1; return; }
  
    cout << (1 << n) <<"\n";
 
    for (int i = 0; i < (1 << n); ++i) {
        show_bits(g(i));
    }
    return;
 
    int x = 0;
    for (int i = 0; i < n; ++i) {
        if (s[i] == '1') { x += (1 << i); }
    }
    was[x] = 1; show_bits(x);
 
    int st_pos = 0;
    for (int i = 1; i < (1 << n); ++i) {
        while (was[x]) {
            int pos = st_pos;
            for (int cnt = 0; cnt < k; ++cnt) {
                x ^= (1 << pos);
                ++pos; if (pos == n) { pos = 0; }
            }
            ++st_pos; if (st_pos == n) { st_pos = 0; }
        }
 
        was[x] = 1; show_bits(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 (stderr)

lyuboyn.cpp:89:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   89 |  main () {
      |        ^
lyuboyn.cpp:138:11: error: redefinition of 'const int N'
  138 | const int N = 2e5 + 5;
      |           ^
lyuboyn.cpp:38:11: note: 'const int N' previously defined here
   38 | const int N = 2e5 + 5;
      |           ^
lyuboyn.cpp:139:11: error: redefinition of 'const int oo'
  139 | const int oo = 1e9 + 5;
      |           ^~
lyuboyn.cpp:39:11: note: 'const int oo' previously defined here
   39 | const int oo = 1e9 + 5;
      |           ^~
lyuboyn.cpp:141:5: error: redefinition of 'int n'
  141 | int n, k, t;
      |     ^
lyuboyn.cpp:41:5: note: 'int n' previously declared here
   41 | int n, k, t;
      |     ^
lyuboyn.cpp:141:8: error: redefinition of 'int k'
  141 | int n, k, t;
      |        ^
lyuboyn.cpp:41:8: note: 'int k' previously declared here
   41 | int n, k, t;
      |        ^
lyuboyn.cpp:141:11: error: redefinition of 'int t'
  141 | int n, k, t;
      |           ^
lyuboyn.cpp:41:11: note: 'int t' previously declared here
   41 | int n, k, t;
      |           ^
lyuboyn.cpp:142:8: error: redefinition of 'std::string s'
  142 | string s;
      |        ^
lyuboyn.cpp:42:8: note: 'std::string s' previously declared here
   42 | string s;
      |        ^
lyuboyn.cpp:143:12: error: redefinition of 'std::bitset<200005> was'
  143 | bitset <N> was;
      |            ^~~
lyuboyn.cpp:43:12: note: 'std::bitset<200005> was' previously defined here
   43 | bitset <N> was;
      |            ^~~
lyuboyn.cpp:145:6: error: redefinition of 'void show_bits(int)'
  145 | void show_bits(int x) {
      |      ^~~~~~~~~
lyuboyn.cpp:45:6: note: 'void show_bits(int)' previously defined here
   45 | void show_bits(int x) {
      |      ^~~~~~~~~
lyuboyn.cpp:153:5: error: redefinition of 'int g(int)'
  153 | int g(int x) {
      |     ^
lyuboyn.cpp:53:5: note: 'int g(int)' previously defined here
   53 | int g(int x) {
      |     ^
lyuboyn.cpp:157:6: error: redefinition of 'void solve()'
  157 | void solve() {
      |      ^~~~~
lyuboyn.cpp:57:6: note: 'void solve()' previously defined here
   57 | void solve() {
      |      ^~~~~
lyuboyn.cpp:191:8: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  191 |  main () {
      |        ^
lyuboyn.cpp:191:2: error: redefinition of 'int main()'
  191 |  main () {
      |  ^~~~
lyuboyn.cpp:89:2: note: 'int main()' previously defined here
   89 |  main () {
      |  ^~~~