oj.uz

답안 #343820

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
343820 2021-01-04T14:10:39 Z Tosic "The Lyuboyn" code (IZhO19_lyuboyn) C++14
33 / 100
 1000 ms 23520 KB 
#include <bits/stdc++.h>
#define maxn 400010
using namespace std;

int n, k, t, ans;
vector<int> curR,masks;
bool was[maxn];

int bD(int a, int b){
	return __builtin_popcount(a^b)==k;
}


void printR(){
cout << (1<<n) << '\n';
	for(auto i : curR){
		bitset<32> tmp = i;
		//cout << tmp;
		for(int j = n-1; j >= 0; --j){
			cout << tmp[j];
		}
		cout << '\n';
	}
	exit(0);
}

void getR(int x){
	if(x == (1<<n)){
		if(t == 1 and bD(curR[0],curR.back())){
			printR();
		}
		if(!t and !bD(curR[0],curR.back())){
			printR();
		}
		return;
	}
	if(was[curR.back()]){
		return;
	}
	was[curR.back()] = 1;
	for(auto i : masks){
		curR.push_back(curR.back()^i);
		getR(x+1);
		curR.pop_back();
	}
	was[curR.back()] = 0;
}

int main(){
	ios_base::sync_with_stdio(0);
	cout.tie(0);
	cin.tie(0);
	string s;
	cin >> n >> k >> t >> s;
	int res = 0;
	for(int i =0 ; i < s.length(); ++i){
		res *= 2;
		res += (s[i]-'0');
	}
	for(int i = 0; i < (1<<n); ++i){
		if(bD(0, i)){
			masks.push_back(i);
		}
	}
	curR.push_back(res);
	getR(1);
	cout << -1;
}

Compilation message

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:56:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |  for(int i =0 ; i < s.length(); ++i){
      |                 ~~^~~~~~~~~~~~

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Ok

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Ok

Subtask #3
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1093 ms 620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 23144 KB Ok
2 Correct 145 ms 11756 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
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB The values in the output sequence are not pairwise distinct!
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 304 ms 23340 KB The values in the output sequence are not pairwise distinct!
2 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 303 ms 23144 KB Ok
2 Correct 145 ms 11756 KB Ok
3 Correct 1 ms 364 KB Ok
4 Correct 1 ms 364 KB Ok
5 Correct 1 ms 364 KB Ok
6 Incorrect 1 ms 364 KB The values in the output sequence are not pairwise distinct!
7 Halted 0 ms 0 KB -

Subtask #8
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 144 ms 11756 KB Ok
2 Correct 315 ms 23272 KB Ok
3 Correct 308 ms 23520 KB Ok
4 Correct 16 ms 1772 KB Ok
5 Correct 1 ms 364 KB Ok
6 Correct 32 ms 3180 KB Ok
7 Correct 306 ms 23264 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 69 ms 6000 KB Ok
12 Correct 143 ms 11768 KB Ok