//izho gold
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(),a.end()
#define pb push_back
#define vt vector
#define endl '\n'
#define Y second
#define X first
typedef long long ll;
typedef long double ld;
const ll mod=1e9+7;
const ll INF=1e18;
const int inf=1e9;
const int N=2e5+505;
const int M=1e3+10;
const int dx[]={0,0,1,-1};
const int dy[]={1,-1,0,0};
int n,m;
void solve(){
cin>>n>>m;
if(min(n,m)<=3){
if(n<=m){
if(n==1){
cout<<m<<endl;
for(int i=1; i<=m; ++i)cout<<'-';
cout<<endl;
return;
}if(n==2){
cout<<m<<endl;
for(int i=1; i<=m; ++i)cout<<'-';
cout<<endl;
for(int i=1; i<=m; ++i)cout<<'-';
cout<<endl;
return;
}if(n==3){
cout<<m+1<<endl;
for(int i=1; i<=m; ++i)cout<<'-';
cout<<endl;
for(int i=1; i<=m; ++i)cout<<'+';
cout<<endl;
for(int i=1; i<=m; ++i)cout<<'-';
cout<<endl;
return;
}
}else{
if(m==1){
cout<<n<<endl;
for(int i=1; i<=n; ++i)cout<<"+\n";
return;
}if(m==2){
cout<<n<<endl;
for(int i=1; i<=n; ++i)cout<<"++\n";
return;
}if(m==3){
cout<<n+1<<endl;
for(int i=1; i<=n; ++i)cout<<"+-+\n";
return;
}
}
}if(min(n,m)<=5){
char matrix[n+1][m+1];
if(n<m){
cout<<n-3+m<<endl;
for(int i=1; i<=n; ++i){
for(int j=1; j<=m; ++j){
if(i<=3)matrix[i][j]='-';
else matrix[i][j]='+';
}
}
}else{
cout<<m-3+n<<endl;
for(int i=1; i<=n; ++i){
for(int j=1; j<=m; ++j){
if(j<=3)matrix[i][j]='+';
else matrix[i][j]='-';
}
}
}for(int i=1; i<=n; ++i){
for(int j=1; j<=n; ++j){
cout<<matrix[i][j];
}cout<<endl;
}return;
}
if(n%2==m%2 && n%2==0){
int cnt=n;
char matrix[n+2][m+2];
for(int i=1; i<=n; ++i)for(int j=1; j<=n; ++j)matrix[i][j]='#';
int dep=(n/2-1)/2;
for(int i=n/2; i<=n; ++i){
matrix[i][n/2]='-';
matrix[i][n/2+1]='-';
}
for(int i=1; i<n/2; ++i){
++cnt;
int l=1,r=n;
if(i%2) r=n/2+1;
else l=n/2;
for(int j=1; j<=n; ++j){
if(j>=l && j<=r) matrix[i][j]='+';
else matrix[i][j]='-';
}
}int L=n/2,w=2;
while(dep>0){
int cnt2=0;
w*=3;
// cout<<dep<<' '<<L<<endl;
for(int i=L; i<L+dep; ++i){//mb >n
++cnt2;
++cnt;
int cnt3=n/2+1;
if(i%2){
for(int j=1; j<=m; ++j){
if(matrix[i][j]=='-')continue;
if(cnt3<=0) matrix[i][j]='-';
else matrix[i][j]='+';
--cnt3;
}continue;
}for(int j=m; j>=1; --j){
if(matrix[i][j]=='-'){
//cout<<"hi "<<j<<endl;
continue;
}
if(cnt3<=0)matrix[i][j]='-';
else matrix[i][j]='+';
--cnt3;
}
}if(cnt2==0)break;
L+=dep;
cnt2/=2;
dep=(n/2-1)-(((L-1)+1)/2);
++dep;
if(n-w<(n/2)+1){
break;
}
for(int i=L; i<=n; ++i){
for(int j=n/2-(w/2)+1; j<=n/2+(w/2); ++j)matrix[i][j]='-';
}//break;
}for(int i=L; i<=n; ++i){
for(int j=1; j<=n; ++j)matrix[i][j]='-';
}cout<<cnt<<endl;
for(int i=1; i<=n; ++i)for(int j=1; j<=m; ++j){
cout<<matrix[i][j];
if(j==m)cout<<endl;
}return;
}
if(n%2==m%2 && n%2==1){
cout<<n+m-2<<endl;
for(int i=1; i<n; ++i)for(int j=1; j<=m; ++j){
if(j==m){
cout<<'+'<<endl;
continue;
}if(i%2){
if(j%2)cout<<'-';
else cout<<'+';
}else{
if(j%2)cout<<'+';
else cout<<'-';
}
}
for(int i=1; i<=m; ++i){
cout<<'-';
}cout<<endl;
return;
}
if(n*m<=36){
vt<pair<int,int>>lst;
char matrix[20][20];
for(int mask=0; mask<(1<<(n*m)); ++mask){
int x=1,y=1;
for(int i=0; i<n*m; ++i){
if(mask&(1<<i)){
matrix[x][y]='+';
}else matrix[x][y]='-';
++y;
if(y>m){
++x;
y=1;
}
}
int cnt=0;
for(int i=1; i<=n; ++i){
int heh=0;
for(int j=1; j<=m; ++j)heh+=(matrix[i][j]=='+');
if(heh>m-heh)++cnt;
}for(int j=1; j<=m; ++j){
int heh=0;
for(int i=1; i<=n; ++i)heh+=(matrix[i][j]=='-');
if(heh>n-heh)++cnt;
}lst.pb({cnt,mask});
}sort(all(lst));
int mask=lst.back().Y;
cout<<lst.back().X<<endl;
int x=1,y=1;
for(int i=0; i<n*m; ++i){
if(mask&(1<<i)){
matrix[x][y]='+';
}else matrix[x][y]='-';
++y;
if(y>m){
++x;
y=1;
}
}
for(int i=1; i<=n; ++i){
for(int j=1; j<=m; ++j){
cout<<matrix[i][j];
}cout<<endl;
}return;
}
}
int main(){
//srand(time(0));
//freopen("hotel.in","r",stdin);
//freopen("hotel.out","w",stdout);
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int tt=1,lolol=0;
cin>>tt;
while(tt--) {
//cout<<"Case "<<++lolol<<": ";
solve();
}
}
Compilation message
stones.cpp: In function 'int main()':
stones.cpp:222:11: warning: unused variable 'lolol' [-Wunused-variable]
222 | int tt=1,lolol=0;
| ^~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Incorrect |
3 ms |
340 KB |
Wrong answer |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
24 ms |
1332 KB |
Wrong answer |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
22 ms |
1300 KB |
in the table A+B is not equal to 44 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Incorrect |
3 ms |
340 KB |
Wrong answer |
| 5 |
Halted |
0 ms |
0 KB |
- |
