# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
284754 | 2020-08-28T02:14:58 Z | dantoh000 | Red-blue table (IZhO19_stones) | C++14 | 69 ms | 4856 KB |
#include <bits/stdc++.h> using namespace std; int ans[1005][1005]; int rct[1005]; int cct[1005]; int main(){ int tc; scanf("%d",&tc); while (tc--){ int n,m; scanf("%d%d",&n,&m); int flag = 0; if (n < m){ flag = 1; swap(n,m); } for (int i = 0; i < n; i++) rct[i] = 0; for (int j = 0; j < m; j++) cct[j] = 0; for (int i = 0; i < n; i++){ int num = (m-1)/2; for (int j = 0; j < m; j++){ if ((i == n-1 && (m-1)/2 >= 1) || cct[j]+1 < n-cct[j]-1 && num){ cct[j]++; num--; rct[i]++; ans[i][j] = 1; } else ans[i][j] = 0; } } int sum = 0; for (int i = 0; i < n; i++){ if (rct[i] < m-rct[i]) sum++; } for (int i = 0; i < m; i++){ if (cct[i] > n-cct[i]) sum++; } printf("%d\n",sum); if (flag){ for (int i = 0; i < m; i++){ for (int j = 0; j < n; j++){ printf("%c",ans[j][i]?'+':'-'); } printf("\n"); } } else{ for (int i = 0; i < n; i++){ for (int j = 0; j < m; j++){ printf("%c",ans[i][j]?'-':'+'); } printf("\n"); } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Wrong answer in test 4 4: 3 < 5 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 512 KB | Wrong answer in test 4 3: 3 < 5 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Wrong answer in test 4 4: 3 < 5 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 62 ms | 1784 KB | Output is correct |
2 | Correct | 69 ms | 4728 KB | Output is correct |
3 | Correct | 54 ms | 4856 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 63 ms | 1912 KB | Wrong answer in test 24 24: 23 < 44 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Incorrect | 0 ms | 384 KB | Wrong answer in test 4 4: 3 < 5 |