oj.uz

답안 #392999

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
392999 2021-04-22T13:55:43 Z patrikpavic2 "The Lyuboyn" code (IZhO19_lyuboyn) C++17
19 / 100
 330 ms 5292 KB 
#include <cstdio>

using namespace std;

const int N = 20;

int n, k, bla, bs[N];

int main(){
	scanf("%d%d%d", &n, &k, &bla);
	int poc = 0;
	for(int i = 0;i < n;i++){
		char c; scanf(" %c", &c);
		poc += (c & 1) << i;
	}
	if(!(k & 1)){
		printf("-1\n");
		return 0;
	}
	for(int i = 0;i < n;i++){
		for(int j = 0;j < k;j++)
			bs[i] += 1 << ((i + j) % n);
	}
	printf("%d\n", (1 << n));
	for(int i = 0;i < (1 << n);i++){
		int cur = poc;
		for(int j = 0;j < n;j++)
			if((i ^ (i >> 1)) & (1 << j))
				cur ^= bs[j];
		for(int j = 0;j < n;j++)
			printf("%c", 48 + ((cur >> j) & 1));
		printf("\n");
	}
	return 0;
}

Compilation message

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:10:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |  scanf("%d%d%d", &n, &k, &bla);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
lyuboyn.cpp:13:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 |   char c; scanf(" %c", &c);
      |           ~~~~~^~~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 1 ms 204 KB Ok
3 Correct 0 ms 204 KB Ok
4 Correct 1 ms 204 KB Ok
5 Correct 1 ms 204 KB Ok
6 Correct 0 ms 204 KB Ok
7 Correct 0 ms 204 KB Ok
8 Correct 0 ms 204 KB Ok

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 326 ms 5180 KB Ok
2 Correct 145 ms 2616 KB Ok
3 Correct 1 ms 284 KB Ok
4 Correct 1 ms 204 KB Ok
5 Correct 1 ms 204 KB Ok

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Ok
2 Correct 8 ms 272 KB Ok
3 Correct 156 ms 2564 KB Ok
4 Correct 73 ms 1348 KB Ok
5 Incorrect 1 ms 204 KB The values in the output sequence are not pairwise distinct!
6 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 306 ms 5252 KB Ok
2 Correct 330 ms 5256 KB Ok
3 Incorrect 321 ms 5276 KB The values in the output sequence are not pairwise distinct!
4 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 326 ms 5180 KB Ok
2 Correct 145 ms 2616 KB Ok
3 Correct 1 ms 284 KB Ok
4 Correct 1 ms 204 KB Ok
5 Correct 1 ms 204 KB Ok
6 Correct 1 ms 204 KB Ok
7 Correct 8 ms 272 KB Ok
8 Correct 156 ms 2564 KB Ok
9 Correct 73 ms 1348 KB Ok
10 Incorrect 1 ms 204 KB The values in the output sequence are not pairwise distinct!
11 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 153 ms 2680 KB Ok
2 Correct 304 ms 5268 KB Ok
3 Correct 318 ms 5292 KB Ok
4 Correct 16 ms 460 KB Ok
5 Correct 1 ms 204 KB Ok
6 Correct 35 ms 808 KB Ok
7 Correct 305 ms 5156 KB Ok
8 Incorrect 2 ms 204 KB The values in the output sequence are not pairwise distinct!
9 Halted 0 ms 0 KB -