/*
Code written by Talant I.D.
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
inline bool isvowel(char ch){
ch = tolower(ch);
return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
inline bool isprime(int n){
if(n < 2 || (n%2 == 0 && n != 2)) return false;
for(int i = 3; i*i <= n; i++)
if(n%i == 0) return false;
return true;
}
class Union{
private:
vector <int> saizu, link;
public:
Union(int n){
saizu.assign(n, 1); link.resize(n);
iota(all(link), 0);
}
int find(int n){
if(link[n] == n) return n;
return link[n] = find(link[n]);
}
int same(int a, int b){
return find(a) == find(b);
}
void unite(int a, int b){
if(same(a, b)) return;
a = find(a); b = find(b);
if(saizu[a] < saizu[b]) swap(a, b);
saizu[a] += saizu[b];
link[b] = a;
}
int getsize(int a){
return saizu[find(a)];
}
};
const int mod = 1e9+7;
ll mode(ll a){
a %= mod;
if(a < 0) a += mod;
return a;
}
ll subt(ll a, ll b){
return mode(mode(a)-mode(b));
}
ll add(ll a, ll b){
return mode(mode(a)+mode(b));
}
ll mult(ll a, ll b){
return mode(mode(a)*mode(b));
}
ll binpow(ll a, ll b){
ll res = 1;
while(b){
if(b&1) res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
int d(int n){
return (n&1 ? n/2 : n/2-1);
}
int main(){
do_not_disturb
//freopen("subsequence.in", "r", stdin);
//freopen("subsequence.out", "w", stdout);
int t;
cin >> t;
while(t--){
int n, m;
cin >> n >> m;
int ans;
char grid[n][m];
if(n <= m){
int red[m], blue[m];
for(int i = 0; i < m; i++) blue[i] = n, red[i] = 0;
ans = m;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
grid[i][j] = '-';
}
}
int l = 0, r = d(m)-1;
if(r >= 0)
for(int i = 0; i < n; i++){
if(l <= r){
int flag = 0;
for(int j = 0; j < l; j++){
if(red[j]+1 >= blue[j]-1) flag++;
}
for(int j = r+1; j < m; j++){
if(red[j]+1 >= blue[j]-1) flag++;
}
if(flag) break;
for(int j = 0; j < l; j++){
red[j]++;
blue[j]--;
grid[i][j] = '+';
}
for(int j = r+1; j < m; j++){
red[j]++;
blue[j]--;
grid[i][j] = '+';
}
}
else{
int flag = 0;
for(int j = r+1; j < l; j++){
if(red[j]+1 >= blue[j]-1) flag++;
}
if(flag) break;
for(int j = r+1; j < l; j++){
red[j]++;
blue[j]--;
grid[i][j] = '+';
}
}
l = (l+d(m))%m;
r = (r+d(m))%m;
ans++;
}
}
else{
int red[n], blue[n];
for(int i = 0; i < n; i++) blue[i] = m, red[i] = 0;
ans = n;
for(int i = 0; i < m; i++){
for(int j = 0; j < n; j++){
grid[j][i] = '-';
}
}
int l = 0, r = d(n)-1;
if(r >= 0)
for(int i = 0; i < m; i++){
if(l <= r){
int flag = 0;
for(int j = 0; j < l; j++){
if(red[j]+1 >= blue[j]-1) flag++;
}
for(int j = r+1; j < n; j++){
if(red[j]+1 >= blue[j]-1) flag++;
}
if(flag) break;
for(int j = 0; j < l; j++){
red[j]++;
blue[j]--;
grid[j][i] = '+';
}
for(int j = r+1; j < n; j++){
red[j]++;
blue[j]--;
grid[j][i] = '+';
}
}
else{
int flag = 0;
for(int j = r+1; j < l; j++){
if(red[j]+1 >= blue[j]-1) flag++;
}
if(flag) break;
for(int j = r+1; j < l; j++){
red[j]++;
blue[j]--;
grid[j][i] = '+';
}
}
l = (l+d(n))%n;
r = (r+d(n))%n;
ans++;
}
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
grid[i][j] = (grid[i][j] == '-' ? '+' : '-');
}
}
}
cout << ans << endl;
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
cout << grid[i][j];
}
cout << endl;
}
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
3 ms |
364 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
1388 KB |
Output is correct |
| 2 |
Correct |
32 ms |
1900 KB |
Output is correct |
| 3 |
Correct |
36 ms |
1900 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
36 ms |
1388 KB |
Output is correct |
| 2 |
Correct |
29 ms |
1644 KB |
Output is correct |
| 3 |
Correct |
26 ms |
1388 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
0 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
364 KB |
Output is correct |
| 4 |
Correct |
3 ms |
364 KB |
Output is correct |
| 5 |
Correct |
36 ms |
1388 KB |
Output is correct |
| 6 |
Correct |
32 ms |
1900 KB |
Output is correct |
| 7 |
Correct |
36 ms |
1900 KB |
Output is correct |
| 8 |
Correct |
36 ms |
1388 KB |
Output is correct |
| 9 |
Correct |
29 ms |
1644 KB |
Output is correct |
| 10 |
Correct |
26 ms |
1388 KB |
Output is correct |
| 11 |
Correct |
9 ms |
620 KB |
Output is correct |
| 12 |
Correct |
28 ms |
1516 KB |
Output is correct |
| 13 |
Correct |
30 ms |
1516 KB |
Output is correct |
| 14 |
Correct |
22 ms |
1132 KB |
Output is correct |
| 15 |
Correct |
35 ms |
2412 KB |
Output is correct |
| 16 |
Correct |
26 ms |
1772 KB |
Output is correct |
| 17 |
Correct |
15 ms |
1004 KB |
Output is correct |
