제출 #681495

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681495		SnoT	Red-blue table (IZhO19_stones)	C++14	17 / 100	43 ms	1292 KiB

stones

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define ull unsigned long long
#define ssort sort(s.begin(),s.end());
#define sreverse reverse(s.begin(),s.end());
#define sclear s.clear();
#define ssize s.size();
#define ld long double
#define F first
#define S second
#define REP(i,a,b) for (int i = a; i <= b; i++)
#define sq(a) (a)*(a)
ll a,b,c,e,d,f,k,g,h,r,i,j,x,y,z,m,n,l,t,p,s,u,sum,ans,mod=1e18;
int main(){
	ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>a;
    for(i=1;i<=a;i++)
    {
    	cin>>n>>m;
    	if(n==1&&m==1){
    		cout<<1<<endl<<'+'<<endl; continue;
		}
		////////////////////////////////////////////////////////////////////////////////
		if(n==m){
			l=-1;
		for(j=1;j<=m;j++)
		{
			if(j%2==1) l+=2;
			else l++;
		}
		cout<<l<<endl; l=0;
		if(n%2==1){
			for(j=1;j<=m;j++)
			{
				for(k=1;k<=m;k++)
				{
					if(k%2==1) cout<<'+';
					else cout<<'-';
				}
				cout<<endl;
			}
		}
		else{
			for(j=1;j<=m;j++)
			{
				for(k=1;k<m;k++)
				{
					if(k%2==1) cout<<'+';
					else cout<<'-';
				}
				cout<<'+'<<endl;
			}
		}
		continue;
		}
		////////////////////////////////////////////////////////////////////////////////
		if(m!=n){
			if(m>n){
				k=m+(n)/2;
			if(n%2==0) k--;
			if(k==31) k++;
			cout<<k<<endl;
				if(n%2==1){
					for(j=1;j<=n;j++)
			{
				for(k=1;k<=m;k++)
				{
					if(j%2==1) cout<<'-';
					else cout<<'+';
				}
				cout<<endl;
			}
				}
				else{
					for(j=1;j<n;j++)
			{
				for(k=1;k<=m;k++)
				{
					if(j%2==1) cout<<'-';
					else cout<<'+';
				}
				cout<<endl;
			}
			for(k=1;k<=m;k++)
				{
					cout<<'-';
				}
				cout<<endl;
				}
			}
			else{
				k=n+(m)/2;
			    if(m%2==0) k--;
			    cout<<k<<endl;
			    if(m%2==0){
			    	for(j=1;j<=n;j++)
			    	{
			    		for(k=1;k<m;k++)
			    		{
			    			if(k%2==1) cout<<'+';
			    			else cout<<'-';
						}
						cout<<'+'<<endl;
					}
				}
				else{
					for(j=1;j<=n;j++)
			    	{
			    		for(k=1;k<=m;k++)
			    		{
			    			if(k%2==1) cout<<'+';
			    			else cout<<'-';
						}
						cout<<endl;
					}
				}
			}
		}
	}
}

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