oj.uz

Submission #549296

# Submission time Handle Problem Language Result Execution time Memory
549296 2022-04-15T14:39:13 Z krit3379 Red-blue table (IZhO19_stones) C++17
42 / 100
 93 ms 3964 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 1005

int board[N][N],cnt[N];
priority_queue<pair<int,int>> q,t;

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++){
            if(cnt[j]>=mm)q.push({cnt[j],j});
            else t.push({cnt[j],j});
        }
        cou=nn;
        while(!t.empty()&&cou--){
            auto [x,y]=t.top();
            t.pop();
            cnt[y]--;
            board[y][i]=1;
        }
        while(!q.empty()&&cou--){
            auto [x,y]=q.top();
            q.pop();
            if(--cnt[y]<mm)a--;
            board[y][i]=1;
        }
        if(a+i>ma)ma=a+i,ans=i;
        while(!t.empty())t.pop();
        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

stones.cpp: In function 'void sol()':
stones.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d %d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~~
stones.cpp: In function 'int main()':
stones.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |     scanf("%d",&t);
      |     ~~~~~^~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Incorrect 3 ms 468 KB Wrong answer in test 5 29: 31 < 32
5 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 88 ms 1652 KB Wrong answer in test 23 57: 76 < 78
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 1740 KB Output is correct
2 Correct 88 ms 3964 KB Output is correct
3 Correct 93 ms 3244 KB Output is correct

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Incorrect 3 ms 468 KB Wrong answer in test 5 29: 31 < 32
5 Halted 0 ms 0 KB -