# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
336929 | BY_KUTBILIM | Red-blue table (IZhO19_stones) | C++14 | 76 ms | 2284 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.
/** @BY_KUTBILIM **/
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define ll long long
int main(){
ios_base::sync_with_stdio(false);
cin.tie();
int t;
cin >> t;
while(t--){
int n, m;
cin >> n >> m;
char ans[n][m];
bool f = false;
if(n < m){
swap(n, m);
f = 1;
}
char a[n][m];
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
a[i][j] = '+';
}
}
int half = n / 2 + 1, J = 0, Ans = n;
for(int j = 0; j < (m - 1) / 2; j++){
for(int i = 0; i < n; i++){
a[i][J] = '-';
half--;
if(!half){
half = n / 2 + 1;
J++;
Ans++;
}
}
}
cout << Ans << endl;
if(f)swap(n, m);
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
if(f)cout << char('+' + '-' - a[j][i]);
else cout << a[i][j];
}
cout << endl;
}
}
return 0;
}
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... |