제출 #334468

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
334468		Gurban	Red-blue table (IZhO19_stones)	C++17	27 / 100	35 ms	1516 KiB

stones

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

using ll = long long;

const int maxn=1e3+5;
int tt;
int n,m,num,num1;
char c[maxn][maxn];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> tt;
	while(tt--){
		cin >> n >> m;
		num = (n - 1) / 2;
		num1 = (m - 1) / 2;
		if(m + num > n + num1){
			cout << m + num <<'\n';
			for(int i = 1;i <= num;i++)
				for(int j = 1;j <= m;j++) c[i][j]='+';
			for(int i = num+1;i <= n;i++)
				for(int j = 1;j <= m;j++) c[i][j]='-';
		}
		else {
			cout<<n+num1<<'\n';
			for(int i = 1;i <= num1;i++)
				for(int j = 1;j <= n;j++) c[j][i]='-';
			for(int i = num1+1;i <= m;i++)
				for(int j = 1;j <= n;j++) c[j][i]='+';
		}
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= m;j++) cout<<c[i][j];
			cout<<'\n';
		}
	}
}

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