Submission #384226

#	Time	Username	Problem	Language	Result	Execution time	Memory
384226		ritul_kr_singh	Red-blue table (IZhO19_stones)	C++17	28 / 100	33 ms	1388 KiB

stones

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' << 
#define nl << '\n'

bool e(int y){ return !(y%2); } // lol 

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int T; cin >> T;
	while(T--){
		int n, m; cin >> n >> m;
		if(e(m) and ((e(n) and m > n) or !e(n))){
			cout << m + max(0LL, (n-1)/2) nl;
			for(int i=0; i<n; ++i){
				for(int j=0; j<m; ++j){
					cout << (i+i > n ? '+' : '-');
				}cout nl;
			}
		}else if(e(n)){
			cout << n + max(0LL, (m-1)/2) nl;
			for(int i=0; i<n; ++i){
				for(int j=0; j<m; ++j){
					cout << (j+j > m ? '-' : '+');
				}cout nl;
			}
		}else if(n==1){
			cout << m nl;
			for(int i=0; i<m; ++i) cout << '-';
			cout nl;
		}else if(m==1){
			cout << n nl;
			for(int i=0; i<n; ++i) cout << '+' nl;
		}else{
			cout << n + m - 2 nl;
			for(int i=0; i<n; ++i){
				for(int j=0; j<m; ++j){
					if(i and j) cout << ((i+j) % 2 ? '+' : '-');
					else cout << (i ? '+' : '-');
				}
				cout nl;
			}
		}
	}
}

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