oj.uz

Submission #330710

# Submission time Handle Problem Language Result Execution time Memory
330710 2020-11-26T10:29:20 Z vitkishloh228 Red-blue table (IZhO19_stones) C++14
17 / 100
 2000 ms 512 KB 
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main() {
    int tt;
    cin >> tt;
    while (tt--) {
        int n, m;
        cin >> n >> m;
        vector<vector<int>> a(n, vector<int>(m));
        int max1 = 0;
        for (int mask = 0; mask < (1 << (n * m)); ++mask) {
            for (int k = 0; k < (n * m); ++k) {
                if ((mask & (1 << k)))a[k / m][k % m] = 1;
                else a[k / m][k % m] = 0;
            }
            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++;
            }
            if (cur > max1) {
                max1 = cur;
            }
        }
        cout << max1 << endl;
        for (int mask = 0; mask < (1 << (n * m)); ++mask) {
            for (int k = 0; k < (n * m); ++k) {
                if ((mask & (1 << k)))a[k / m][k % m] = 1;
                else a[k / m][k % m] = 0;
            }
            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++;
            }
            if (cur == max1) {
                for (auto elem : a) {
                    for (auto u : elem) {
                        if (u) cout << "+";
                        else cout << "-";
                    }
                    cout << endl;
                }
                cout << endl;
                break;
            }
        }
    }
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2067 ms 376 KB Time limit exceeded

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 10 ms 364 KB Output is correct
3 Execution timed out 2067 ms 376 KB Time limit exceeded

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2073 ms 512 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2087 ms 364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 10 ms 364 KB Output is correct
3 Execution timed out 2067 ms 376 KB Time limit exceeded