제출 #856758

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
856758		Halym2007	Red-blue table (IZhO19_stones)	C++11	11 / 100	23 ms	2132 KiB

stones

#include <iostream>
#include <algorithm>
#include <math.h>
//#include <vector>
//#include <stack>
//#include <queue>
//#include <map>
//#include <set>
//#include <deque>
#define ll long long
#define sz(s) (int)s.size()
#define N 200005
#define ff first
#define ss second
using namespace std;
int T, n, m;
char c[1005][1005];
int main()
{
	cin >> T;
	while(T--){
		cin >> n >> m;
		if(n == 1){
			cout << m << '\n';
			for(int i = 1; i <= m; i++){
				cout << '-';
			}
			cout << '\n';
			continue;
		}
		else if(m == 1){
			cout << n << '\n';
			for(int i = 1; i <= n; i++){
				cout << '+' << '\n';
			}
			continue;
		}
		else {
			cout << n+m-2 << '\n';
		}
		for(int i = 1; i <= n; i += 2){
			for(int j = 1; j <= m; j++){
				if(j % 2 == 1) c[i][j] = '+';
				else c[i][j] = '-';
			}
		}
		for(int i = 2; i <= n; i += 2){
			for(int j = 1; j <= m; j++){
				if(j % 2 == 1) c[i][j] = '-';
				else c[i][j] = '+';
			}
		}
		for(int i = 1; i <= m; i++){
			c[n][i] = '-';
		}
		for(int i = 1; i <= n; i++){
			c[i][m] = '+';
		}
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				cout << c[i][j];
			}
			cout << '\n';
		}
	}
}

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