Submission #168284

#	Time	Username	Problem	Language	Result	Execution time	Memory
168284		spartan_enkh	Red-blue table (IZhO19_stones)	C++14	28 / 100	39 ms	1400 KiB

stones

#include<bits/stdc++.h>

using namespace std;

int main(){
	int t,n,m,x,y,i,j,k,l;
	
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&m);
		if(n==1 || m==1){
			printf("%d\n",max(n,m));
			for(i=1;i<=n;i++){
				for(j=1;j<=m;j++){
					if(m==1) printf("+");
					else if(n==1) printf("-");
				}
				printf("\n");
			}
		}
		else if(n==2 || m==2){
			printf("%d\n",max(n,m));
			for(i=1;i<=n;i++){
				for(j=1;j<=m;j++){
					if(m==2) printf("+");
					else if(n==2) printf("-");
				}
				printf("\n");
			}
		}
		else if((n==4 && m<5) || (n==6 && m<5)){
			printf("%d\n",n+1);
			for(i=1;i<=n;i++){
				for(j=1;j<m;j++)
					printf("+");
				printf("-\n");
			}
		}
		else if((m==4 && n<5) || (m==6 && n<5)){
			printf("%d\n",m+1);
			for(i=1;i<n;i++){
				for(j=1;j<=m;j++)
					printf("-");
				printf("\n");
			}
			for(j=1;j<=m;j++) printf("+");
			printf("\n");
		}
		else{
			if(!(n%2)) x=n-2;
			else x=n-1;
			if(!(m%2)) y=m-2;
			else y=m-1;
			printf("%d\n",x+y);
			k=1; 
			for(i=1;i<=x;i++){
				if(k) l=1;
				else l=0;
				k=1-k;
				for(j=1;j<=y;j++){
					if(l) printf("+");
					else printf("-");
					l=1-l;
				}
				if(!(m%2)) printf("++\n");
				else printf("+\n");
			}
			if(!(n%2)) k=2;
			else k=1;
			for(i=1;i<=k;i++){
				for(j=1;j<=m;j++)
					printf("-");
				printf("\n");
			}					
		}
	}
	return 0;
}

Compilation message (stderr)

stones.cpp: In function 'int main()':
stones.cpp:8:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&t);
  ~~~~~^~~~~~~~~
stones.cpp:10:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&m);
   ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 17 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 11 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31