Submission #333663

#	Time	Username	Problem	Language	Result	Execution time	Memory
333663		vipghn2003	Red-blue table (IZhO19_stones)	C++14	0 / 100	36 ms	1900 KiB

stones

#include<bits/stdc++.h>

using namespace std;

int a[1005][1005];

void solve()
{
    int n,m;
    cin>>n>>m;
    bool swaps=false;
    if(n<m)
    {
        swap(n,m);
        swaps=true;
    }
    int res=0;
    int t=n/2;
    for(int i=1;i<=(m-1)/2;i++)
    {
        for(int j=1;j<=n;j++,t--)
        {
            a[j][res+1]=1;
            if(!t)
            {
                res++;
                t=n/2+1;
            }
        }
    }
    cout<<res+n<<'\n';
    if(swaps) swap(n,m);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            int cur=a[i][j];
            if(swaps) cur=(a[j][i]^1);
            if(cur) cout<<'-';
            else cout<<'+';
        }
        cout<<'\n';
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin>>t;
    while(t--) solve();
}

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