# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
500240 | reni | Red-blue table (IZhO19_stones) | C++14 | 25 ms | 2252 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>
#pragma GCC optimize ("-O3")
#define endl '\n'
using namespace std;
char s[1003][1003];
long long br[1003];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n,m,i,j,t,ans,i2, num=0;
bool isf;
cin>>t;
while(t--)
{
cin>>n>>m;
isf=0;
if(n<m){swap(n,m); isf=1;}
ans=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
s[i][j]='+';
}
br[i]=0;
}
num=0;j=1;
for(i=1;i<=n;i++)
{
if(br[i]==m-(m/2+1))break;
s[i][j]='-';
br[i]++;num++;
if(num==(n/2+1)){num=0;ans++;j++;}
if(i==n)i=0;
}
ans+=n;
cout<<ans<<endl;
if(!isf)
{
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
cout<<s[i][j];
} cout<<endl;
}
}
else
{
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
if(s[j][i]=='+')cout<<'-';
else cout<<'+';
} cout<<endl;
}
}
}
}
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... |