oj.uz

Submission #532515

# Submission time Handle Problem Language Result Execution time Memory
532515 2022-03-03T04:03:15 Z syl123456 Red-blue table (IZhO19_stones) C++17
0 / 100
 622 ms 1272 KB 
#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;
        pi ans(n, 0);
        if (m > n)
            ans = pi(0, m);
        int cnt[m]{};
        for (int i = n; i; --i)
            for (int j = m; j; --j) {
                if (i + j <= ans.first + ans.second)
                    break;
                int x = n + 2 >> 1, y = m + 2 >> 1;
                x = max(0, x - n + i);
                fill(cnt, cnt + m, 0);
                for (int _i = 0, tmp = m; _i < n - i; ++_i)
                    for (int _j = m - j; _j < m; ++_j)
                        if (cnt[_j] < x && tmp > y)
                            ++cnt[_j], --tmp;
                if (cnt[m - 1] == x)
                    ans = pi(i, j);
            }
        cout << ans.first + ans.second << '\n';
        int x = n + 2 >> 1, y = m + 2 >> 1;
        x = max(0, x - n + ans.first);
        fill(cnt, cnt + m, 0);
        for (int i = 0; i < n; ++i) {
            if (i >= ans.first) {
                cout << string(m, '-') << '\n';
                continue;
            }
            cout << string(m - ans.second, '+');
            int tmp = m;
            for (int j = m - ans.second; j < m; ++j)
                if (cnt[j] < x && tmp > y)
                    cout << '-', ++cnt[j], --tmp;
                else
                    cout << '+';
            cout << '\n';
        }
    }
}

Compilation message

stones.cpp: In function 'int main()':
stones.cpp:38:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |                 int x = n + 2 >> 1, y = m + 2 >> 1;
      |                         ~~^~~
stones.cpp:38:43: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   38 |                 int x = n + 2 >> 1, y = m + 2 >> 1;
      |                                         ~~^~~
stones.cpp:49:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |         int x = n + 2 >> 1, y = m + 2 >> 1;
      |                 ~~^~~
stones.cpp:49:35: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   49 |         int x = n + 2 >> 1, y = m + 2 >> 1;
      |                                 ~~^~~

Subtask #1
0 / 17.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 221 ms 1208 KB Wrong answer in test 97 21: 97 < 116
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 622 ms 1272 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 1 ms 256 KB Output is correct
2 Incorrect 0 ms 204 KB Wrong answer in test 4 3: 4 < 5
3 Halted 0 ms 0 KB -