oj.uz

답안 #502108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502108 2022-01-05T09:56:50 Z enerelt14 Red-blue table (IZhO19_stones) C++17
100 / 100
 32 ms 1240 KB 
#include<bits/stdc++.h>
using namespace std;
void solve(){
	int n, m;
	cin>>n>>m;
	if (n==1){
		cout<<m<<"\n";
		for (int i=1;i<=m;i++)cout<<"-";
		cout<<"\n";
		return;
	}
	if (m==1){
		cout<<n<<"\n";
		for (int i=1;i<=n;i++)cout<<"+\n";
		return;	
	}
	if (n==2){
		cout<<m<<"\n";
		for (int i=1;i<=2;i++){
			for (int j=1;j<=m;j++){
				cout<<"-";
			}
			cout<<"\n";
		}
		return;
	}
	if (m==2){
		cout<<n<<"\n";
		for (int i=1;i<=n;i++){
			for (int j=1;j<=2;j++){
				cout<<"+";
			}
			cout<<"\n";
		}
		return;
	}
	if (n%2==1 && m%2==1){
		cout<<n+m-2<<"\n";
		for (int i=1;i<=n;i++){
			for (int j=1;j<=m;j++){
				if (i!=n && j!=m){
					if ((i+j)%2==1)cout<<"-";
					else cout<<"+";
					continue;
				}
				if (i==n)cout<<"-";
				else cout<<"+";
			}
			cout<<"\n";
		}
		return;
	}
	if (n%2==0 && m%2==0){
		if (n/2>=m-3){
			cout<<n+m-3<<"\n";
			int l=m/2-2, x, y, z;
			for (int i=1;i<=n;i++){
				for (int j=1;j<=m-3;j++){
					if (l==0){
						cout<<"-";
						continue;
					}
					x=i%(m-3);
					if (x==0)x+=(m-3);
					y=(x*l)%(m-3);
					z=((x-1)*l)%(m-3);
					if (y>z){
						if (y>=j && z<j)cout<<"+";
						else cout<<"-";
					}
					else{
						if (y>=j || z<j)cout<<"+";
						else cout<<"-";
					}
				}
				cout<<"+++\n";
			}
			return;
		}
		if (m/2>=n-3){
			cout<<n+m-3<<"\n";
			int l=n/2-2, x, y, z;
			for (int i=1;i<=n-3;i++){
				for (int j=1;j<=m;j++){
					if (l==0){
						cout<<"+";
						continue;
					}
					x=j%(n-3);
					if (x==0)x+=(n-3);
					y=(x*l)%(n-3);
					z=((x-1)*l)%(n-3);
					if (y>z){
						if (y>=i && z<i)cout<<"-";
						else cout<<"+";
					}
					else{
						if (y>=i || z<i)cout<<"-";
						else cout<<"+";
					}
				}
				cout<<"\n";
			}
			for (int i=1;i<=3;i++){
				for (int j=1;j<=m;j++){
					cout<<"-";
				}
				cout<<"\n";
			}
			return;
		}
		else{
			cout<<n+m-4<<"\n";
			for (int i=1;i<=n;i++){
				for (int j=1;j<=m;j++){
					if (i<n-1 && j<m-1){
						if ((i+j)%2==0)cout<<"+";
						else cout<<"-";
						continue;
					}
					if (i>n-2)cout<<"-";
					else cout<<"+";
				}
				cout<<"\n";
			}
		}
		return;
	}
	if (n%2==0){
		if (n>=2*(m-2)){
			cout<<n+m-2<<"\n";
			int l=m/2-1, x, y, z;
			for (int i=1;i<=n;i++){
				for (int j=1;j<=m-2;j++){
					if (l==0){
						cout<<"-";
						continue;
					}
					x=i%(m-2);
					if (x==0)x+=(m-2);
					y=(x*l)%(m-2);
					z=((x-1)*l)%(m-2);
					if (y>z){
						if (y>=j && z<j)cout<<"+";
						else cout<<"-";
					}
					else{
						if (y>=j || z<j)cout<<"+";
						else cout<<"-";
					}
				}
				cout<<"++\n";
			}
			return;
		}
		else{
			cout<<n+m-3<<"\n";
			for (int i=1;i<=n;i++){
				for (int j=1;j<=m;j++){
					if (i<=n-2 && j<=m-1){
						if ((i+j)%2==0)cout<<"+";
						else cout<<"-";
						continue;
					}
					if (i>n-2)cout<<"-";
					else cout<<"+";
				}
				cout<<"\n";
			}
			return;
		}
	}
	else{
		if (m>=2*(n-2)){
			cout<<n+m-2<<"\n";
			int l=n/2-1, x, y, z;
			for (int i=1;i<=n-2;i++){
				for (int j=1;j<=m;j++){
					if (l==0){
						cout<<"+";
						continue;
					}
					x=j%(n-2);
					if (x==0)x+=(n-2);
					y=(x*l)%(n-2);
					z=((x-1)*l)%(n-2);
					if (y>z){
						if (y>=i && z<i)cout<<"-";
						else cout<<"+";
					}
					else{
						if (y>=i || z<i)cout<<"-";
						else cout<<"+";
					}
				}
				cout<<"\n";
			}
			for (int i=1;i<=2;i++){
				for (int j=1;j<=m;j++){
					cout<<"-";
				}
				cout<<"\n";
			}
			return;
		}
		else{
			cout<<n+m-3<<"\n";
			for (int i=1;i<=n;i++){
				for (int j=1;j<=m;j++){
					if (i<=n-1 && j<=m-2){
						if ((i+j)%2==0)cout<<"+";
						else cout<<"-";
						continue;
					}
					if (j>m-2)cout<<"+";
					else cout<<"-";
				}
				cout<<"\n";
			}
			return;
		}	
	}
}
int main(){
	int t;
	cin>>t;
	while(t--){
		solve();
	}
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 1240 KB Output is correct
2 Correct 25 ms 1100 KB Output is correct
3 Correct 24 ms 1064 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 1160 KB Output is correct
2 Correct 24 ms 1004 KB Output is correct
3 Correct 22 ms 1004 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 30 ms 1240 KB Output is correct
6 Correct 25 ms 1100 KB Output is correct
7 Correct 24 ms 1064 KB Output is correct
8 Correct 32 ms 1160 KB Output is correct
9 Correct 24 ms 1004 KB Output is correct
10 Correct 22 ms 1004 KB Output is correct
11 Correct 8 ms 460 KB Output is correct
12 Correct 23 ms 1028 KB Output is correct
13 Correct 25 ms 1044 KB Output is correct
14 Correct 25 ms 860 KB Output is correct
15 Correct 28 ms 1228 KB Output is correct
16 Correct 26 ms 960 KB Output is correct
17 Correct 9 ms 608 KB Output is correct