oj.uz

Submission #336552

# Submission time Handle Problem Language Result Execution time Memory
336552 2020-12-15T15:37:02 Z amunduzbaev "The Lyuboyn" code (IZhO19_lyuboyn) C++14
69 / 100
 1000 ms 27724 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;
 
string bin(int a){
	string s;
	while(a){
		s.pb(char((a%2) + '0'));
		a/=2;
	}
	
	while(sz(s) < n) s.pb('0');
	reverse(all(s));
	return s;
}

int main(){
	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++)
		if(s[i] == '1') a += (1<<i);
	
	vector<int>ans = {0, 1};
	int mx = (1<<(k+1)) - 1;
	while(sz(ans) < (1<<(k+1))){
		int add = sz(ans), size = sz(ans);
		for(int i = size-1; i>=0; i--)
			ans.pb(ans[i] + add);
	}
	for(int i=0;i<sz(ans);i++)
		if(i % 2 == 0) ans[i] ^= mx;
	mx = (1<<(k-1)) -1;
	//cout<<(1<<(k-1))<<"\n";
	while(sz(ans) < (1<<n)){
		int add = sz(ans), size = sz(ans);
		for(int i = size-1; i>=0; i--)
			ans.pb(ans[i] + add);
		//for(int i=0;i<sz(ans);i++) cout<<bin(ans[i])<<"\n"; 
		for(int i = size; i < sz(ans); i++){
			ans[i] ^= mx;
		}
	}
	int start = 0;
	for(int i=0;i<(1<<n);i++){
		if(ans[i] == a) start = i;
	}
	cout<<(1<<n)<<"\n";
	int size = (1<<n);
	for(int i=start+1;i != start;i++){
		if(i == size+1) i = 1;
		cout<<bin(ans[i-1])<<"\n";
	}
	cout<<bin(ans[start-1])<<"\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 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 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 0 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 77 ms 6496 KB Ok
2 Correct 37 ms 3320 KB Ok
3 Correct 1 ms 364 KB Ok
4 Correct 1 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 0 ms 364 KB Ok
2 Correct 2 ms 492 KB Ok
3 Correct 37 ms 3300 KB Ok
4 Correct 18 ms 1768 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 1 ms 364 KB Ok
7 Correct 8 ms 1132 KB Ok
8 Correct 1 ms 364 KB Ok

Subtask #6
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 76 ms 6496 KB Ok
2 Correct 77 ms 6496 KB Ok
3 Correct 75 ms 6624 KB Ok
4 Correct 43 ms 3300 KB Ok
5 Correct 36 ms 3300 KB Ok
6 Correct 24 ms 1768 KB Ok
7 Correct 18 ms 1768 KB Ok
8 Correct 8 ms 1132 KB Ok
9 Correct 8 ms 1132 KB Ok
10 Correct 4 ms 620 KB Ok
11 Correct 1 ms 364 KB Ok
12 Correct 1 ms 364 KB Ok
13 Correct 0 ms 364 KB Ok

Subtask #7
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 6496 KB Ok
2 Correct 37 ms 3320 KB Ok
3 Correct 1 ms 364 KB Ok
4 Correct 1 ms 364 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 0 ms 364 KB Ok
7 Correct 2 ms 492 KB Ok
8 Correct 37 ms 3300 KB Ok
9 Correct 18 ms 1768 KB Ok
10 Correct 1 ms 364 KB Ok
11 Correct 1 ms 364 KB Ok
12 Correct 8 ms 1132 KB Ok
13 Correct 1 ms 364 KB Ok
14 Correct 76 ms 6496 KB Ok
15 Correct 77 ms 6496 KB Ok
16 Correct 75 ms 6624 KB Ok
17 Correct 43 ms 3300 KB Ok
18 Correct 36 ms 3300 KB Ok
19 Correct 24 ms 1768 KB Ok
20 Correct 18 ms 1768 KB Ok
21 Correct 8 ms 1132 KB Ok
22 Correct 8 ms 1132 KB Ok
23 Correct 4 ms 620 KB Ok
24 Correct 1 ms 364 KB Ok
25 Correct 1 ms 364 KB Ok
26 Correct 0 ms 364 KB Ok
27 Correct 75 ms 6496 KB Ok
28 Correct 37 ms 3428 KB Ok
29 Correct 76 ms 6496 KB Ok
30 Correct 4 ms 620 KB Ok
31 Correct 1 ms 364 KB Ok
32 Correct 2 ms 492 KB Ok
33 Correct 8 ms 1132 KB Ok
34 Correct 1 ms 364 KB Ok
35 Correct 0 ms 364 KB Ok
36 Correct 1 ms 364 KB Ok
37 Execution timed out 1093 ms 27724 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 3300 KB Ok
2 Correct 77 ms 6504 KB Ok
3 Correct 75 ms 6496 KB Ok
4 Correct 4 ms 620 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 8 ms 1132 KB Ok
7 Correct 76 ms 6496 KB Ok
8 Correct 1 ms 364 KB Ok
9 Correct 0 ms 364 KB Ok
10 Correct 1 ms 364 KB Ok
11 Correct 18 ms 1768 KB Ok
12 Correct 37 ms 3300 KB Ok