Submission #167715

#	Time	Username	Problem	Language	Result	Execution time	Memory
167715		munhorgil	Red-blue table (IZhO19_stones)	C++14	11 / 100	93 ms	1276 KiB

stones

#include<bits/stdc++.h>

using namespace std;

int main()
{
	int t , i , j , m , n , ans , a , b;
	
	cin >> t;
	
	while(t > 0)
	{
		cin >> n >> m;
		
		if(n % 2 == 0) a = n - 2;
			else a = n - 1;
		if(m % 2 == 0) b = m - 2;
			else b = m - 1;
		
		if(n == 1)
		{
			cout << m << endl;
			goto here;
		}
		if(m == 1)
		{
			cout << n << endl;
			for(i = 0 ; i < n ; i++)
			{
				cout << "+" << endl;
			}
			goto there;
		}
		
		ans = a + b;
		
		cout << ans << endl;
		
		for(j = 0 ; j < a / 2 ; j++)
		{
			for(i = 0 ; i < b / 2 ; i++)
			{
				cout << "+";
			}
			for(i = 0 ; i < b / 2 ; i++)
			{
				cout << "-";
			}
			for(i = 0 ; i < (m - b) ; i++)
			{
				cout << "+";
			}
			cout << endl;
		}
		for(j = 0 ; j < a / 2 ; j++)
		{
			for(i = 0 ; i < b / 2 ; i++)
			{
				cout << "-";
			}
			for(i = 0 ; i < b / 2 ; i++)
			{
				cout << "+";
			}
			for(i = 0 ; i < (m - b) ; i++)
			{
				cout << "+";
			}
			cout << endl;
		}
		here:;
		for(j = 0 ; j < (n - a) ; j++)
		{
			for(i = 0 ; i < m ; i++)
			{
				cout << "-";
			}
			cout << endl;
		}
		
		there:;
		
		t--;
	}
}

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