oj.uz

Submission #284769

# Submission time Handle Problem Language Result Execution time Memory
284769 2020-08-28T02:36:58 Z dantoh000 Red-blue table (IZhO19_stones) C++14
11 / 100
 70 ms 4904 KB 
#include <bits/stdc++.h>
using namespace std;
int ans[1005][1005];
int rct[1005];
int cct[1005];
int main(){
    int tc;
    scanf("%d",&tc);
    while (tc--){
        int n,m;
        scanf("%d%d",&n,&m);
        int flag = 0;
        int flag2 = 0;
        int flag3 = 0;
        if (n < m){
            flag = 1;
            swap(n,m);
        }
        if (n%2 == 0) {
            flag2 = 1;
            n--;
        }
        if (m%2 == 0){
            flag3 = 1;
            m--;
        }
        for (int i = 0; i < n; i++) rct[i] = 0;
        for (int j = 0; j < m; j++) cct[j] = 0;
        for (int i = 0; i < n; i++){
            int num = (m-1)/2;
            for (int j = 0; j < m; j++){
                if ((i == n-1 && (m-1)/2 >= 1) || cct[j]+1 < n-cct[j]-1 && num){
                    cct[j]++;
                    num--;
                    rct[i]++;
                    ans[i][j] = 1;
                }
                else ans[i][j] = 0;
            }
        }
        int sum = 0;
        if (flag2){
            n++;
            for (int i = 0; i < m; i++){
                if (m > 2){
                    ans[n-1][i] = 1;
                    cct[i]++;
                    rct[n-1]++;
                }
            }
        }
        if (flag3){
            m++;
            for (int i = 0; i < n; i++){
                if (m > 1){
                    ans[i][m-1] = 0;
                }
                else{
                    ans[i][m-1] = 1;
                    cct[m-1]++;
                    rct[i]++;
                }
            }
        }
        for (int i = 0; i < n; i++){
            if (rct[i] < m-rct[i]) {
                //printf("row %d : %d / %d\n",i,rct[i],m);
                sum++;
            }
        }
        for (int i = 0; i < m; i++){
            if (cct[i] > n-cct[i]) {
                //printf("col %d : %d / %d\n",i,cct[i],n);
                sum++;
            }
        }
        if (sum < n+(m-1)/2){
            sum = n+(m-1)/2;
            for (int i = 0; i < n; i++){
                for (int j = 0; j < m; j++){
                    if (j < (m-1)/2) ans[i][j] = 1;
                    else ans[i][j] = 0;
                }
            }
        }
        printf("%d\n",sum);
        if (flag){
            for (int i = 0; i < m; i++){
                for (int j = 0; j < n; j++){
                    printf("%c",ans[j][i]?'+':'-');
                }
                printf("\n");
            }
        }
        else{
            for (int i = 0; i < n; i++){
                for (int j = 0; j < m; j++){
                    printf("%c",ans[i][j]?'-':'+');
                }
                printf("\n");
            }
        }



    }

}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:32:73: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   32 |                 if ((i == n-1 && (m-1)/2 >= 1) || cct[j]+1 < n-cct[j]-1 && num){
      |                                                   ~~~~~~~~~~~~~~~~~~~~~~^~~~~~
stones.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    8 |     scanf("%d",&tc);
      |     ~~~~~^~~~~~~~~~
stones.cpp:11:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   11 |         scanf("%d%d",&n,&m);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB in the table A+B is not equal to 4

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 512 KB in the table A+B is not equal to 6

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB in the table A+B is not equal to 4

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 1784 KB Output is correct
2 Correct 56 ms 4728 KB Output is correct
3 Correct 54 ms 4904 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 70 ms 1912 KB in the table A+B is not equal to 89
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 0 ms 384 KB in the table A+B is not equal to 4