제출 #503119

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
503119		AzamatRustamov	Red-blue table (IZhO19_stones)	C++14	15 / 100	23 ms	1576 KiB

stones

#include <iostream>
using namespace std;

void solve()
{
	int n, m;
	cin >> n >> m;
	bool swapped = false;
	if (n < m)
	{
		int t = n;
		n = m, m = t, swapped = true;
	}
	char a[n][m];
	for (int i=0; i<n; i++) for (int j=0; j<m; j++) a[i][j] = '+';
	int ans = n, x = 0, c = 0;
	for (int k=0; k<(m-1)/2; k++) for (int y=0; y<n; y++)
	{
		a[y][x] = '-', c++;
		if (c == n/2+1) x++, c=0, ans++;
	}
	cout << ans << '\n';
	if (!swapped) for (int i=0; i<n; i++)
	{
		for (int j=0; j<m; j++) cout << a[i][j];
		cout << '\n';
	}
	else for (int j=0; j<m; j++)
	{
		for (int i=0; i<n; i++) cout << (a[j][i]=='+'?'-':'+');
		cout << '\n';
	}
}

int main()
{
	ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int t;
	cin >> t;
	while(t--) solve();
	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