# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231039 | jamielim | Red-blue table (IZhO19_stones) | C++14 | 15 ms | 1440 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;
int halfh=ceil((double)(n)/(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(2*(m-l)>=m&&2*(m-u)>=m)a=n;
else if(2*(m-l)>=m)a=max(n/2,n-(i*halfh)%n);
else a=n/2;
if(i+a>ans){
ans=i+a;
b=i;
}
}
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';
}
for(int i=0;i<b*halfh;i++){
grid[i%n][i/halfh]='-';
}
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... |