제출 #209955

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

stones

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string.h>
using namespace std;
#define endl '\n'
#define pi pair<int, int>

int n, m;
bool f;

void answer(){
	cin >> n >> m;
	
	if(n < m){
		swap(n, m);
		f = 1;
	}else f = 0;
	
	int ret = 0;
	int a[n][m];
	memset(a, 0, sizeof(a));
	for(int i = 0, c = n / 2; i < (m - 1) / 2; i++)
	for(int j = 0; j < n; j++, c--){
		a[j][ret] = 1;
		if(!c){
			ret++;
			c = n / 2 + 1;
		}
	}
	ret += n;
	
	if(f) swap(n, m);
	cout << ret << endl;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			cout << ((f ? !a[j][i] : a[i][j]) ? '-' : '+');
		}
		cout << endl;
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	
	int t;
	cin >> t;
	
	for(int i = 0; i < t; i++) answer();

	return 0;
}

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