제출 #669965

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
669965		YENGOYAN	Red-blue table (IZhO19_stones)	C++17	43 / 100	65 ms	2128 KiB

stones

#include <iostream>
#include <vector>

using namespace std;

int calc(vector<vector<char>>& v) {
    int cnt = 0;
    for (int i = 0; i < v.size(); i++) {
        int c = 0;
        for (int j = 0; j < v[i].size(); j++) {
            if (v[i][j] == '+') c++;
        }
        if (c > v[i].size() / 2) cnt++;
    }
    for (int j = 0; j < v[0].size(); j++) {
        int c = 0;
        for (int i = 0; i < v.size(); i++) {
            if (v[i][j] == '-') {
                c++;
            }
        }
        if (c > v.size() / 2) cnt++;
    }
    return cnt;
}

void malSol(int n, int m) {
    //cout << "Amerikayi miacyal nahangner\n";
    /*
        --------
        --------
        --------
        ++++++++
        ++++++++

    */
    if (n + (m + 1) / 2 - 1 > m + (n + 1) / 2 - 1) {
        cout << n + (m + 1) / 2 - 1 << endl;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (j <= m / 2 + 1) cout << '+';
                else cout << '-';
            }
            cout << "\n";
        }
    }
    else {
        cout << m + (n + 1) / 2 - 1 << endl;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                if (i <= n / 2 + 1) cout << '-';
                else cout << '+';
            }
            cout << "\n";
        }
    }
}

int malSol1(int n, int m) {
    bool f = 0;
    if (n + (m + 1) / 2 < m + (n + 1) / 2) {
        f = 1;
        swap(n, m);
    }
    vector<vector<char>> vec(n);
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m / 2; j++) vec[i].push_back('+');
        for (int j = 0; j < cnt; j++) vec[i].push_back('-');
        vec[i].push_back('+');
        for (int j = 0; j < (m + 1) / 2 - 1 - cnt; j++) vec[i].push_back('-');
        cnt++;
        if (cnt == m - m / 2) cnt = 0;
    }
    int res = calc(vec);
    return max(res, max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1));
}

void printmalSol(int n, int m, bool flanfstan) {
    bool f = 0;
    if (n + (m + 1) / 2 < m + (n + 1) / 2) {
        f = 1;
        swap(n, m);
    }
    if (n == 7 && flanfstan) n = 6;
    else if (flanfstan) m = 6;
    vector<vector<char>> vec(n);
    int cnt = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m / 2; j++) vec[i].push_back('+');
        for (int j = 0; j < cnt; j++) vec[i].push_back('-');
        vec[i].push_back('+');
        for (int j = 0; j < (m + 1) / 2 - 1 - cnt; j++) vec[i].push_back('-');
        cnt++;
        if (cnt == m - m / 2) cnt = 0;
    }
    int res = calc(vec);
    if (max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > res && !flanfstan) {
        if (f) swap(n, m);
        malSol(n, m);
        return;
    }
    cout << flanfstan + res << endl;
    if (!f) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cout << vec[i][j];
            }
            if (m == 6 && flanfstan) cout << '-';
            cout << endl;
        }
        if (n == 6 && flanfstan) for (int i = 0; i < m; i++) cout << '+';
        cout << endl;
        return;
    }
    for (int j = 0; j < m; j++) {
        for (int i = 0; i < n; i++) {
            if (vec[i][j] == '+') cout << '-';
            else cout << '+';
        }
        if (m == 6 && flanfstan) cout << '-';
        cout << endl;
    }
    if (n == 6 && flanfstan) for (int i = 0; i < m; i++) cout << '+';
    cout << endl;
}

