Submission #532489

#	Time	Username	Problem	Language	Result	Execution time	Memory
532489		dannyboy20031204	Red-blue table (IZhO19_stones)	C++17	11 / 100	23 ms	1832 KiB

stones

#include<bits/stdc++.h>
using namespace std;
#define ll long long
void db() {cout << '\n';}
template <typename T, typename ...U> void db(T a, U ...b){
    cout << a << ' ', db(b...);
}
void solve(){
    int n, m;
    cin >> n >> m;
    if (min(n, m) < 3){
        cout << max(n + (m - 1) / 2, m + (n - 1) / 2) << '\n';
        if (n + (m - 1) / 2 > m + (n - 1) / 2){
            for (int i = 0; i < n; i++){
                for (int j = 0; j < m; j++){
                    if (j % 2 == 0 or (m % 2 == 0 and j == m - 1)) cout << '+';
                    else cout << '-';
                }
                cout << '\n';
            }
        }
        else{
            for (int i = 0; i < n; i++){
                for (int j = 0; j < m; j++){
                    if (i % 2 == 0 or (n % 2 == 0 and i == n - 1)) cout << '-';
                    else cout << '+';
                }
                cout << '\n';
            }
        }
        return;
    }
    char ans[n][m];
    for (int i = 0; i < n - 1; i++) for (int j = 0; j < m - 1; j++) ans[i][j] = (i + j) % 2 ? '+' : '-';
    for (int i = 0; i < n; i++) ans[i][m - 1] = '+';
    for (int j = 0; j < m; j++) ans[n - 1][j] = '-';
    cout << n - 1 + m - 1 << '\n';
    for (auto &i : ans){
        for (char j : i) cout << j;
        cout << '\n';
    }
}
int main(){
    ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) solve();
}

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