Dominoes（贪心）

C. Dominoes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

During the break, we decided to relax and play dominoes. Our box with Domino was empty, so we decided to borrow the teacher's dominoes.

The teacher responded instantly at our request. He put nm dominoes on the table as an n × 2m rectangle so that each of the n rows contained m dominoes arranged horizontally. Each half of each domino contained number (0 or 1).

We were taken aback, and the teacher smiled and said: "Consider some arrangement of dominoes in an n × 2m matrix. Let's count for each column of the matrix the sum of numbers in this column. Then among all such sums find the maximum one. Can you rearrange the dominoes in the matrix in such a way that the maximum sum will be minimum possible? Note that it is prohibited to change the orientation of the dominoes, they all need to stay horizontal, nevertheless dominoes are allowed to rotate by 180 degrees. As a reward I will give you all my dominoes".

We got even more taken aback. And while we are wondering what was going on, help us make an optimal matrix of dominoes.

Input

The first line contains integers n, m (1 ≤ n, m ≤ 103).

In the next lines there is a description of the teachers' matrix. Each of next n lines contains m dominoes. The description of one domino is two integers (0 or 1), written without a space — the digits on the left and right half of the domino.

Output

Print the resulting matrix of dominoes in the format: n lines, each of them contains m space-separated dominoes.

If there are multiple optimal solutions, print any of them.

Sample test(s)

input

2 3
01 11 00
00 01 11

output

11 11 10
00 00 01

input

4 1
11
10
01
00

output

11
10
01
00

Note

Consider the answer for the first sample. There, the maximum sum among all columns equals 1 (the number of columns is 6, and not 3). Obviously, this maximum can't be less than 1, then such matrix is optimal.

Note that the dominoes can be rotated by 180 degrees.

 

    题意：

    给出 N,M（1 <= n,m <= 10 ^ 3）代表，一张牌有两个数字，故有N行，2 * m列。给出原始的摆放顺序，每一单列1代表有牌，0代表没牌，求每列的牌子数，取最多的牌子数（是最多的数量，而不是最大的数量）。要如何重新摆放使得每一单列大于等于最多的牌子数，牌子可以任意顺序摆放，并且可以180°转动。

   

    思路：

    贪心。一张牌最多有4种可能，11，01，10，00。故先摆放好11再摆放01，10，剩下的摆放00即可。1张11 = 一张01 + 一张10，若11不能刚好摆放到满排（即11的数量不能整除列数m），之后的 01和 10 加错行赋值，顺序从列尾往前赋值。

 

    AC：

#include<stdio.h>
#include<string.h>
int fin[1005][1005];
int main()
{
    int num[5],n,m,ans;
    scanf("%d%d",&n,&m);
    memset(num,0,sizeof(num));
    for(int i = 1;i <= n * m;i++)
    {
        int ans;
        scanf("%d",&ans);
        if(ans == 1 || ans == 10) num[1]++;
        if(ans == 11)             num[2]++;
    }
    int r,c = num[2] % m;
    if(num[2] % m)  r = num[2] / m + 1;
    else            r = num[2] / m;
    for(int i = 1;i <= r;i++)
    {
        for(int j = 1;j <= m;j++)
        {
            if(num[2])
            {
                printf("11");
                num[2]--;
            }
            else
            {
                printf("01");
                num[1]--;
            }
            if(j != m) printf(" ");
        }
        printf("\n");
    }
    int r1 = r + 1;
    c = m;
    int temp = 0;
    while(num[1])
    {
        if(!temp) fin[r1][c] = 10;
        else      fin[r1][c] = 1;
        c--;
        num[1]--;
        if(!c)
        {
            c = m;
            r1++;
            if(temp) temp = 0;
            else     temp = 1;
        }
    }
    while(r1 < n)
    {
        fin[r1][c] = 0;
        c--;
        if(!c)
        {
            c = m;
            r1++;
        }
    }
    r++;
    for(r;r <= n;r++)
    {
        printf("%02d",fin[r][1]);
        for(int j = 2;j <= m;j++)
            printf(" %02d",fin[r][j]);
        printf("\n");
    }
    return 0;
}