# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340107 | kkk | Red-blue table (IZhO19_stones) | C++14 | 39 ms | 3308 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<iostream>
#include<algorithm>
#define endl '\n'
using namespace std;
long long n,m;
char s[1003][1003],ans2[1002][1002];
bool p=false;
char k;
void sol()
{
long long i,j,d,a;
d=(n-1)/2*m;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
ans2[i][j]=k;
}
}
j=0,a=0;
for(i=0;i<d;i++)
{
if(k=='+')ans2[j][i%m]='-';
else ans2[j][i%m]='+';a++;
if(2*a>m){j++;a=0;}
}
cout<<m+j<<endl;
if(p)swap(m,n);
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(!p)s[i][j]=ans2[i][j];
else s[i][j]=ans2[j][i];
}
}
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cout<<s[i][j];
}cout<<endl;
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long t,i,j;
cin>>t;
for(i=0;i<t;i++)
{
cin>>n>>m;
p=false;k='-';
if(m<=n){swap(n,m);k='+';p=true;}
sol();
}
}
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... |