제출 #697453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
697453		stevancv	Red-blue table (IZhO19_stones)	C++14	15 / 100	28 ms	2988 KiB

stones

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e4 + 2;
const int inf = 2e9;
void Solve() {
    int n, m;
    cin >> n >> m;
    int ch = 0;
    if (n < m) {swap(n, m); ch = 1;}
    vector<vector<int>> a(n, vector<int>(m));
    int p = m * ((n + 1) / 2 - 1);
    int q = n / 2 + 1;
    int c = p / q;
    int i = 0;
    for (int j = 0; j < c; j++) {
        for (int z = 0; z < q; z++) {
            a[i][j] = 1;
            i = (i + 1) % n;
        }
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int u = 0;
        for (int j = 0; j < m; j++) {
            u += 1 - a[i][j];
        }
        if (2 * u > m) ans++;
    }
    for (int j = 0; j < m; j++) {
        int u = 0;
        for (int i = 0; i < n; i++) {
            u += a[i][j];
        }
        if (2 * u > m) ans++;
    }
    cout << ans << en;
    if (ch == 0) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (a[i][j] == 0) cout << '+';
                else cout << '-';
            }
            cout << en;
        }
    }
    else {
        for (int j = 0; j < m; j++) {
            for (int i = 0; i < n; i++) {
                if (a[i][j] == 0) cout << '-';
                else cout << '+';
            }
            cout << en;
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt; cin >> tt;
    while (tt--) Solve();
    return 0;
}

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