oj.uz

Submission #336686

# Submission time Handle Problem Language Result Execution time Memory
336686 2020-12-16T12:13:57 Z tengiz05 "The Lyuboyn" code (IZhO19_lyuboyn) C++17
69 / 100
 170 ms 6508 KB 
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
//#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long 
#define ld long double 
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define prc(n) fixed << setprecision(n)
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pi acos(-1);
const int inf = 1e9+7;
const int N = 105;
 
int n, k, t, a, cnt;
 
void bin(int a){
	
	for(int i = n-1; i >=0 ;i--)
		cout << (a&(1<<i) ? "1" : "0");
	cout << '\n';
}
 
int main(){
	fastios 
	cin>>n>>k>>t;
	if(k%2 == 0){
		cout<<-1;
		return 0;
	}
	string s;
	cin>>s;
	reverse(all(s));
	for(int i=0;i<sz(s);i++, cnt++)
		if(s[i] == '1') a += (1<<i);
	
	vector<int>ans;
	ans.reserve(1<<22);
	ans.pb(0);
	ans.pb(1);
	
	int mx = (1<<(k+1)) - 1;
	while(sz(ans) < (1<<(k+1))){
		cnt++;
		int add = sz(ans), size = sz(ans);
		for(int i = size-1; i>=0; i--, cnt++) ans.pb(ans[i] + add);
	}
	
	for(int i=0;i<sz(ans);i++, cnt++) if(i % 2 == 0) ans[i] ^= mx;
	mx = (1<<(k-1)) -1;
	
	while(sz(ans) < (1<<n)){
		cnt++;
		int add = sz(ans), size = sz(ans);
		for(int i = size-1; i>=0; i--, cnt++) ans.pb((ans[i] + add) ^ mx);
	}
	
	int start = 0;
	for(int i=0;i<(1<<n);i++, cnt++) if(ans[i] == a) start = i;
	
	cout << (1<<n) << '\n';
	int size = (1<<n);
	int C = 0;
	for(int i=start+1; i != start; i++){
		if(i == size+1) i = 1;
		bin(ans[i-1]);C++;
		if(C > 1<<n)break;
	}
	bin(ans[start-1]);
	//cout<<cnt<<"\n";
	return 0;
}

Subtask #1
0.0 / 0.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
3.0 / 3.0

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

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 6428 KB Ok
2 Correct 87 ms 3308 KB Ok
3 Correct 1 ms 364 KB Ok
4 Correct 0 ms 364 KB Ok
5 Correct 1 ms 364 KB Ok

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Ok
2 Correct 4 ms 492 KB Ok
3 Correct 78 ms 3308 KB Ok
4 Correct 36 ms 1772 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 1 ms 364 KB Ok
7 Correct 18 ms 1004 KB Ok
8 Correct 1 ms 364 KB Ok

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 162 ms 6400 KB Ok
2 Correct 168 ms 6412 KB Ok
3 Correct 170 ms 6508 KB Ok
4 Correct 79 ms 3180 KB Ok
5 Correct 77 ms 3180 KB Ok
6 Correct 37 ms 1772 KB Ok
7 Correct 36 ms 1772 KB Ok
8 Correct 17 ms 1004 KB Ok
9 Correct 17 ms 1004 KB Ok
10 Correct 9 ms 620 KB Ok
11 Correct 1 ms 364 KB Ok
12 Correct 1 ms 364 KB Ok
13 Correct 1 ms 364 KB Ok

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 165 ms 6428 KB Ok
2 Correct 87 ms 3308 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 1 ms 364 KB Ok
7 Correct 4 ms 492 KB Ok
8 Correct 78 ms 3308 KB Ok
9 Correct 36 ms 1772 KB Ok
10 Correct 1 ms 364 KB Ok
11 Correct 1 ms 364 KB Ok
12 Correct 18 ms 1004 KB Ok
13 Correct 1 ms 364 KB Ok
14 Correct 162 ms 6400 KB Ok
15 Correct 168 ms 6412 KB Ok
16 Correct 170 ms 6508 KB Ok
17 Correct 79 ms 3180 KB Ok
18 Correct 77 ms 3180 KB Ok
19 Correct 37 ms 1772 KB Ok
20 Correct 36 ms 1772 KB Ok
21 Correct 17 ms 1004 KB Ok
22 Correct 17 ms 1004 KB Ok
23 Correct 9 ms 620 KB Ok
24 Correct 1 ms 364 KB Ok
25 Correct 1 ms 364 KB Ok
26 Correct 1 ms 364 KB Ok
27 Correct 162 ms 6380 KB Ok
28 Correct 77 ms 3180 KB Ok
29 Correct 161 ms 6380 KB Ok
30 Correct 9 ms 620 KB Ok
31 Correct 1 ms 364 KB Ok
32 Correct 4 ms 492 KB Ok
33 Correct 19 ms 1004 KB Ok
34 Correct 1 ms 364 KB Ok
35 Correct 1 ms 364 KB Ok
36 Correct 1 ms 364 KB Ok
37 Incorrect 0 ms 364 KB More lines are printed!
38 Halted 0 ms 0 KB -

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 3180 KB Ok
2 Correct 163 ms 6508 KB Ok
3 Correct 168 ms 6436 KB Ok
4 Correct 8 ms 620 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 17 ms 1004 KB Ok
7 Correct 162 ms 6380 KB Ok
8 Correct 1 ms 364 KB Ok
9 Correct 1 ms 364 KB Ok
10 Correct 1 ms 364 KB Ok
11 Correct 37 ms 1772 KB Ok
12 Correct 81 ms 3180 KB Ok