Submission #1323201

#	Time	Username	Problem	Language	Result	Execution time	Memory
1323201		islam_2010	Red-blue table (IZhO19_stones)	C++20	27 / 100	21 ms	1408 KiB

stones

#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int sz = 1e5+5;


void solve() {
    int n,  m;
    cin >> n >> m;
    if(n <= m){
        
        int plus = (n-1)/2;
        cout << m + plus << endl;
        for(int i = 0; i < plus; i++){
            for(int j = 0; j < m; j++){
                cout << '+';
            }cout << endl;
        }for(int i = 0; i < n-plus; i++){
            for(int j = 0; j < m; j++){
                cout << '-';
            }cout << endl;
        }
    }else {
        int minus = (m-1)/2;
        cout << n + minus << endl;
        for(int i  = 0; i < n; i++){
            for(int j = 0; j < minus; j++){
                cout << '-';
            }for(int j = 0; j < m-minus; j++){
                cout << '+';
            }cout << endl;
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--){
        solve();
    } 
}

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