Submission #1171681

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171681		coolboy19521	Red-blue table (IZhO19_stones)	C++20	10 / 100	35 ms	1352 KiB

stones

#include "bits/stdc++.h"

#define mxN 1003

using namespace std;

char gr[mxN][mxN];

int main(){
	int T;
	cin >> T;
	
	while (T --){
		int N, M;
		cin >> N >> M;
		
		for (int i = 1; i <= N; i ++)
		for (int j = 1; j <= M; j ++)
			gr[i][j] = "-+"[N >= M];

		int ans = 0;

		if (N >= M){
			for (int i = 1; i <= N / 2 + 1; i ++)
			for (int j = 1; j <= (M + 1) / 2 - 1; j ++)
				gr[i][j] = '-';
			if (M / 2 > 1){
				for (int i = N / 2 + 2; i <= N / 2 * 2; i ++)
				for (int j = (M + 1) / 2 - 1; j <= M; j ++)
					gr[i][j] = '-';
				cout << M / 2 * 2 + N - 1 << endl;
			} else cout << N + (M + 1) / 2 - 1 << endl;
		} else {
			for (int i = 1; i <= (N + 1) / 2 - 1; i ++)
			for (int j = 1; j <= M / 2 + 1; j ++)
				gr[i][j] = '+';
			if (N / 2 > 1){
				for (int i = (N + 1) / 2; i <= N / 2 * 2; i ++)
				for (int j = M / 2 + 1; j <= M; j ++)
					gr[i][j] = '+';
				cout << N / 2 * 2 + M - 1 << endl;
			}
			else cout << M + (N + 1) / 2 - 1 << endl;
		}
		
		for (int i = 1; i <= N; i ++){
			for (int j = 1; j <= M; j ++)
				cout << gr[i][j];
			cout << endl;
		}
	}
}

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