# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308763 | nikatamliani | Red-blue table (IZhO19_stones) | C++14 | 1 ms | 384 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;
int main() {
int T = 1;
cin >> T;
while(T--) {
int n, m, cntI = 0, best = 0;
cin >> n >> m;
char ans[n + 1][m + 1];
memset(ans, 0, sizeof ans);
for(int i = 0; i <= n; ++i) {
int sum = i * ((m + 1) / 2);
int cnt_less = m - sum % m;
int cnt_more = sum % m;
int less = sum / n;
int more = less + 1;
int rem = n * m - sum, now = i;
int can = n / 2, have = n - can;
sum = max(0, sum - can * m);
now += m - (sum + have - 1) / have;
if(best < now) {
best = now, cntI = i;
}
}
int prev = 1;
for(int i = 1; i <= cntI; ++i) {
int cnt = (m + 1) / 2;
for(int j = prev; cnt--; j = (j == m ? 1 : j + 1)) {
prev = j + 1;
ans[i][j] = '+';
}
}
cout << best << '\n';
for(int i = 1; i <= n; ++i) {
for(int j = 1; j <= m; ++j) {
if(ans[i][j] != '+') {
cout << '-';
} else {
cout << '+';
}
}
cout << '\n';
}
}
}
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... |