# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093911 | stdfloat | Red-blue table (IZhO19_stones) | C++17 | 19 ms | 1492 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(v) (v).begin(), (v).end()
void solve() {
int n, m;
cin >> n >> m;
vector<vector<char>> a(n, vector<char>(m));
if (n < m) {
for (int i = 0; i < n; i++) {
if (i < ((n - 1) >> 1)) {
for (int j = 0; j < m; j++)
a[i][j] = '+';
}
else {
for (int j = 0; j < m; j++)
a[i][j] = '-';
}
}
}
else {
for (int i = 0; i < m; i++) {
if (i < ((m - 1) >> 1)) {
for (int j = 0; j < n; j++)
a[j][i] = '-';
}
else {
for (int j = 0; j < n; j++)
a[j][i] = '+';
}
}
}
cout << max(m, n) + (min(m, n) - 1 >> 1) << '\n';
for (auto i : a) {
for (auto j : i)
cout << j;
cout << '\n';
}
cout << '\n';
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int T;
cin >> T;
while (T--) solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |