# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549299 | krit3379 | Red-blue table (IZhO19_stones) | C++17 | 96 ms | 3956 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 N 1005
int board[N][N],cnt[N];
priority_queue<pair<int,int>> q;
void sol(){
int n,m,nn,mm,ma,ans,a,i,j,cou;
scanf("%d %d",&n,&m);
nn=n/2+1;
mm=m/2+1;
ans=0,ma=a=n;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++)board[i][j]=0;
cnt[i]=m;
}
for(i=1;i<=m;i++){
for(j=1;j<=n;j++){
q.push({cnt[j],j});
}
cou=nn;
while(!q.empty()&&cou>0){
auto [x,y]=q.top();
q.pop();
if(--cnt[y]<mm)a--;
board[y][i]=1;
cou--;
}
if(a+i>ma)ma=a+i,ans=i;
while(!q.empty())q.pop();
}
printf("%d\n",ma);
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(j<=ans)printf("%c",board[i][j]?'-':'+');
else printf("+");
}
printf("\n");
}
}
int main(){
int t;
scanf("%d",&t);
while(t--)sol();
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... |