Submission #788566

#	Time	Username	Problem	Language	Result	Execution time	Memory
788566		BidoTeima	Red-blue table (IZhO19_stones)	C++17	27 / 100	25 ms	1276 KiB

stones

#include <bits/stdc++.h>
using namespace std;  
int main() { 
    int t;
    cin>>t;
    while(t--){
        int n,m;
        cin>>n>>m;
        bool s = 0;
        if(n < m){
            swap(n, m);
            s = 1;
        }
        char grid[n][m];
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                grid[i][j]='+';
            }
        }
        for(int i = 0; i < n/2+1; i++){
            for(int j = 0; j < (m-1)/2; j++){
                grid[i][j]='-';
            }
        }
        cout<<n+(m-1)/2<<'\n';
        if(s){
            for(int j = 0; j < m; j++){
                for(int i = 0; i < n; i++){
                    cout<<(grid[i][j]=='+'?'-':'+');
                }
                cout<<'\n';
            }
        }else{
            for(int i = 0; i < n; i++){
                for(int j = 0; j < m; j++){
                    cout<<grid[i][j];
                }
                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