제출 #330714

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330714		vitkishloh228	Red-blue table (IZhO19_stones)	C++14	27 / 100	2074 ms	784 KiB

stones

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
#define endl "\n"
int n, m;
int calc(vector<vector<int>>& a) {
    int cur = 0;
    for (int i = 0; i < n; ++i) {
        int x = 0;
        for (int j = 0; j < m; ++j) {
            if (a[i][j]) x++;
            else x--;
        }
        if (x > 0) cur++;
    }
    for (int j = 0; j < m; ++j) {
        int x = 0;
        for (int i = 0; i < n; ++i) {
            if (a[i][j]) x++;
            else x--;
        }
        if (x < 0) cur++;
    }
    return cur;
}
int main() {
    int tt;
    cin >> tt;
    while (tt--) {
        cin >> n >> m;
        vector<vector<int>> a(n, vector<int>(m));
        int max1 = 0;
        for (int i = -1; i < n; ++i) {
            for (int j = -1; j < m; ++j) {
                a = vector<vector<int>>(n, vector<int>(m));
                for (int k = 0; k <= i; ++k) {
                    for (int z = 0; z <= j; ++z) {
                        a[k][z] = 1;
                    }
                }
                int cur = calc(a);
                if (cur > max1) {
                    max1 = cur;
                }
            }
        }
        cout << max1 << endl;
        bool ok = false;
        for (int i = -1; i < n; ++i) {
            if (ok) continue;
            for (int j = -1; j < m; ++j) {
                a = vector<vector<int>>(n, vector<int>(m));
                for (int k = 0; k <= i; ++k) {
                    for (int z = 0; z <= j; ++z) {
                        a[k][z] = 1;
                    }
                }
                int cur = calc(a);
                if (cur == max1 && !ok) {
                    //max1 = cur;
                    for (auto elem : a) {
                        for (auto u : elem) {
                            if (u) cout << "+";
                            else cout << "-";
                        }
                        cout << endl;
                    }
                    cout << endl;
                    ok = true;
                }
            }
        }
    }
}

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