제출 #858744

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
858744		Halym2007	Red-blue table (IZhO19_stones)	C++11	38 / 100	47 ms	3000 KiB

stones

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e3 + 5;
#define pb push_back
#define sz size()
#define ff first
#define ss second
char a[N][N], p[N][N];
int n, m, jog1, jog;
void solve (char c) {
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			a[i][j] = c;
		}
	}
}

void solve1 (char c) {
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			p[i][j] = c;
		}
	}
}

int jogap () {
	int x, ret = 0;
	for (int i = 1; i <= n; ++i) {
		x = 0;
		for (int j = 1; j <= m; ++j) {
			if (p[i][j] == '+') x++;
			else x--;
		}
		if (x > 0) ret++;
	}
	for (int i = 1; i <= m; ++i) {
		x = 0;
		for (int j = 1; j <= n; ++j) {
			if (p[j][i] == '-') x++;
			else x--;
		}
		if (x > 0) ret++;
	}
	return ret;
}

int main () {
//	freopen("input.txt", "r", stdin);
	int t;
	cin >> t;
	while ( t-- ) {
		cin >> n >> m;
		solve ('+');
		if (n >= m) {
			jog = n + (m - (m / 2 + 1));
			for (int i = 1; i <= n; ++i) {
				for (int j = m / 2 + 2; j <= m; ++j) a[i][j] = '-';
			}
		}
		else {
			jog = m + (n - (n / 2 + 1));
			for (int i = 1; i <= n / 2 + 1; ++i) {
				for (int j = 1; j <= m; ++j) a[i][j] = '-';
			}
		}
		// 1 variant tapdyk
		solve1('-');
		for (int i = 1; i <= (n - 1) / 2; ++i) {
			for (int j = 1; j <= m / 2 + 1; ++j) {
				p[i][j] = '+';
			}
		}
		for (int i = n / 2 + 2; i <= n; ++i) {
			for (int j = (m + 1) / 2; j <= m; ++j) {
				p[i][j] = '+';
			}
		}
		jog1 = jogap();
		if (jog < jog1) {
			jog = jog1;
			for (int i = 1; i <= n; ++i) {
				for (int j = 1; j <= m; ++j) a[i][j] = p[i][j];
			}
		}
//		cout << jog1 << endl;
//		for (int i = 1; i <= n; ++i) {
//			for (int j = 1; j <= m; ++j) {
//				cout << p[i][j];
//			}
//			cout << endl;
//		}
//		cout << endl;
		cout << jog << endl;
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= m; ++j) {
				cout << a[i][j];
			}
			cout << endl;
		}
	}
}

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