oj.uz

Submission #900515

# Submission time Handle Problem Language Result Execution time Memory
900515 2024-01-08T12:07:40 Z marcid Red-blue table (IZhO19_stones) C++17
0 / 100
 17 ms 1372 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define vi vector<int>
#define ii pair<int,int>
#define vii vector<ii>
#define vb vector<bool>
#define pb push_back
#define eb emplace_back
const int maxn = 1e6+5;
const int sq = 23;
const int inf = 1e18;

void solve() {
    int n, m; cin >> n >> m;
    // n, m <= 1000 -> n*m=1e6
    // + is red, - is blue
    // A - number of rows with cnt(+)>cnt(-)
    // B - number of cols with cnt(-)>cnt(+)
    // hypo: 
    // if we have optimal field, if we rotate it by 90 degrees and replace '+'s & '-'s, it remains optimal 
    // that means, ans[n][m]<->ans[m][n]
    // + in a row >=n/2+1 and - in a col >=m/2+1
    if (n==1 or n==2) {
        cout << m << '\n';
        for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) cout << '-'; cout << '\n';}
        return;
    } if (m==1 or m==2) {
        cout << n << '\n';
        for (int i = 0; i < n; i++) {for (int j = 0; j < m; j++) cout << '+'; cout << '\n';}
        return;
    } int row = m/2+1, col = n/2+1;
    if (n==m) {
        cout << n+(n-1)/2 << '\n';
        if (n&1) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    cout << (j&1?'-':'+');
                } cout << '\n';
            }
        } else {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    cout << (j<n-1?(j&1?'-':'+'):'+');
                } cout << '\n';
            }
        }
        return;
    }
    if (n==3) {
        cout << m+1 << '\n';
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < m; j++) {
                cout << '-';
            } cout << '\n';
        } for (int i = 0; i < m; i++) cout << '+';
        cout << '\n';
        return;
    } if (m==3) {
        cout << n+1 << '\n';
        for (int i = 0; i < n; i++) {
            cout << "++-\n";
        }
        return;
    }
}

signed main() {
    cin.tie()->sync_with_stdio(0);
    int tc = 1;
    cin >> tc;
    while (tc--) {
        solve();
    }
}

Compilation message

stones.cpp: In function 'void solve()':
stones.cpp:34:11: warning: unused variable 'row' [-Wunused-variable]
   34 |     } int row = m/2+1, col = n/2+1;
      |           ^~~
stones.cpp:34:24: warning: unused variable 'col' [-Wunused-variable]
   34 |     } int row = m/2+1, col = n/2+1;
      |                        ^~~

Subtask #1
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 600 KB Wrong answer in test 2 1: 1 < 2
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Wrong answer in test 2 1: 1 < 2
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 600 KB Wrong answer in test 2 1: 1 < 2
3 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong answer
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 17 ms 1372 KB Wrong answer in test 24 24: 35 < 44
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 600 KB Wrong answer in test 2 1: 1 < 2
3 Halted 0 ms 0 KB -