Submission #488647

#	Time	Username	Problem	Language	Result	Execution time	Memory
488647		Mihai7218	Red-blue table (IZhO19_stones)	C++14	27 / 100	31 ms	1220 KiB

stones

#include <iostream>
using namespace std;
int t, n, m, mop;
int main()
{
    cin >> t;
    for (int tc = 1; tc <= t; tc++)
    {
        cin >> n >> m;
        if (n > m)
        {
            cout << n + (m/2)-1+(m%2) << '\n';
            mop = (m/2)-1+(m%2);
            for (int i = 1; i <= n; i++)
            {
                for (int j = 1; j <= m; j++)
                {
                    if (mop-j >= 0)
                    {
                        cout << '-';
                    }
                    else cout << '+';
                }
                cout << '\n';
            }
        }
        else
        {
            cout << m + (n/2)-1+(n%2) << '\n';
            mop = (n/2)-1+(n%2);
            for (int i = 1; i <= n; i++)
            {
                for (int j = 1; j <= m; j++)
                {
                    if (mop-i >= 0)
                    {
                        cout << '+';
                    }
                    else cout << '-';
                }
                cout << '\n';
            }
        }
    }
    return 0;
}

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