제출 #328350

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
328350		ssense	Red-blue table (IZhO19_stones)	C++14	0 / 100	33 ms	1388 KiB

stones

#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define NMAX 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define endl '\n'
#define fr first
#define int ll
#define ld long double


int ceildiv(int one, int two) {
    if (one % two == 0) {return one / two;}
    else {return one / two + 1;}
} int power(int n, int pow, int m) {
    if (pow == 0) return 1;
    if (pow % 2 == 0) {
        ll x = power(n, pow / 2, m);
        return (x * x) % m;
    }
    else return (power(n, pow - 1, m) * n) % m;
} int gcd(int a, int b) {
    if (!b)return a;
    return gcd(b, a % b);
} int factorial(int n, int mod) {
    if (n > 1)
        return (n * factorial(n - 1, mod)) % mod;
    else
        return 1;
} int lcm(int a, int b) {
    return (a * b) / gcd(a, b);
} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}


void solve()
{
    int n, m;
    cin >> n >> m;
    if (n >= m)
    {
        vector<char> a;
        int min = (m - 1) / 2;
        for (int i = 0; i < m; i++)
        {
            if (i % 2 && min)
            {
                a.pb('-');
            }
            else
            {
                a.pb('+');
            }
        }
        for (int i = 0; i < n; i++)
        {
            for (auto x : a)
            {
                cout << x;
            }
            cout << endl;
        }
    }
    else
    {
        swap(n, m);
        vector<char> a;
        int min = (m - 1) / 2;
        for (int i = 0; i < m; i++)
        {
            if (i % 2 && min)
            {
                a.pb('+');
            }
            else
            {
                a.pb('-');
            }
        }
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                cout << a[i];
            }
            cout << endl;
        }
    }
}

int32_t main() {
    startt
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }
}
/*
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
*/

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