oj.uz

답안 #236449

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
236449 2020-06-02T10:05:40 Z kshitij_sodani Red-blue table (IZhO19_stones) C++17
10 / 100
 14 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
int n,m,t;
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin>>t;
	while(t--){
		cin>>n>>m;
		if(n==1){
			cout<<m<<endl;
			for(int j=0;j<m;j++){
				cout<<"-";
			}
			cout<<endl;
		}
		else if(m==1){
			cout<<n<<endl;
			for(int j=0;j<n;j++){
				cout<<"+"<<endl;
			}
			cout<<endl;
		}
		else if(n==2){
			cout<<m<<endl;
			for(int i=0;i<m;i++){
				cout<<"-";
			}
			cout<<endl;
			for(int i=0;i<m;i++){
				cout<<"-";
			}
			cout<<endl;
		}
		else if(m==2){
			cout<<n<<endl;
			for(int i=0;i<n;i++){
				cout<<"++"<<endl;
			}
		}
		else if(n==3){
			cout<<(m+1)<<endl;
			for(int i=0;i<m;i++){
				cout<<"-";
			}
			cout<<endl;
			for(int i=0;i<m;i++){
				cout<<"+";
			}
			cout<<endl;
			for(int i=0;i<m;i++){
				cout<<"-";
			}
			cout<<endl;
		}
		else if(m==3){
			cout<<(n+1)<<endl;
			for(int i=0;i<n;i++){
				cout<<"+-+"<<endl;
			}
		}
		/*int it[n][m];
			if(n>m){
				int l=0;
				for(int i=0;i<n;i++){
					for(int j=l;j<l+(m+2)/2;j++){
						it[i][j%m]=1;
					}
					l=l+(m+2)/2;
					l%=m;
				}
				for(int i=0;i<n;i++){
					for(int j=0;j<m;j++){
						if(it[i][j]){
							cout<<"+";
						}
						else{
							cout<<"-";
						}
					}
					cout<<endl;
				}
			}
			else{
				for(int i=0;i<n;i++){
					for(int j=0;j<m;j++){
						if(i%2==0){
							cout<<"-";
						}
						else{
							cout<<"+";
						}
					}
					cout<<endl;
				}
			}*/
		
	}


	return 0;
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Wrong answer

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Wrong answer

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 6 ms 384 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 384 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Incorrect 5 ms 384 KB Wrong answer