# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744555 | Andrei | Red-blue table (IZhO19_stones) | C++17 | 11 ms | 724 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;
/**
clin[i]
ccol[j]
a + b
n + m
n,m sunt impare
n + (m-1)/2
n = m
lin,col
+-+
+-+
+++
++-
++-
++-
*/
int t;
int n,m;
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>t;
while(t--)
{
cin>>n>>m;
if(n%2==1 && m%2==1)
{
cout<<max(n+(m-1)/2,m+(n-1)/2)<<"\n";
continue;
}
int maxim=0;
int anslin;
int anscol;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
int aux=0;
if(j>m-j)
aux+=i;
aux+=m-j;
if(i<n-i)
aux+=j;
if(aux>maxim)
{
maxim=aux;
anslin=i;
anscol=j;
}
}
}
if(maxim<m)
{
maxim=m;
anslin=0;
anscol=0;
}
cout<<maxim<<"\n";
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if(i<=anslin && j<=anscol)
cout<<"+";
else
cout<<"-";
}
cout<<"\n";
}
}
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... |