제출 #1093911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1093911		stdfloat	Red-blue table (IZhO19_stones)	C++17	27 / 100	19 ms	1492 KiB

stones

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

using ll = long long;

#define all(v) (v).begin(), (v).end()

void solve() {
	int n, m;
	cin >> n >> m;

	vector<vector<char>> a(n, vector<char>(m));
	if (n < m) {
		for (int i = 0; i < n; i++) {
			if (i < ((n - 1) >> 1)) {
				for (int j = 0; j < m; j++)
					a[i][j] = '+';
			}
			else {
				for (int j = 0; j < m; j++)
					a[i][j] = '-';
			}
		}
	}
	else {
		for (int i = 0; i < m; i++) {
			if (i < ((m - 1) >> 1)) {
				for (int j = 0; j < n; j++)
					a[j][i] = '-';
			}
			else {
				for (int j = 0; j < n; j++)
					a[j][i] = '+';
			}
		}
	}

	cout << max(m, n) + (min(m, n) - 1 >> 1) << '\n';
	for (auto i : a) {
		for (auto j : i)
			cout << j;
		cout << '\n';
	}
	cout << '\n';
}

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

	int T;
	cin >> T;
	while (T--) solve();
}

컴파일 시 표준 에러 (stderr) 메시지

stones.cpp: In function 'void solve()':
stones.cpp:38:33: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   38 |  cout << max(m, n) + (min(m, n) - 1 >> 1) << '\n';
      |                       ~~~~~~~~~~^~~

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