제출 #494593

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
494593		Amer	Red-blue table (IZhO19_stones)	C++14	0 / 100	7 ms	460 KiB

stones

#include <iostream>

using namespace std;

const int maxN = 8;

int marked[maxN][maxN];

int c[maxN];

int solve(int n, int m)
{
    ///N > M

    for(int i = 0;i < n;i++)
    {
        for(int j = 0;j < m;j++)
        {
            marked[i][j] = 0;
        }
    }

    int centerN = n / 2;
    int centerM = m / 2 - 1;

    for(int col = 0;col <= centerM; col++)
    {
        for(int row = col * centerN + col; row <= (col + 1) * centerN; row++)
        {
            if(row >= n)
            {
                break;
            }

            marked[row][col] = 1;
        }
    }

    int sum = n;

    for(int j = 0;j < m;j++)
    {
        int num = 0;

        for(int i = 0;i < n;i++)
        {

            if(marked[i][j] == 1)
            {
                num++;
            }
            else
            {
                break;
            }

            //cout<<marked[i][j]<<" ";
        }

        //cout<<num<<endl;
        //cout<<centerN + 1<<endl;

        if(num >= centerN + 1)
        {
            sum++;
        }

        //cout<<endl;
    }

    return sum;

    /*
    for(int i = 0;i < n;i++)
    {
        for(int j = 0;j < m;j++)
        {
            cout<<marked[i][j]<<" ";
        }
        cout<<endl;
    }
    */
}

void test(int n, int m)
{
    int sum = 0;

    if(n < m)
    {
        sum = solve(m, n);
    }
    else
    {
        sum = solve(n, m);
    }

    cout<<sum<<endl;

    for(int row = 0;row < n;row++)
    {
        for(int col = 0;col < m;col++)
        {
            if(marked[row][col] == 1)
            {
                cout<<"-";
            }
            else
            {
                cout<<"+";
            }
        }
        cout<<endl;
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin>>t;

    for(int i = 0;i < t;i++)
    {
        int n,m;

        cin>>n>>m;
        test(n,m);
    }
    return 0;
}

• Subtask 1: 0 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31