Submission #532504

#	Time	Username	Problem	Language	Result	Execution time	Memory
532504		syl123456	Red-blue table (IZhO19_stones)	C++17	0 / 100	9 ms	1356 KiB

stones

#include <bits/stdc++.h>
#define all(i) (i).begin(), (i).end()
using namespace std;
void Debug(bool _split) {}
template<typename T1, typename ...T2>
void Debug(bool _split, T1 i, T2 ...j) {
    if (_split)
        cerr << ", ";
    cerr << i;
    Debug(true, j...);
}
#define debug(args...) cerr << "Line(" << __LINE__ << ") : [" << #args << "] is [", Debug(false, args), cerr << "]" << endl
template<typename T1, typename T2>
ostream& operator << (ostream& i, pair<T1, T2> j) {
    return i << '(' << j.first << ", " << j.second << ')';
}

typedef long long ll;
typedef pair<int, int> pi;
const int inf = 0x3f3f3f3f, lg = 20;
const ll mod = 1e9 + 7, INF = 0x3f3f3f3f3f3f3f3f;

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        int n, m;
        cin >> n >> m;
        vector<string> s(n, string(m, '+'));
        for (int i = 0; i < n + 2 >> 1; ++i)
            for (int j = m + 2 >> 1; j < m; ++j)
                s[i][j] = s[n - 1 - i][m - 1 - j] = '-';
        int ans = 0;
        for (int i = 0; i < n; ++i)
            if (count(all(s[i]), '+') > count(all(s[i]), '-'))
                ++ans;
        for (int j = 0; j < m; ++j) {
            int tmp = 0;
            for (int i = 0; i < n; ++i)
                tmp += s[i][j] == '+' ? -1 : 1;
            if (tmp > 0)
                ++ans;
        }
        cout << ans << '\n';
        for (string i : s)
            cout << i << '\n';
    }
}

Compilation message (stderr)

stones.cpp: In function 'int main()':
stones.cpp:31:31: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   31 |         for (int i = 0; i < n + 2 >> 1; ++i)
      |                             ~~^~~
stones.cpp:32:28: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   32 |             for (int j = m + 2 >> 1; j < m; ++j)
      |                          ~~^~~

• Subtask 1: 0 / 17
• Subtask 2: 0 / 10
• Subtask 3: 0 / 16
• Subtask 4: 0 / 11
• Subtask 5: 0 / 15
• Subtask 6: 0 / 31