# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231333 | jamielim | Red-blue table (IZhO19_stones) | C++14 | 10 ms | 1408 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 main(){
int t;
scanf("%d",&t);
int n,m;
char grid[1005][1005];
while(t--){
scanf("%d%d",&n,&m);
int ans=0;
int b=0;
bool align=0;
int halfh=ceil((double)(n+1)/(double)2);
for(int i=0;i<=m;i++){
int a=0;
int l=floor((double)(i*halfh)/(double)(n)),u=ceil((double)(i*halfh)/(double)(n));
if(l<=m-l&&u<=m-u)a=n;
else if(l<=m-l)a=max(n-halfh,n-(i*halfh)%n);
else a=n-halfh;
if(i+a>ans){
ans=i+a;
b=i;
if(a==n-halfh)align=1;
else align=0;
}
}
printf("%d\n",ans);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
grid[i][j]='+';
}
grid[i][m]='\0';
}
if(align){
for(int i=0;i<b*halfh;i++){
grid[i%n][i/halfh]='-';
}
}else{
for(int i=0;i<b;i++){
for(int j=0;j<halfh;j++)grid[j][i]='-';
}
}
for(int i=0;i<n;i++)printf("%s\n",grid[i]);
}
}
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... |