oj.uz

Submission #899126

# Submission time Handle Problem Language Result Execution time Memory
899126 2024-01-05T13:50:20 Z otarius Red-blue table (IZhO19_stones) C++17
100 / 100
 25 ms 2384 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")
#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <vector>
#include <iomanip>
#include <cstring>
#include <limits.h>
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long

const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ll wmod = 998244353;
#define int long long

void solve(){
    int n, m;
    cin >> n >> m;
    char a[n + 1][m + 1];
    if (n >= m){
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= m; j++){
                a[i][j] = '+';
            }
        }
        int arr[n + 1] = {};
        int l = 1, i = 1, cnt = n / 2 + 1, cur = 0;
        while(i <= m){
            if (arr[l] < (m - 1) / 2){
                a[l][i] = '-'; arr[l]++; cur++;
            }else break;
            if (cur % cnt == 0)i++;
            if (l == n)l = 1;
            else l++;
        }
    }else {
        for (int i = 1; i <= n; i++){
            for (int j = 1; j <= m; j++){
                a[i][j] = '-';
            }
        }
        int arr[m + 1] = {};
        int l = 1, i = 1, cnt = m / 2 + 1, cur = 0;
        while(i <= n){
            if (arr[l] < (n - 1) / 2){
                a[i][l] = '+'; arr[l]++; cur++;
            }else break;
            if (cur % cnt == 0)i++;
            if (l == m)l = 1;
            else l++;
        }
    }
    int ans = 0;
    for (int i = 1; i <= n; i++){
        int cnt = 0;
        for (int j = 1; j <= m; j++){
            cnt += (a[i][j] == '+');
        }
        if (cnt > m - cnt)ans++;
    }
    for (int j = 1; j <= m; j++){
        int cnt = 0;
        for (int i = 1; i <= n; i++){
            cnt += (a[i][j] == '-');
        }
        if (cnt > n - cnt)ans++;
    }
    cout << ans << '\n';
    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            cout << a[i][j];
        }cout << '\n';
    }
    /*
        --+++
        -+-++
        -+-++
        -+-++
        +--++
        +-+-+
        +-+-+
    
    */
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    ll T = 1;
    cin >> T;
    while(T--){
        solve();
    }
    return 0;
}

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 1364 KB Output is correct
2 Correct 19 ms 1880 KB Output is correct
3 Correct 18 ms 1884 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 1368 KB Output is correct
2 Correct 18 ms 1628 KB Output is correct
3 Correct 16 ms 1372 KB Output is correct

Subtask #6
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 25 ms 1364 KB Output is correct
6 Correct 19 ms 1880 KB Output is correct
7 Correct 18 ms 1884 KB Output is correct
8 Correct 20 ms 1368 KB Output is correct
9 Correct 18 ms 1628 KB Output is correct
10 Correct 16 ms 1372 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 17 ms 1588 KB Output is correct
13 Correct 17 ms 1360 KB Output is correct
14 Correct 13 ms 1112 KB Output is correct
15 Correct 21 ms 2384 KB Output is correct
16 Correct 16 ms 1884 KB Output is correct
17 Correct 7 ms 980 KB Output is correct