# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
341367 | ogibogi2004 | Red-blue table (IZhO19_stones) | C++14 | 94 ms | 1536 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;
int br[1024];
char table[1024][1024];
void solve()
{
int n,m,n1,m1;
cin>>n>>m;
n1=n/2+1;
m1=m/2+1;
int res1=m+(m*(n-n1))/m1;
int res2=n+(n*(m-m1))/n1;
memset(br,0,sizeof(br));
vector<int>v;
if(res1>res2)
{
//cout<<"*\n";
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
table[i][j]='-';
}
}
for(int j=1;j<=m;j++)
{
v.clear();
for(int i=1;i<=n;i++)
{
if(br[i]<m1)v.push_back(i);
}
for(int i=1;i<=n&&v.size()<n-n1;i++)
{
v.push_back(i);
}
for(int i=0;i<v.size()&&i<n-n1;i++)
{
table[v[i]][j]='+';
br[v[i]]++;
}
}
}
else
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
table[i][j]='+';
}
}
for(int i=1;i<=n;i++)
{
v.clear();
for(int j=1;j<=m;j++)
{
if(br[j]<n1)v.push_back(j);
}
for(int j=1;j<=m&&v.size()<m-m1;j++)
{
v.push_back(j);
}
for(int j=0;j<v.size()&&j<m-m1;j++)
{
table[i][v[j]]='-';
br[v[j]]++;
}
}
}
cout<<max(res1,res2)<<endl;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cout<<table[i][j];
}
cout<<endl;
}
}
int main()
{
int t;
cin>>t;
while(t--)solve();
return 0;
}
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... |