void solve() {
    int n, m; cin >> n >> m;
    if (n == 6 || m == 6) {
        printmalSol(n, m, 0);
        return;
    }
    if (n == 7 && m % 2 == 0) {
        printmalSol(n, m, 1);
        return;
    }
    if (m == 7 && n % 2 == 0) {
        printmalSol(n, m, 1);
        return;
    }
    if (min(m, n) <= 3 || (n <= 4 && m <= 4)) {
        malSol(n, m);
        return;
    }
    else if (n % 2 == 0 && m % 2 == 0 && min(m, n) > 5) {
        cout << n + m - 4 << "\n";
        for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
        for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
        for (int i = 2; i < n; i++) {
            if (i % 2) {
                for (int j = 0; j < m / 2 + 1; j++) cout << "+";
                for (int j = m / 2 + 1; j < m; j++) cout << "-";
                cout << "\n";
            }
            else {
                for (int j = m / 2 + 1; j < m; j++) cout << "-";
                for (int j = 0; j < m / 2 + 1; j++) cout << "+";
                cout << "\n";
            }
        }
    }
    else if (n % 2 == 0 && m % 2 && min(m, n) > 5) {
        cout << n + m - 4 << "\n";
        for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
        for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
        m--;
        for (int i = 2; i < n; i++) {
            if (i % 2) {
                for (int j = 0; j < m / 2 + 1; j++) cout << "+";
                for (int j = m / 2 + 1; j < m; j++) cout << "-";
                // cout << "\n";
            }
            else {
                for (int j = m / 2 + 1; j < m; j++) cout << "-";
                for (int j = 0; j < m / 2 + 1; j++) cout << "+";
                // cout << "\n";
            }
            cout << "-\n";
        }
        return;
    }
    else if (n % 2 && m % 2 == 0 && min(m, n) > 5) {
        cout << n + m - 4 << "\n";
        for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
        for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
        for (int i = 2; i < n; i++) {
            if (i % 2) {
                for (int j = 0; j < m / 2 + 1; j++) cout << "+";
                for (int j = m / 2 + 1; j < m; j++) cout << "-";
                cout << "\n";
            }
            else {
                for (int j = m / 2 + 1; j < m; j++) cout << "-";
                for (int j = 0; j < m / 2 + 1; j++) cout << "+";
                cout << "\n";
            }
        }
        for (int i = 0; i < m; i++) cout << "+"; cout << "\n";
        return;
    }
    else {
        if (n % 2) {
            if (malSol1(n, m) > n + m - 2 - (1 - (m % 2))) {
                printmalSol(n, m, 0);
                return;
            }
            cout << n + m - 2 - (1 - (m % 2)) << endl;
        }
        else {
            // return;
            if (malSol1(n, m) > m - 1 - (1 - (m % 2)) + n - 2) {
                printmalSol(n, m, 0);
                return;
            }
            cout << m - 1 - (1 - (m % 2)) + n - 2 << endl;
        }
        vector<vector<char>> vec(n);
        for (int i = 0; i < m; i++) vec[0].push_back('-');
        if (n % 2 == 0) for (int i = 0; i < m; i++) vec[1].push_back('-');
        for (int i = 1 + (1 - (n % 2)); i < n; i++) {
            if (i % 2) {
                for (int j = 1; j <= m / 2 + 1; j++) vec[i].push_back('+');
                for (int j = m / 2 + 2; j <= m; j++) vec[i].push_back('-');
            }
            else {
                for (int j = m / 2 + 2; j <= m; j++) vec[i].push_back('-');
                for (int j = 1; j <= m / 2 + 1; j++) vec[i].push_back('+');
            }
        }
        for (int i = 0; i < vec.size(); i++) {
            for (int j = 0; j < vec[i].size(); j++) {
                cout << vec[i][j];
            }
            cout << endl;
        }
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(NULL), cout.tie(NULL);
    int t; cin >> t; while (t--)
        solve();
}

컴파일 시 표준 에러 (stderr) 메시지

stones.cpp: In function 'int calc(std::vector<std::vector<char> >&)':
stones.cpp:8:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |     for (int i = 0; i < v.size(); i++) {
      |                     ~~^~~~~~~~~~
stones.cpp:10:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |         for (int j = 0; j < v[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~
stones.cpp:13:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |         if (c > v[i].size() / 2) cnt++;
      |             ~~^~~~~~~~~~~~~~~~~
stones.cpp:15:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for (int j = 0; j < v[0].size(); j++) {
      |                     ~~^~~~~~~~~~~~~
stones.cpp:17:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |         for (int i = 0; i < v.size(); i++) {
      |                         ~~^~~~~~~~~~
stones.cpp:22:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |         if (c > v.size() / 2) cnt++;
      |             ~~^~~~~~~~~~~~~~
stones.cpp: In function 'int malSol1(int, int)':
stones.cpp:60:10: warning: variable 'f' set but not used [-Wunused-but-set-variable]
   60 |     bool f = 0;
      |          ^
stones.cpp: In function 'void solve()':
stones.cpp:148:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  148 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:148:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  148 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                  ^~~~
stones.cpp:149:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  149 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:149:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  149 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                  ^~~~
stones.cpp:165:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  165 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:165:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  165 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                  ^~~~
stones.cpp:166:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  166 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:166:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  166 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                  ^~~~
stones.cpp:185:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  185 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:185:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  185 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                  ^~~~
stones.cpp:186:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  186 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:186:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  186 |         for (int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                  ^~~~
stones.cpp:199:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  199 |         for (int i = 0; i < m; i++) cout << "+"; cout << "\n";
      |         ^~~
stones.cpp:199:50: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  199 |         for (int i = 0; i < m; i++) cout << "+"; cout << "\n";
      |                                                  ^~~~
stones.cpp:231:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  231 |         for (int i = 0; i < vec.size(); i++) {
      |                         ~~^~~~~~~~~~~~
stones.cpp:232:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  232 |             for (int j = 0; j < vec[i].size(); j++) {
      |                             ~~^~~~~~~~~~~~~~~

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