# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673324 | Baytoro | Red-blue table (IZhO19_stones) | C++17 | 23 ms | 1412 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
#define cnt(x) __builtin_popcount(x)
void fopn(string name){
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
const int INF=1e18,mod=998244353;
int n,m;
char ar[1005][1005];
void solve(){
cin>>n>>m;
int swaped=0;
if(n>m){
swap(n,m);
swaped=1;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(swaped)
ar[i][j]='+';
else
ar[i][j]='-';
}
}
cout<<m+min(n,(n/2-!(n%2)*m/(m/2+1)))<<endl;
for(int i=1,k=1;i<=min(n,n/2-!(n%2)*m/(m/2+1));i++){
for(int j=1;j<=m/2+1;j++,k++){
if(k==m+1) k=1;
if(swaped)
ar[i][k]='-';
else
ar[i][k]='+';
}
}
if(!swaped)
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)
cout<<ar[i][j];
cout<<endl;
}
else
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++)
cout<<ar[j][i];
cout<<endl;
}
}
main(){
//fopn("newbarn");
ios;
int T=1;
cin>>T;
while(T--){
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |