제출 #674305

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
674305		Halym2007	Red-blue table (IZhO19_stones)	C++17	0 / 100	30 ms	1228 KiB

stones

#include <bits/stdc++.h>
#define ff first
#define ss second
#define cont continue;
#define sz size()
#define pb push_back
using namespace std;
typedef long long ll;
const int N = 100005;

void solve();
int a1, a2, t, n, m;
int main() {
	ios::sync_with_stdio(false);
 	cin.tie(0);
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
 	cin >> t;
    while ( t-- ) {
        cin >> n >> m;
        if (n == 1 or m == 1) {
            if (n >= m) {
                cout << n << "\n";
                for (int i = 1; i <= n; ++i) {
                    for (int j = 1; j <= m; ++j) {
                        cout << "+";
                    }
                    cout << "\n";
                }
            }
            else {
                cout << m << "\n";
                for (int i = 1; i <= n; ++i) {
                    for (int j = 1; j <= m; ++j) {
                        cout << "-";
                    }
                    cout << "\n";
                }
            }
        }
        else if (n >= m) {
            cout << n + ((m - 1) / 2) << "\n";
            for (int i = 1; i <= n; ++i) {
                a1 = (n / 2) + 1;
                for (int j = 1; j <= m; ++j) {
                    if (a1 >= 1) {
                        cout << "+";
                        a1--;
                    }
                    else cout << "-";   
                }
                cout << "\n";
            }
        }
        else {
            a1 = (n / 2) + 1;
            cout << m + ((n - 1) / 2) << "\n";
            for (int i = 1; i <= n; ++i) {
                if (a1 >= 1) {
                    for (int j = 1; j <= m; ++j) cout << "-";
                    a1--;
                }
                else {
                    for (int j = 1; j <= m; ++j) cout << "+";
                }
                cout << "\n";
            }
        }

        cout << "\n";
    }
}

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