oj.uz

답안 #173765

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
173765 2020-01-05T10:55:46 Z emil_physmath Red-blue table (IZhO19_stones) C++17
11 / 100
 12 ms 2040 KB 
#include <algorithm>
#include <iostream>
#include <vector>
#include <string>
using namespace std;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t;
    cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        if (m <= 2 && n > m)
        {
            cout << n << '\n';
            for (int i = 0; i < n; ++i)
            {
                for (int j = 0; j < m; ++j)
                    cout << "+";
                cout << '\n';
            }
            continue;
        }
        if (n <= 2)
        {
            cout << m << '\n';
            for (int i = 0; i < n; ++i)
            {
                for (int j = 0; j < m; ++j)
                    cout << "-";
                cout << '\n';
            }
            continue;
        }
        vector<string> a(n, string(m, '+'));
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < m; ++j)
                a[i][j] = ((i + j) % 2 ? '+' : '-');
        for (int i = 0; i < n; ++i)
            for (int j = m - 1 - (m + 1) % 2; j < m; ++j)
                a[i][j] = '+';
        for (int j = 0; j < m; ++j)
            for (int i = n - 1 - (n + 1) % 2; i < n; ++i)
                a[i][j] = '-';
        int ans = 0;
        for (int i = 0; i < n; ++i)
            if (2 * count(a[i].begin(), a[i].end(), '+') > m)
                ++ans;
        for (int j = 0; j < m; ++j)
        {
            int cnt = 0;
            for (int i = 0; i < n; ++i)
                if (a[i][j] == '-')
                    ++cnt;
            if (2 * cnt > n)
                ++ans;
        }
        cout << ans << '\n';
        for (int i = 0; i < n; ++i)
            cout << a[i] << '\n';
        cout << flush;
    }
}

Subtask #1
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Wrong answer in test 4 4: 4 < 5

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 376 KB Wrong answer in test 4 3: 4 < 5

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Wrong answer in test 4 4: 4 < 5

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1400 KB Output is correct
2 Correct 9 ms 1656 KB Output is correct
3 Correct 9 ms 2040 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 10 ms 1400 KB Wrong answer in test 4 4: 4 < 5
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Wrong answer in test 4 4: 4 < 5