Submission #344422

#	Time	Username	Problem	Language	Result	Execution time	Memory
344422		YJU	Red-blue table (IZhO19_stones)	C++14	0 / 100	35 ms	1388 KiB

stones

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e6+5;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()

ll t,n,m;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>t;
	while(t--){
		cin>>n>>m;
		if(n-(n+2)/2+m>=m-(m+2)/2+n){
			REP1(i,n)REP1(j,m){
				cout<<(i>=(n+2)/2?('-'):('+'));
				if(j==m)cout<<'\n';
			}
		}else{
			REP1(i,n)REP1(j,m){
				cout<<(j>=(m+2)/2?'+':'-');
				if(j==m)cout<<'\n';
			}
		}
		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