제출 #898975

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

stones

#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <iomanip>
#include <cstring>
#include <limits.h>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long

const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll wmod = 998244353;
#define int long long

void solve(){
    int n, m;
    cin >> n >> m;
    char k = '+';
    if (n < m){
        swap(n, m);
        k = '-';
    }
    char a[n + 1][m + 1];
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            a[i][j] = k;
        }
    }
    if (k == '+')k = '-';
    else k = '+';
    for (int i = 1; i <= m - i; i++){
        for (int j = 1; true; j++){
            a[j][i] = k;
            if (j > m - j)break;
        }
    }int ans = 0;
    for (int i = 1; i <= n; i++){
        int cnt = 0;
        for (int j = 1; j <= m; j++){
            cnt += (a[i][j] == '+');
        }
        if (cnt > n - cnt)ans++;
    }
    for (int j = 1; j <= m; j++){
        int cnt = 0;
        for (int i = 1; i <= n; i++){
            cnt += (a[i][j] == '-');
        }
        if (cnt > m - cnt)ans++;
    }cout << ans << '\n';
    if (k == '+'){
        for (int i = 1; i <= m; i++){
            for (int j = 1; j <= n; j++){
                cout << a[i][j];
            }cout << '\n';
        }
    }
    else {
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= m; j++){
                cout << a[i][j];
            }cout << '\n';
        }
    }
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    ll 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