제출 #335174

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

stones

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

using ll = long long;

const int maxn=1e3+5;
int tt,ans,ps,need;
int n,m,tr,a[maxn][maxn];
int cnt[maxn],num[maxn];

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

	cin >> tt;
	while(tt--){
		cin >> n >> m;
		tr = 0;
		if(n % 2 == 0) swap(n,m),tr=1;
		for(int i = 1;i <= n;i++) for(int j = 1;j <= m;j++) a[i][j]=1;
		if(min(n,m) <= 2){
			ans = max(n,m);
			for(int i = 1;i <= n;i++) for(int j = 1;j <= m;j++){
				if(n > m) a[i][j]=1;
				else a[i][j]=0;
			}
		}
		else{
			ans = n - 2,ps = m/2+1,need = n/2+1;
			for(int i = n - 1;i <= n;i++) for(int j = 1;j <= m;j++) a[i][j]=0;
			for(int i = 1;i <= m;i++) cnt[i] = 2;
			for(int i = 1;i <= n-2;i++) num[i] = m;
			for(int i = 1;i <= m;i++){
				for(int j = 1;j <= n-2;j++){
					if(cnt[i]==need){break;}
					if(num[j] > ps){
						a[j][i] = 0;
						num[j]--,cnt[i]++;
					}
				}
				if(cnt[i]==need) ans++;
			}
		}
		cout<<ans<<'\n';
		if(tr) swap(n,m);
		for(int i = 1;i <= n;i++){
			for(int j = 1;j <= m;j++){
				char nw = '+';
				if((tr and a[j][i]==1) or (tr==0 and a[i][j]==0)) nw = '-';
				cout<<nw;
			}
			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