제출 #179791

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
179791		tselmegkh	Red-blue table (IZhO19_stones)	C++14	100 / 100	55 ms	2296 KiB

stones

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

int cnt[1005];
char ans[1005][1005];

int go1(int n, int m){
	memset(cnt, 0, sizeof cnt);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			ans[i][j] = '-';
			cnt[j] = n;
		}
	}

	int l = 1, tot = m;

	for(int i = 1; i <= n; i++){
		int need = m / 2 + 1, cur = l;
		while(need > 0){
			if(cnt[cur] > n / 2 + 1){
				cnt[cur]--;
				need--;
				ans[i][cur] = '+';
			}
			cur++;
			if(cur > m)cur -= m;
			if(cur == l)break;
		}
		if(need == 0){
			tot++;
			l = cur;
		}else break;
	}
	return tot;
}
int go2(int n, int m){
	memset(cnt, 0, sizeof cnt);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			ans[i][j] = '+';
		}
		cnt[i] = m;
	}

	int l = 1, tot = n;

	for(int j = 1; j <= m; j++){
		int need = n / 2 + 1, cur = l;
		while(need > 0){
			if(cnt[cur] > m / 2 + 1){
				cnt[cur]--;
				need--;
				ans[cur][j] = '-';
			}
			cur++;
			if(cur > n)cur -= n;
			if(cur == l)break;
		}
		if(need == 0){
			tot++;
			l = cur;
		}else break;
	}
	return tot;
}
int main(){
	int t;
	cin >> t;
	while(t--){
		int n, m;
		cin >> n >> m;
		if(go1(n, m) > go2(n, m)){
			cout << go1(n, m) << '\n';
		}else{
			cout << go2(n, m) << '\n';
		}
		for(int i = 1; i <= n; i++){
			for(int j = 1; j <= m; j++){
				cout << ans[i][j];
			}
			cout << '\n';
		}
	}
}

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