oj.uz

답안 #697454

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
697454 2023-02-09T22:03:18 Z stevancv Red-blue table (IZhO19_stones) C++14
100 / 100
 30 ms 5256 KB 
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e4 + 2;
const int inf = 2e9;
void Solve() {
    int n, m;
    cin >> n >> m;
    int ch = 0;
    if (n < m) {swap(n, m); ch = 1;}
    vector<vector<int>> a(n, vector<int>(m));
    int p = n * ((m + 1) / 2 - 1);
    int q = n / 2 + 1;
    int c = p / q;
    int i = 0;
    for (int j = 0; j < c; j++) {
        for (int z = 0; z < q; z++) {
            a[i][j] = 1;
            i = (i + 1) % n;
        }
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int u = 0;
        for (int j = 0; j < m; j++) {
            u += 1 - a[i][j];
        }
        if (2 * u > m) ans++;
    }
    for (int j = 0; j < m; j++) {
        int u = 0;
        for (int i = 0; i < n; i++) {
            u += a[i][j];
        }
        if (2 * u > m) ans++;
    }
    cout << ans << en;
    if (ch == 0) {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (a[i][j] == 0) cout << '+';
                else cout << '-';
            }
            cout << en;
        }
    }
    else {
        for (int j = 0; j < m; j++) {
            for (int i = 0; i < n; i++) {
                if (a[i][j] == 0) cout << '-';
                else cout << '+';
            }
            cout << en;
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int tt; cin >> tt;
    while (tt--) Solve();
    return 0;
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 1324 KB Output is correct
2 Correct 25 ms 3524 KB Output is correct
3 Correct 24 ms 4000 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 1440 KB Output is correct
2 Correct 23 ms 2952 KB Output is correct
3 Correct 20 ms 2136 KB Output is correct

Subtask #6
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 27 ms 1324 KB Output is correct
6 Correct 25 ms 3524 KB Output is correct
7 Correct 24 ms 4000 KB Output is correct
8 Correct 30 ms 1440 KB Output is correct
9 Correct 23 ms 2952 KB Output is correct
10 Correct 20 ms 2136 KB Output is correct
11 Correct 8 ms 468 KB Output is correct
12 Correct 21 ms 2768 KB Output is correct
13 Correct 23 ms 2112 KB Output is correct
14 Correct 17 ms 1292 KB Output is correct
15 Correct 27 ms 5256 KB Output is correct
16 Correct 20 ms 3900 KB Output is correct
17 Correct 9 ms 1876 KB Output is correct