Submission #992916

#	Time	Username	Problem	Language	Result	Execution time	Memory
992916		serkanrashid	Red-blue table (IZhO19_stones)	C++14	100 / 100	19 ms	2396 KiB

stones

#include <bits/stdc++.h>
#define endl "\n"

using namespace std;

const int maxn = 1001;

int n,m;
char tab[maxn][maxn];
bool swapnati;

void read()
{
    cin >> n >> m;

    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            tab[i][j] = '#';
        }
    }
    swapnati = false;

    if(n<m)
    {
        swapnati = true;
        swap(n,m);
    }

    int ans = n;

    int minusi = (m-1)/2 * n;
    int colonki = minusi / (n/2 + 1);
    minusi = colonki * (n/2+1);

    ans += colonki;

    cout << ans << endl;

    if(swapnati)
    {
        int old = 1;
        for(int j = 1; j <= colonki; j++)
        {
            for(int q = 1; q <= (n/2+1); q++)
            {
                tab[j][old] = '+';
                old++;
                if(old>n) old = 1;
            }
            for(int i = 1; i <= n; i++) if(tab[j][i]=='#') tab[j][i] = '-';
        }
        for(int i = 1; i <= n; i++)
        {
            for(int j = colonki + 1; j <= m; j++) tab[j][i] = '-';
        }
        swap(n,m);
    }
    else
    {
        int old = 1;
        for(int j = 1; j <= colonki; j++)
        {
            for(int q = 1; q <= (n/2+1); q++)
            {
                tab[old][j] = '-';
                old++;
                if(old>n) old = 1;
            }
            for(int i = 1; i <= n; i++) if(tab[i][j]=='#') tab[i][j] = '+';
        }
        for(int i = 1; i <= n; i++)
        {
            for(int j = colonki + 1; j <= m; j++) tab[i][j] = '+';
        }
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++) cout << tab[i][j];
        cout << endl;
    }
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int t;
	cin >> t;
	while(t--) read();
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