제출 #689781

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

stones

#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fr first
#define sc second
#define pw(x) (1ll << x)
#define bcnt(x) (__builtin_popcountll(x))

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;

template <typename T> inline bool umax (T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool umin (T &a, const T &b) { if (a > b) { a = b; return 1; } return 0; }

inline void solve () {
    int n, m; cin >> n >> m;
    if (n == 1) {
        cout << m << endl;
        cout << string(m, '-') << endl;
    }
    else if (m == 1) {
        cout << n << endl;
        for (int i = 0; i < n; ++i) cout << '+' << endl;
    }
    else {
        vector <string> a (n);
        for (int i = 0; i < n; ++i) {
            a[i] = string(m, ((i & 1) ? '+' : '-'));
        }
        int res = 0;
        for (int i = 0; i < n; ++i) {
            int s = 0;
            for (int j = 0; j < m; ++j) s += (a[i][j] == '+' ? +1 : -1);
            res += s > 0;
        }
        for (int i = 0; i < m; ++i) {
            int s = 0;
            for (int j = 0; j < n; ++j) s += (a[j][i] == '+' ? +1 : -1);
            res += s < 0;
        }
        cout << res << endl;
        for (auto i : a) cout << i << endl;
    }
    cout << endl;
}

signed main ()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif // LOCAL

    int t = 1; 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