oj.uz

Submission #342498

# Submission time Handle Problem Language Result Execution time Memory
342498 2021-01-02T09:14:26 Z dxz05 Red-blue table (IZhO19_stones) C++14
15 / 100
 1784 ms 2340 KB 
//#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

typedef long long ll;
//mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.00001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 2e6 + 4e4;
const int M = 1234;
const int LOG = 19;

int calc(vector<vector<char>> &v) {
    int n = v.size(), m = v[0].size();
    int res = 0;
    for (int i = 0; i < n; i++) {
        int x = 0, y = 0;
        for (int j = 0; j < m; j++) {
            if (v[i][j] == '+') x++;
            else
                y++;
        }
        if (x > y) res++;
    }
    for (int j = 0; j < m; j++) {
        int x = 0, y = 0;
        for (int i = 0; i < n; i++) {
            if (v[i][j] == '-') x++;
            else
                y++;
        }
        if (x > y) res++;
    }

    return res;
}

void solve(int TC) {
    int n, m;
    cin >> n >> m;

    int best = 0;
    vector<vector<char>> ans(n, vector<char>(m, '-'));

    for (int A = 0; A <= n; A++){
        vector<vector<char>> v(n, vector<char>(m, '-'));
        vector<int> cnt(m, 0);
        int mx = 0;
        for (int i = 0; i < A; i++){
            int x = 0;
            for (int j = 0; j < m; j++){
                if (x + x > m) break;
                if (cnt[j] < mx){
                    cnt[j]++;
                    x++;
                    v[i][j] = '+';
                }
            }

            if (x + x <= m){
                for (int j = 0; j < m; j++){
                    if (x + x > m) break;
                    if (cnt[j] == mx){
                        cnt[j]++;
                        x++;
                        v[i][j] = '+';
                    }
                }
                mx++;
            }

        }

        if (calc(v) > best){
            best = calc(v);
            ans = v;
        }

    }

    cout << best << endl;

    for (auto &v : ans){
        for (auto &x : v) cout << x;
        cout << endl;
    }

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false);

    bool llololcal = false;
#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    llololcal = true;
#endif

    int TC = 1;
    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        debug(test);
        solve(test);
    }

    if (llololcal) cerr << endl << "Time: " << getCurrentTime() * 1000 << " ms" << endl;

    return 0;
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:18:20: warning: statement has no effect [-Wunused-value]
   18 | #define debug(...) 42
      |                    ^~
stones.cpp:131:9: note: in expansion of macro 'debug'
  131 |         debug(test);
      |         ^~~~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 4 3: 4 < 5

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 364 KB Wrong answer in test 4 3: 4 < 5

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 4 3: 4 < 5

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 411 ms 1516 KB Wrong answer in test 97 21: 112 < 116
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 495 ms 1516 KB Output is correct
2 Correct 1784 ms 2340 KB Output is correct
3 Correct 1433 ms 1888 KB Output is correct

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Wrong answer in test 4 3: 4 < 5