제출 #339033

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
339033		Khizri	Red-blue table (IZhO19_stones)	C++17	27 / 100	44 ms	1388 KiB

stones

#include <bits/stdc++.h>
using namespace std;
//------------------------------------------------------------------------------
//******************************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define ll long long
#define MOD 1e9+7
#define endl '\n'
const int mxn=2e5+5;
//******************************************************************************
//------------------------------------------------------------------------------
ll t=1,n,m,ans;
void solve(){
	ans=0;
	cin>>n>>m;
	if(n<m){
		ans+=m;
		ans+=((n-1)/2);
		cout<<ans<<endl;
		for(int i=1;i<=n-(((n-1)/2));i++){
			for(int i=1;i<=m;i++){
				cout<<'-';
			}
			cout<<endl;
		}
		for(int i=n-(((n-1)/2))+1;i<=n;i++){
			for(int i=1;i<=m;i++){
				cout<<'+';
			}
			cout<<endl;
		}
	}
	else{
		ans+=n;
		ans+=((m-1)/2);
		cout<<ans<<endl;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(j>(m-((m-1)/2))){
					cout<<'-';
				}
				else{
					cout<<'+';
				}
			}
			cout<<endl;
		}
	}
}
int main(){
	//IOS;
	cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

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