oj.uz

Submission #241535

# Submission time Handle Problem Language Result Execution time Memory
241535 2020-06-24T11:47:00 Z valerikk Red-blue table (IZhO19_stones) C++14
17 / 100
 2000 ms 384 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld; // typedef double ld;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<ld> vd;
typedef vector<vd> vvd;
typedef complex<ld> cd;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef string str;
#define int ll

template<class A, class B>
inline bool mmin(A& a, B b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}

template<class A, class B>
inline bool mmax(A& a, B b) {
    if (b > a) {
        a = b;
        return 1;
    }
    return 0;
}

ld nxt_ld() {
    string s;
    cin >> s;
    return stold(s);
}

#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define pf push_front
#define ef emplace_front
#define ppb pop_back
#define ppf pop_front
#define sz(a) (int)(a).size()
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

int getans(vvc a) {
    int n = sz(a), m = sz(a[0]);
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int bal = 0;
        for (int j = 0; j < m; j++) {
            if (a[i][j] == '+') bal++; else bal--;
        }
        if (bal > 0) ans++;
    }
    for (int j = 0; j < m; j++) {
        int bal = 0;
        for (int i = 0; i < n; i++) {
            if (a[i][j] == '-') bal++; else bal--;
        }
        if (bal > 0) ans++;
    }
    return ans;
}

signed main() {
    /*freopen("cbarn.in", "r", stdin);
    freopen("cbran.out", "w", stdout);*/
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;
        vvc ans(n, vc(m, '+'));
        for (int mask = 0; mask < (1 << (n * m)); mask++) {
            vvc q(n, vc(m));
            int z = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) q[i][j] = ((mask >> z++) & 1) ? '+' : '-';
            }
            if (getans(q) > getans(ans)) ans = q;
        }
        cout << getans(ans) << '\n';
        for (auto x : ans) {
            for (auto y : x) cout << y;
            cout << '\n';
        }
    }
    return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 70 ms 384 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2085 ms 384 KB Time limit exceeded

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 70 ms 384 KB Output is correct
3 Execution timed out 2085 ms 384 KB Time limit exceeded

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2078 ms 384 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 2081 ms 384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 70 ms 384 KB Output is correct
3 Execution timed out 2085 ms 384 KB Time limit exceeded