# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308765 | 2020-10-01T21:31:00 Z | nikatamliani | Red-blue table (IZhO19_stones) | C++14 | 1 ms | 384 KB |
#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; bool ans[n + 1][m + 1]; memset(ans, 0, sizeof ans); for(int i = 0; i <= n; ++i) { int sum = i * (m / 2 + 1); 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 - 1) / 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] = 1; } } 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 0 ms | 256 KB | in the table A+B is not equal to 2 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 0 ms | 256 KB | in the table A+B is not equal to 2 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 384 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 384 KB | Execution killed with signal 7 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Incorrect | 0 ms | 256 KB | in the table A+B is not equal to 2 |