oj.uz

답안 #167717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
167717 2019-12-09T18:55:55 Z munhorgil Red-blue table (IZhO19_stones) C++14
11 / 100
 93 ms 1304 KB 
#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)
		{
			if(n % 2 == 0) a = n - 2;
				else a = n - 1;	
		}
		if(m > 2)
		{
			if(m % 2 == 0) b = m - 2;
			else b = m - 1;
		}
		
		if(n <= 2)
		{
			a = 0;
			cout << max(m , n) << endl;
			goto here;
		}
		if(m == 1)
		{
			cout << n << endl;
			for(i = 0 ; i < n ; i++)
			{
				cout << "+" << endl;
			}
			goto there;
		}
		if(m == 2)
		{
			cout << max(m , 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--;
	}
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:51:7: warning: 'b' may be used uninitialized in this function [-Wmaybe-uninitialized]
   ans = a + b;
   ~~~~^~~~~~~

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB in the table A+B is not equal to 2

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 14 ms 376 KB in the table A+B is not equal to 2

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB in the table A+B is not equal to 2

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 93 ms 1304 KB Output is correct
2 Correct 40 ms 1272 KB Output is correct
3 Correct 39 ms 1144 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 67 ms 1292 KB Wrong answer in test 4 4: 4 < 5
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB in the table A+B is not equal to 2