oj.uz

Submission #335812

# Submission time Handle Problem Language Result Execution time Memory
335812 2020-12-14T03:43:53 Z tengiz05 Red-blue table (IZhO19_stones) C++17
0 / 100
 45 ms 1516 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define PI acos(-1)
#define ld long double
const int mod = 1e9+7, N = 1005;
int msb(int val){return sizeof(int)*8-__builtin_clzll(val);}
int n, m, k;
char a[N][N];
void solve(int test_case){
	int i, j;
	cin >> n >> m;
/*	if(n > m){
		int need = m/2+1;
		for(i=0;i<n;i++){
			for(j=0;j<need;j++){
				a[i][j] = '+';
			}
		}
		for(i=0;i<n;i++){
			for(j=need;j<m;j++){
				a[i][j] = '-';
			}
		}
		cout << n + m-need << '\n';
		for(i=0;i<n;i++){
			for(j=0;j<m;j++){
				cout << a[i][j];
			}cout << '\n';
		}
	}else {
		swap(n, m);
		int need = m/2+1;
		for(i=0;i<n;i++){
			for(j=0;j<need;j++){
				a[i][j] = '-';
			}
		}
		for(i=0;i<n;i++){
			for(j=need;j<m;j++){
				a[i][j] = '+';
			}
		}
		cout << n + m-need << '\n';
		for(i=0;i<m;i++){
			for(j=0;j<n;j++){
				cout << a[j][i];
			}cout << '\n';
		}
	}*/
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			if((i+j)%2==0)a[i][j] = '+';
			else a[i][j] = '-';
		}
	}
	for(i=0;i<n;i++)a[i][0] = a[i][m-1] = '+';
	for(j=0;j<m;j++)a[0][j] = a[n-1][j] = '-';
	int ans = 0;
	
	for(i=0;i<n;i++){
		int s = 0;
		for(j=0;j<m;j++)s += (a[i][j]=='+');
		if(s > m/2)ans++;
	}
	for(j=0;j<m;j++){
		int s = 0;
		for(i=0;i<n;i++)s += (a[i][j]=='-');
		if(s > n/2)ans++;
	}
	cout << ans << '\n';
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			cout << a[i][j];
		}cout << '\n';
	}
	return;
}

signed main(){
	FASTIO;
#define MULTITEST 1
#if MULTITEST
	int ___T;
	cin >> ___T;
	for(int T_CASE = 1; T_CASE <= ___T; T_CASE++)
		solve(T_CASE);
#else
	solve(1);
#endif
	return 0;
}

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 2 1: 1 < 2

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Wrong answer in test 2 1: 1 < 2

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 2 1: 1 < 2

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 1496 KB Wrong answer in test 97 21: 114 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 1516 KB Wrong answer in test 19 19: 34 < 36
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 2 1: 1 < 2