제출 #335957

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

stones

#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){
		swap(n, m);
		vector<int> cnt(m, 0);
		for(i=0;i<n;i++){
			for(j=0;j<m;j++){
				a[i][j] = '+';
			}
		}
		i=0,j=0;
		int lim = m/2+1;
		bool is = true;
		while(is){
			for(k=0;k<lim;k++){
				if(cnt[j]+1 > n/2){
					is = false;
					break;
				}
				cnt[j]++;
				a[i][j] = '-';
				j++;j%=m;
			}i++;
		}
		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++;
		}
		for(i=0;i<m;i++){
			for(j=0;j<n;j++){
				cout << a[i][j];
			}cout << '\n';
		}
	}else {
		vector<int> cnt(m, 0);
		for(i=0;i<n;i++){
			for(j=0;j<m;j++){
				a[i][j] = '-';
			}
		}
		i=0,j=0;
		int lim = m/2+1;
		bool is = true;
		while(is){
			for(k=0;k<lim;k++){
				if(cnt[j]+1 > n/2){
					is = false;
					break;
				}
				cnt[j]++;
				a[i][j] = '+';
				j++;j%=m;
			}i++;
		}
		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++;
		}
		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
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31