제출 #201987

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
201987		guangxuan	Red-blue table (IZhO19_stones)	C++14	100 / 100	13 ms	2296 KiB

stones

#include <bits/stdc++.h>

using namespace std;

char ans[1002][1002];

int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		int n,m;
		scanf("%d%d",&n,&m);
		int ans1 = n + (m-1)/2, ans2 = m + (n-1)/2;
		for(int x=1;x<m;x++){
			if((n*x + (m-1)/2 + x - 1)/((m-1)/2 + x) <= (n-1)/2)ans1++;
			else break;
		}
		for(int x=1;x<n;x++){
			if((m*x + (n-1)/2 + x - 1)/((n-1)/2 + x) <= (m-1)/2)ans2++;
			else break;
		}
		printf("%d\n",max(ans1,ans2));
		if(ans1>ans2){
			int x = ans1 - (n+(m-1)/2);
			for(int i=0;i<n;i++){
				for(int j=0;j<m;j++){
					if(j<x+(m-1)/2)ans[i][j]='-';
					else ans[i][j]='+';
				}
				for (int j = i * x; j< (i+1) * x; j++){
					ans[i][j%(x+(m-1)/2)] = '+';
				}
				ans[i][m] = '\0';
			}
		}
		else{
			int x = ans2 - (m+(n-1)/2);
			for(int j=0;j<m;j++){
				for(int i=0;i<n;i++){
					if(i<x+(n-1)/2)ans[i][j]='+';
					else ans[i][j]='-';
				}
				for (int i = j * x; i< (j+1) * x; i++){
					ans[i%(x+(n-1)/2)][j] = '-';
				}
			}
			for(int i=0;i<n;i++)ans[i][m]='\0';
		}
		for(int i=0;i<n;i++)printf("%s\n",ans[i]);
	}
}

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

stones.cpp: In function 'int main()':
stones.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&T);
  ~~~~~^~~~~~~~~
stones.cpp:12: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: 10 / 10
• Subtask 3: 16 / 16
• Subtask 4: 11 / 11
• Subtask 5: 15 / 15
• Subtask 6: 31 / 31