Submission #172648

#	Time	Username	Problem	Language	Result	Execution time	Memory
172648		LinusTorvaldsFan	Red-blue table (IZhO19_stones)	C++14	0 / 100	51 ms	1656 KiB

stones

#include <bits/stdc++.h>

using namespace std;

char f[2000][2000];

int ver[2000];
int hor[2000];


int main() {
	int t;
	cin>>t;
	for(;t;t--){
		int n,m;
		cin>>n>>m;
		int ans=max(n,m);
		if(n>m){
			for(int i=0;i<n;i++){
				for(int j=0;j<m;j++){
					f[i][j]='+';
					hor[i]=m;
				}
			}
			for(int j=0;j<m;j++){
				int t=0;
				for(int i=0;i<n;i++){
					if(t>=n/2+n%2)break;
					if(hor[i]-1>=m/2+m%2){
						f[i][j]='-';
						hor[i]--;
						t++;
					}
				}
				if(t==n/2+n%2)ans++;
			}
				
		} else{
			for(int i=0;i<n;i++){
				for(int j=0;j<m;j++){
					f[i][j]='-';
					ver[j]=n;
				}
			}
			for(int i=0;i<n;i++){
				int t=0;
				for(int j=0;j<m;j++){
					if(t>=m/2+m%2)break;
					if(ver[j]-1>=n/2+n%2){
						f[i][j]='+';
						ver[j]--;
						t++;
					}
				}
				if(t==n/2+n%2)ans++;
			}
		}
		cout<<ans<<endl;
		for(int i=0;i<n;i++){
			for(int j=0;j<m;j++){
				cout<<f[i][j];
			}
			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