제출 #169130

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169130		Nodir_Bobiev	Red-blue table (IZhO19_stones)	C++14	27 / 100	95 ms	1400 KiB

stones

# include <bits/stdc++.h>
# define FILE
using namespace std;

int main(){

	# ifdef FILEs	
		freopen( "input.txt", "r", stdin );
		freopen( "output.txt", "w", stdout );
	# endif

	int t;
	cin >> t;
	while( t -- ){
		int n, m;
		cin >> n >> m;
		char a[n][m];
		int ans = 0;
		if( n < m ){
			ans = m + (n-1)/2;
			for( int i = 0; i < n; i ++ )
				for( int j = 0; j < m; j ++ )
					a[i][j] = '-';
			for( int i = 0; i < (n-1)/2; i ++ )
				for( int j = 0; j < m; j ++ )	
					a[i][j] = '+';
		}
		else{
			ans = n + (m-1)/2;
			for( int i = 0; i < n;  i++ )
				for( int j = 0; j < m; j ++ )
					a[i][j] = '+';
			for( int j = 0; j < (m-1)/2; j ++ )
				for( int i = 0; i < n; i ++ )
					a[i][j] = '-';
		}
		cout << ans << endl;
		for( int i = 0; i < n; i ++ ){
			for( int j = 0; j < m; j ++ ){
				cout << a[i][j];
			}cout << endl;
		}

	}
	return 0;
}

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