Submission #286845

#	Time	Username	Problem	Language	Result	Execution time	Memory
286845		dvdg6566	Red-blue table (IZhO19_stones)	C++14	0 / 100	32 ms	2076 KiB

stones

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pi;
typedef vector<ll> vi;
typedef vector<pi> vpi;
#define pb emplace_back
#define mp make_pair
#define f first
#define s second
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define lb lower_bound
const int MAXN=1001;
const ll MOD=998244353;

ll A[MAXN][MAXN];
ll R,C,T;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>T;
	while(T--){
		cin>>R>>C;
		int ta=R+(C-1)/2;
		int tb=C+(R-1)/2;

		if(ta>=tb){
			for(int col=0;col<C;++col){
				int v=col%2;
				for(int i=0;i<R;++i)A[i][col]=v;
			}
		}else{
			for(int row=0;row<R;++row){
				int v=row%2^1;
				for(int i=0;i<C;++i)A[row][i]=v;
			}
		}
		cout<<max(ta,tb)<<'\n';
		for(int i=0;i<R;++i){
			for(int j=0;j<C;++j){
				if(A[i][j])cout<<'-';
				else cout<<'+';
			}
			cout<<'\n';
		}
		// 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