#include <chrono>
#include <random>
#include <iostream>
#include <string>
#include <unordered_map>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <math.h>
#include <cstdio>
#include <stdio.h>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <deque>
#include <cassert>
#include <stack>
using namespace std;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
const int mod = 1e9 + 7;
const int inf = 1e9;
const int N = 1e3 + 15;
int t, n, m, a[N][N];
int red_in_row[N], red_in_col[N];
inline void paint_odd() {
for(int i = 2; i < n; i += 2)
for(int j = 2; j <= m; j += 2)
if(2 * (red_in_col[j] + 1) < n)
a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
for(int j = 1; j <= m; ++j)
for(int i = 1; i <= n; ++i)
if(red_in_row[i] * 2 <= m && (red_in_row[i] + 1) * 2 > m && !a[i][j])
a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
}
inline void paint_even() {
if(n >= m)
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= m / 2 + 1; ++j)
a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
else
for(int i = 1; i <= n / 2; ++i)
for(int j = 1; j <= m; ++j)
a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
}
main() {
scanf("%d", &t);
while(t--) {
int ans = 0;
for(int i = 1; i <= n; ++i) {
red_in_row[i] = 0;
for(int j = 1; j <= m; ++j)
a[i][j] = red_in_col[j] = 0;
}
scanf("%d %d", &n, &m);
for(int i = 1; i < n; i += 2)
for(int j = 1; j <= m; j += 2)
if(2 * (red_in_col[j] + 1) < n)
a[i][j] = 1, ++red_in_row[i], ++red_in_col[j];
if(n % 2 && m % 2)
paint_odd();
else
paint_even();
for(int i = 1; i <= n; ++i)
ans += (2 * red_in_row[i] > m);
for(int j = 1; j <= m; ++j)
ans += (2 * red_in_col[j] < n);
printf("%d\n", ans);
for(int i = 1; i <= n; ++i, puts(""))
for(int j = 1; j <= m; ++j)
putchar(a[i][j] == 1 ? '+' : '-');
}
return 0;
}
Compilation message
stones.cpp:67:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main() {
^
stones.cpp: In function 'int main()':
stones.cpp:68:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &t);
~~~~~^~~~~~~~~~
stones.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &n, &m);
~~~~~^~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
376 KB |
Wrong answer in test 2 4: 1 < 4 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
504 KB |
Wrong answer in test 2 50: 1 < 50 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
376 KB |
Wrong answer in test 2 4: 1 < 4 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
26 ms |
1784 KB |
Output is correct |
| 2 |
Correct |
25 ms |
4216 KB |
Output is correct |
| 3 |
Correct |
23 ms |
4984 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
26 ms |
1900 KB |
Wrong answer in test 24 24: 35 < 44 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
376 KB |
Wrong answer in test 2 4: 1 < 4 |
