Submission #209954

#	Time	Username	Problem	Language	Result	Execution time	Memory
209954		super_j6	Red-blue table (IZhO19_stones)	C++14	15 / 100	37 ms	3192 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 a[n][m];
	memset(a, 0, sizeof(a));
	for(int i = 0; i < (m - 1) / 2; i++)
	for(int j = 0; j < n; j++){
		a[j][(i * n + j) / (n / 2 + 1)] = 1;
	}
	
	if(f) swap(n, m);
	cout << (n + ((m - 1) / 2 * n) / (n / 2 + 1)) << 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: 0 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 15 / 15
• Subtask 6: 0 / 31