oj.uz

Submission #669629

# Submission time Handle Problem Language Result Execution time Memory
669629 2022-12-06T23:30:21 Z YENGOYAN Red-blue table (IZhO19_stones) C++17
69 / 100
 70 ms 2056 KB 
#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 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);
    if (max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > res) {
        if (f) swap(n, m);
        malSol(n, m);
        return;
    }
    cout << res << endl;
    if (!f) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                cout << vec[i][j];
            }
            cout << endl;
        }
        return;
    }
    for (int j = 0; j < m; j++) {
        for (int i = 0; i < n; i++) {
            if (vec[i][j] == '+') cout << '-';
            else cout << '+';
        }
        cout << endl;
    }
}

void solve() {
    int n, m; cin >> n >> m;
    if (min(m, n) <= 3 || (n <= 4 && m <= 4)) {
        malSol(n, m);
        return;
    }
    else if(n % 2 == 0 && m % 2 == 0 && min(m, n) > 6){
        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) > 6){
        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) > 6){
        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);
            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);
                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();
}

Compilation message

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:52:10: warning: variable 'f' set but not used [-Wunused-but-set-variable]
   52 |     bool f = 0;
      |          ^
stones.cpp: In function 'void solve()':
stones.cpp:120:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  120 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:120:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  120 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                 ^~~~
stones.cpp:121:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  121 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:121:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  121 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                 ^~~~
stones.cpp:137:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  137 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:137:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  137 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                 ^~~~
stones.cpp:138:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  138 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:138:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  138 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                 ^~~~
stones.cpp:157:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  157 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:157:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  157 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                 ^~~~
stones.cpp:158:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  158 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |         ^~~
stones.cpp:158:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  158 |         for(int i = 0; i < m; i++) cout << "-"; cout << "\n";
      |                                                 ^~~~
stones.cpp:171:9: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  171 |         for(int i = 0; i < m; i++) cout << "+"; cout << "\n";
      |         ^~~
stones.cpp:171:49: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
  171 |         for(int i = 0; i < m; i++) cout << "+"; cout << "\n";
      |                                                 ^~~~
stones.cpp:203:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  203 |         for (int i = 0; i < vec.size(); i++) {
      |                         ~~^~~~~~~~~~~~
stones.cpp:204:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  204 |             for (int j = 0; j < vec[i].size(); j++) {
      |                             ~~^~~~~~~~~~~~~~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 212 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 6 ms 384 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 1348 KB Output is correct
2 Correct 35 ms 1752 KB Output is correct
3 Correct 39 ms 2056 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1276 KB Output is correct
2 Correct 28 ms 1656 KB Output is correct
3 Correct 24 ms 1484 KB Output is correct

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 70 ms 1348 KB Output is correct
6 Correct 35 ms 1752 KB Output is correct
7 Correct 39 ms 2056 KB Output is correct
8 Correct 36 ms 1276 KB Output is correct
9 Correct 28 ms 1656 KB Output is correct
10 Correct 24 ms 1484 KB Output is correct
11 Incorrect 14 ms 536 KB Wrong answer in test 21 16: 33 < 34
12 Halted 0 ms 0 KB -