# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335822 | beksultan04 | Red-blue table (IZhO19_stones) | C++14 | 49 ms | 2412 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 int long long
#define pii pair<int,int>
#define OK puts("OK");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define pb push_back
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int m1[N],p[N];
char q[1001][1001];
main(){
int t;
scan1(t)
while (t--){
int i,j,n,m,ans=0;
scan2(n,m)
if (min(n,m) <= 4){
if (n <= m){
for (i=0;i<n;++i){
for (j=0;j<m;++j){
if (i < n/2+1){
q[i][j]='-';
m1[j]++;
}
else {
q[i][j]='+';
p[i]++;
}
}
}
}
else {
for (i=0;i<n;++i){
for (j=0;j<m;++j){
if (j < m/2+1){
q[i][j]='+';
p[i]++;
}
else {
m1[j]++;
q[i][j]='-';
}
}
}
}
ans = max(n,m);
ans += min(n-1,m-1)/2;
cout <<ans<<"\n";
for (i=0;i<n;++i){
for (j=0;j<m;++j){
cout <<q[i][j];
}
endi;
}
}
else if (min(n,m)<=6){
if (n <= m){
int cnt=0;
for (i=0;i<n;++i){
for (j=0;j<m;++j){
q[i][j]='-';
}
}
i=0;
j=0;
int mod = m/2+1;
while (i < (n-1)/2+1){
q[i][j]='+';
cnt++;
j++;
j%=m;
if (cnt%mod==0)
i++;
cnt%=mod;
}
ans = m;
ans+=(n-1)/2+1;
cout <<ans<<"\n";
for (i=0;i<n;++i){
for (j=0;j<m;++j){
cout <<q[i][j];
}
endi;
}
}
else {
int cnt=0;
for (i=0;i<n;++i){
for (j=0;j<m;++j){
q[i][j]='+';
}
}
i=0;
j=0;
int mod = n/2+1;
while (j < (m-1)/2+1){
q[i][j]='-';
cnt++;
i++;
i%=n;
if (cnt%mod==0)
j++;
cnt%=mod;
}
ans = n;
ans+=(m-1)/2+1;
cout <<ans<<"\n";
for (i=0;i<n;++i){
for (j=0;j<m;++j){
cout <<q[i][j];
}
endi;
}
}
}
else {
if (n <= m){
int cnt=0;
for (i=0;i<n;++i){
for (j=0;j<m;++j){
q[i][j]='-';
}
}
i=0;
j=0;
int mod = m/2+1;
ans = m;
while (i<n){
if ((p[j]+1)*2 >= n){
break;
}
q[i][j]='+';
p[j]++;
m1[i]++;
cnt++;
j++;
j%=m;
if (cnt%mod==0){
i++;
}
cnt%=mod;
}
for (i=0;i<n;++i){
if (m1[i] > m-m1[i])ans++;
}
}
else {
int cnt=0;
for (i=0;i<n;++i){
for (j=0;j<m;++j){
q[i][j]='+';
}
}
i=0;
j=0;
int mod = n/2+1;
ans = n;
while (1){
if ((p[i]+1)*2 >= m){
break;
}
q[i][j]='-';
p[i]++;
m1[j]++;
cnt++;
i++;
i%=n;
if (cnt-mod==0){
j++;
cnt=0;
}
}
for (i=0;i<m;++i){
if (m1[i] > n-m1[i])ans++;
}
}
cout <<ans<<"\n";
for (i=0;i<n;++i){
p[i]=0;
for (j=0;j<m;++j){
p[j]=0;
cout <<q[i][j];
}
endi;
}
}
for (i=0;i<n;++i)p[i]=m1[i]=0;
for (i=0;i<m;++i)p[i]=m1[i]=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... |