제출 #290905

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290905		Plurm	"The Lyuboyn" code (IZhO19_lyuboyn)	C++11	19 / 100	1095 ms	34296 KiB

lyuboyn

#include <bits/stdc++.h>
using namespace std;
int lsb[300005];
int rmp[300005];
set<string> s;
int main(){
	int n,k,t;
	scanf("%d%d%d",&n,&k,&t);
	if(k % 2 == 0 || k >= n){
		printf("-1\n");
		return 0;
	}
	for(int i = 0; i <= 18; i++) rmp[1 << i] = i;
	printf("%d\n", 1 << n);
	char bs[32];
	scanf("%s",bs);
	if(strlen(bs) != n) while(true);
	int parsed = 0;
	for(int i = 0; i < n; i++){
		parsed *= 2;
		parsed += bs[i] == '1' ? 1 : 0;
	}
	printf("%s\n",bs);
	s.insert(bs);
	for(int i = 1; i < (1 << n); i++){
		int bit = rmp[i & -i];
		for(int j = 0; j < k; j++){
			int toggidx = (bit+j) % n;
			bs[n-toggidx-1] = '0'+'1'-bs[n-toggidx-1];
		}
      if(s.count(string(bs))) while(true);
		printf("%s\n",bs);
		s.insert(bs);
	}
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

lyuboyn.cpp: In function 'int main()':
lyuboyn.cpp:17:16: warning: comparison of integer expressions of different signedness: 'size_t' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   17 |  if(strlen(bs) != n) while(true);
      |     ~~~~~~~~~~~^~~~
lyuboyn.cpp:31:31: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   31 |       if(s.count(string(bs))) while(true);
      |                               ^~~~~
lyuboyn.cpp:32:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   32 |   printf("%s\n",bs);
      |   ^~~~~~
lyuboyn.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    8 |  scanf("%d%d%d",&n,&k,&t);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
lyuboyn.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   16 |  scanf("%s",bs);
      |  ~~~~~^~~~~~~~~

• Subtask 1: 0 / 0
• Subtask 2: 5 / 5
• Subtask 3: 3 / 3
• Subtask 4: 11 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 31
• Subtask 8: 0 / 17