제출 #1094237

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1094237		Muhammet	Red-blue table (IZhO19_stones)	C++17	0 / 100	21 ms	1524 KiB

stones

#include <bits/stdc++.h>

using namespace std;

vector <vector <char>> a;

int main(){
	ios::sync_with_stdio(false); cin.tie(nullptr);
	int T;
	cin >> T;
	while(T--){
		int n, m;
		cin >> n >> m;
		if(n >= m){
			a.assign(n, vector <char> (m,'+'));
			int x = 0;
			for(int j = 0; j < (m+1)/2; j++){
				int cnt = ((n+1)/2);
				while(cnt--){
					a[x][j] = '-';
					x++;
					x %= n;
				}
			}
		}
		else {
			a.assign(n, vector <char> (m,'-'));
			int x = 0;
			for(int j = 0; j < (n)/2; j++){
				int cnt = ((m+1)/2);
				while(cnt--){
					a[j][x] = '+';
					x++;
					x %= m;
				}
			}
		}
		int ans = 0;
		for(int i = 0; i < n; i++){
			int a1 = 0, b1 = 0;
			for(int j = 0; j < m; j++){
				if(a[i][j] == '+') a1++;
				else b1++;
			}
			ans += (a1 > b1);
		}
		for(int j = 0; j < m; j++){
			int a1 = 0, b1 = 0;
			for(int i = 0; i < n; i++){
				if(a[i][j] == '+') a1++;
				else b1++;
			}
			ans += (b1 > a1);
		}
		cout << ans << '\n';
		for(int i = 0; i < n; i++){
			for(int j = 0; j < m; j++){
				cout << a[i][j];
			}
			cout << '\n';
		}
	}
}

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