oj.uz

Submission #668451

# Submission time Handle Problem Language Result Execution time Memory
668451 2022-12-03T23:33:10 Z YENGOYAN Red-blue table (IZhO19_stones) C++17
53 / 100
 52 ms 2156 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";
        }
    }
}

void malSol1(int n, int m) {
    bool f = 0;
    if (n == 4) {
        if (max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > n + (m + 1) / 2) {
            malSol(n, m);
            return;
        }
        cout << n + (m + 1) / 2 << endl;
    }
    else if (m == 4) {
        if (max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > m + (n + 1) / 2) {
            malSol(n, m);
            return;
        }
        cout << m + (n + 1) / 2 << endl;
    }
    else if (n + (m + 1) / 2 > m + (n + 1) / 2) {
        if (max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > n + (m + 1) / 2) {
            malSol(n, m);
            return;
        }
        cout << n + (m + 1) / 2 << endl;
    }
    else {
        f = 1;
        if(max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > m + (n + 1) / 2){
            malSol(n, m);
            return;
        }
        cout << m + (n + 1) / 2 << endl;
        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;
    }
    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;
    }
    if (n % 2) {
        if (max(n + (m + 1) / 2, m + (n + 1) / 2) > n + m - 2 - (1 - (m % 2))) {
            malSol1(n, m);
            return;
        }
        cout << n + m - 2 - (1 - (m % 2)) << endl;
    }
    else {
        if (max(n + (m + 1) / 2, m + (n + 1) / 2) > m - 1 - (1 - (m % 2)) + n - 2) {
            malSol1(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 'void solve()':
stones.cpp:144:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |     for (int i = 0; i < vec.size(); i++) {
      |                     ~~^~~~~~~~~~~~
stones.cpp:145:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |         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 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 5 ms 340 KB in the table A+B is not equal to 7
5 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 1312 KB Output is correct
2 Correct 25 ms 1748 KB Output is correct
3 Correct 29 ms 2156 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 1240 KB Output is correct
2 Correct 27 ms 1568 KB Output is correct
3 Correct 21 ms 1536 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 5 ms 340 KB in the table A+B is not equal to 7
5 Halted 0 ms 0 KB -