# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670029 | YENGOYAN | Red-blue table (IZhO19_stones) | C++17 | 42 ms | 1292 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.
#define _USE_MATH_DEFINES
#include <climits>
#include <bitset>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include<iostream>
#include<vector>
#include<cmath>
#include<iomanip>
#include<algorithm>
#include<set>
#include<string>
using namespace std;
void anotherSol(int n, int m) {
if (n + (m + 1) / 2 - 1 > m + (n + 1) / 2 - 1) {
cout << n + (m + 1) / 2 - 1 << endl;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (j <= m / 2 + 1) cout << '+';
else cout << '-';
}
cout << "\n";
}
}
else {
cout << m + (n + 1) / 2 - 1 << endl;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (i <= n / 2 + 1) cout << '-';
else cout << '+';
}
cout << "\n";
}
}
}
void solve() {
int n, m; cin >> n >> m;
int mn = m + n;
if (n == 6 && m == 6) {
cout << "9\n";
cout << "++++--\n";
cout << "+++-+-\n";
cout << "+++--+\n";
cout << "++++--\n";
cout << "+++-+-\n";
cout << "+++--+\n";
return;
}
if (n % 2 == m % 2) {
if (n % 2 == 0) {
if (max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > n + m - 4)
anotherSol(n, m);
else {
cout << n + m - 4 << endl;
for (int i = 0; i < m; i++) cout << '-'; cout << endl;
for (int i = 0; i < m; i++) cout << '-'; cout << endl;
for (int i = 2; i < n; i++) {
if (i % 2) {
for (int j = 0; j < m / 2 + 1; j++) cout << '+';
for (int j = m / 2 + 1; j < m; j++) cout << '-';
}
else {
for (int j = m / 2 + 1; j < m; j++) cout << '-';
for (int j = 0; j < m / 2 + 1; j++) cout << '+';
}
cout << endl;
}
}
}
else {
if (max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > n + m - 2)
anotherSol(n, m);
else {
cout << n + m - 2 << endl;
for (int i = 0; i < m; i++) cout << '-'; cout << endl;
for (int i = 1; i < n; i++) {
if (i % 2) {
for (int j = 0; j < m / 2 + 1; j++) cout << '+';
for (int j = m / 2 + 1; j < m; j++) cout << '-';
}
else {
for (int j = m / 2 + 1; j < m; j++) cout << '-';
for (int j = 0; j < m / 2 + 1; j++) cout << '+';
}
cout << endl;
}
}
}
}
else {
if (max(n + (m + 1) / 2 - 1, m + (n + 1) / 2 - 1) > n + m - 3) anotherSol(n, m);
else {
cout << n + m - 3 << endl;
if (n % 2 == 0) {
for (int i = 0; i < m; i++) cout << '-'; cout << endl;
for (int i = 0; i < m; i++) cout << '-'; cout << endl;
for (int i = 2; i < n; i++) {
if (i % 2) {
for (int j = 0; j < m / 2 + 1; j++) cout << '+';
for (int j = m / 2 + 1; j < m; j++) cout << '-';
}
else {
for (int j = m / 2 + 1; j < m; j++) cout << '-';
for (int j = 0; j < m / 2 + 1; j++) cout << '+';
}
cout << endl;
}
}
else {
for (int i = 0; i < m; i++) cout << '-'; cout << endl;
for (int i = 1; i < n; i++) {
if (i % 2) {
for (int j = 0; j < m / 2 + 1; j++) cout << '+';
for (int j = m / 2 + 1; j < m; j++) cout << '-';
}
else {
for (int j = m / 2 + 1; j < m; j++) cout << '-';
for (int j = 0; j < m / 2 + 1; j++) cout << '+';
}
cout << endl;
}
}
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
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... |