Submission #499254

#	Time	Username	Problem	Language	Result	Execution time	Memory
499254		RedBoy	Red-blue table (IZhO19_stones)	C++11	100 / 100	34 ms	2300 KiB

stones

#include <iostream>
#include <cstring>

using namespace std;

const int N = 1005;

int T;
int cont[N];
bool marked[N][N];

int solve(int n, int m)
{
    int maxN = (n - 1) / 2, minM = m / 2 + 1, index = 1, rowCont = 0;

    for(int i = 1; i <= n; i++)
    {
        int j;
        for(j = 1; j <= minM; j++)
        {
            while(cont[index] >= maxN && index <= m)
                index++;
            if(index > m)
                break;

            cont[index]++;
            marked[i][index] = 1;

            if(index == m)
                index = 1;
            else
                index++;
        }

        if(j == minM + 1)
            rowCont++;
    }

    /*
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
            cout << marked[i][j] << ' ';
        cout << '\n';
    }
    */

    return m + rowCont;
}

void print(int n, int m, int val, bool inverted)
{
    cout << val << '\n';
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            if(!inverted)
                cout << (marked[i][j] ? "+" : "-");
            else
                cout << (marked[j][i] ? "-" : "+");
        }
        cout << '\n';
    }
}

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

    cin >> T;
    while(T--)
    {
        memset(marked, 0, sizeof marked);
        memset(cont, 0, sizeof cont);
        int n, m;
        cin >> n >> m;

        if(n <= m)
            print(n, m, solve(n, m), 0);
        else
            print(n, m, solve(m, n), 1);
    }

    return 0;
}

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