# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
480268 | luka1234 | Red-blue table (IZhO19_stones) | C++14 | 26 ms | 1300 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>
#define ll long long
#define ff first
#define ss second
using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int t;
cin>>t;
while(t--){
int n,m;
cin>>n>>m;
int mx=-1;
int xans,yans,p;
char a[n+1][m+1];
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
int p1=max(((m/2+1)-m+j),0);
int p2=n-(n/2+1);
if(i*p1<=j*p2){
if((i+j)>mx){
mx=i+j;
xans=i;
yans=j;
p=p1;
}
}
}
}
cout<<mx<<"\n";
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)
a[i][j]='-';
}
for(int i=1;i<=xans;i++){
for(int j=yans+1;j<=m;j++)
a[i][j]='+';
}
int pos=1;
for(int i=1;i<=xans;i++){
int v=min((pos+p-1),m);
int v1=p-(v-pos+1);
for(int j=pos;j<=v;j++)
a[i][j]='+';
for(int j=1;j<=v1;j++)
a[i][j]='+';
pos=v1+1;
if(v1==0)
pos=v+1;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)
cout<<a[i][j];
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... |