제출 #372329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
372329		mariowong	Red-blue table (IZhO19_stones)	C++14	0 / 100	34 ms	1516 KiB

stones

#include <bits/stdc++.h>
using namespace std;

int t,n,m;
char ans[1005][1005];
int main(){
	ios::sync_with_stdio(false);
	cin >> t;
	while (t--){
		cin >> n >> m;
		cout << max(n,m)+min(n,m)/2 << "\n";
		if (n > m){
			for (int i=1;i<=m;i+=2){
				for (int j=1;j<=n;j++){
					ans[j][i]='+';
					ans[j][i+1]='-';
				}
			}
			if (m%2 == 0){
				for (int i=1;i<=n;i++){
					ans[i][m]='+';
				}
			}
		}
		else
		{
			for (int i=1;i<=n;i+=2){
				for (int j=1;j<=m;j++){
					ans[i][j]='-';
					ans[i+1][j]='+';
				}
			}
			if (n%2 == 0){
				for (int i=1;i<=m;i++){
					ans[n][i]='-';
				}
			}
		}
		for (int i=1;i<=n;i++){
			for (int j=1;j<=m;j++){
				cout << ans[i][j];
			}
			cout << "\n";
		}
	}
    return 0;
}	

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