제출 #344204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344204		Sprdalo	Red-blue table (IZhO19_stones)	C++17	27 / 100	38 ms	1876 KiB

stones

#include <bits/stdc++.h>

using namespace std;

#define int ll
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pi> vp;
typedef vector<pl> vpl;

signed main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr); 
    cerr.tie(nullptr);    

    int t;
    cin >> t;

    for (int e = 0; e < t; ++e){
        int n, m;
        cin >> n >> m;

        int k = 0;
        if (n > m)
            k = 1;

        vector<vi> a(n, vi(m, k));

        if (n>m){
            for (int j = 0; j < (m-1)/2; ++j){
                for (int i = 0; i < n/2 + 1; ++i){
                    a[i][j] = 0;
                }
            }
        } else {
            for (int i = 0; i < (n-1)/2; ++i){
                for (int j = 0; j < m/2 + 1; ++j){
                    a[i][j] = 1;
                }
            }
        }

        int sol = 0;
        for (int i = 0; i < n; ++i){
            int x = 0;
            for (int j = 0; j < m; ++j){
                x += a[i][j];
            }
            if (x > m/2)
                ++sol;
        }

        for (int j = 0; j < m; ++j){
            int x = 0;
            for (int i = 0; i < n; ++i){
                x += 1 - a[i][j];
            }
            if (x > n/2)
                ++sol;
        }

        cout << sol << '\n';
        for (int i = 0; i < n; ++i){
            for (int j = 0; j < m; ++j){
                if (a[i][j])
                    cout << "+";
                else
                    cout << "-";
            }
            cout << '\n';
        }
    }
}

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