Submission #498910

#	Time	Username	Problem	Language	Result	Execution time	Memory
498910		yahyobekabdunazarov	Red-blue table (IZhO19_stones)	C++17	0 / 100	23 ms	1228 KiB

stones

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
void solve(){
    int n, m;
    cin >> n >> m;
    if(n==1){
        cout << m << endl;
        
        for(int j=0; j<m; j++){
            cout << "-";
        }
            
    }
    else if(m==1){
        cout << n << endl;
        for(int i=0; i<n; i++){
            cout << "+\n";
        }  
    }
    else if(n<m){
       cout << n/2+n%2-1+(m+m%2-1-(n/2+n%2-1)) << endl;
       for(int i=0; i<n; i++){
            for(int j=0; j<m; j++){
                if(j<ceil(m/2)+m%2-1){
                    cout << "-";
                }
                else{
                    cout << "+";
                }
            }
            cout << "\n";
        } 
    }
    else if(n>m){ 
       cout << n+(m-n/2-n%2) << endl;
       for(int i=0; i<n; i++){
            for(int j=0; j<m; j++){
                if(j<ceil(m/2)+m%2-1){
                    cout << "-";
                }
                else{
                    cout << "+";
                }
            }
            cout << "\n";
        } 
    }
    else{
       cout << n+ceil(n/2)+n%2-1 << endl;
       for(int i=0; i<n; i++){
            for(int j=0; j<m; j++){
                if(j<ceil(m/2)+m%2-1){
                    cout << "-";
                }
                else{
                    cout << "+";
                }
            }
            cout << "\n";
        } 
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

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