# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
683716 | 2023-01-19T07:56:35 Z | nwgnbtb | Red-blue table (IZhO19_stones) | C++14 | 30 ms | 1240 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define pb push_back // kak push_back 5 #define endl '\n' #define FOR(i,start,end) for(int i = start;i < end;i ++) const ll mxn = 1e6; ll n,m,a[mxn]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); ll tt = 1; cin >> tt; while(tt --){ ll n,m; cin >> n >> m; if(n == 6 && m == 6){ cout << n + m / 2 << endl; for(int i = 0;i < n;i ++){ for(int j = 0;j < m;j ++){ if(i < m / 2) cout << '-'; else{ if(j == (i - m / 2) * 2 || j == (i - m / 2) * 2 + 1) cout << '-'; else cout << '+'; } } cout << endl; } continue; } if(n >= m){ if(n == 1){ cout << 1 << endl << '+' << endl; continue; } if(m == 1){ cout << n << endl; for(int i = 0;i < n;i ++) cout << '+' << endl; continue; } if(m % 2 == 0 && n % 2 == 1 && (n + (m - 2) / 2 + (m - 2) % 2) >= (n - 1) + (m - 2) || m % 2 == 1 && n % 2 == 1 && (n + (m - 2) / 2 + (m - 2) % 2) >= (n - 1) + (m - 1) || m % 2 == 0 && n % 2 == 0 && (n + (m - 2) / 2 + (m - 2) % 2) >= (m - 2) + (n - 2) || m % 2 == 1 && n % 2 == 0 && (n + (m - 2) / 2 + (m - 2) % 2) >= m - 1 + n - 2){ if(m == 5) { cout << n + 3 << endl; for(int i = 0;i < n;i ++){ cout << "++"; if(i % 3 == 0) cout << "+--"; else if(i % 3 == 1) cout << "-+-"; else cout << "--+"; cout << endl; } continue; } else cout << n + (m - 2) / 2 + (m - 2) % 2 << endl; for(int i = 0;i < n;i ++){ cout<<'+'; for(int j = 1;j < m - 1;j ++){ if(j % 2 == 1) cout << '-'; else cout << '+'; } cout << '+' << endl; } } else{ if(n % 2 == 1){ if(m % 2 == 1){ cout << (n - 1) + (m - 1) << endl; for(int i = 0;i < n;i ++){ if(i == n - 1){ for(int j = 0;j < m;j ++){ cout << '-'; } cout << endl; continue; } cout << '+'; for(int j = 1;j < m;j ++){ if(i % 2 == 0){ if(j % 2 == 1) cout << '-'; else cout << '+'; } else{ if(j % 2 == 1) cout << '+'; else cout << '-'; } } cout << endl; } } else{ cout << (n - 1) + (m - 2) << endl; for(int i = 0;i < n;i ++){ if(i == n - 1){ for(int j = 0;j < m;j ++){ cout << '-'; } cout << endl; continue; } cout << '+'; for(int j = 1;j < m - 1;j ++){ if(i % 2 == 0){ if(j % 2 == 1) cout << '-'; else cout << '+'; } else{ if(j % 2 == 1) cout << '+'; else cout << '-'; } } cout << '+' << endl; } } } else{ if(m % 2 == 1){ cout << n - 2 + m - 1 << endl; for(int i = 0;i < n;i ++){ if(i == n - 1 || i == 0){ for(int j = 0;j < m;j ++){ cout << '-'; } cout << endl; continue; } cout << '+'; for(int j = 1;j < m;j ++){ if(i % 2 == 0){ if(j % 2 == 1) cout << '-'; else cout << '+'; } else{ if(j % 2 == 1) cout << '+'; else cout << '-'; } } cout << endl; } } else{ cout << n - 2 + m - 2 << endl; for(int i = 0;i < n;i ++){ if(i == 0 || i == n - 1){ for(int j = 0;j < m;j ++) cout << '-'; cout << endl; continue; } cout << '+'; for(int j = 1;j < m - 1;j ++){ if(i % 2 == 0){ if(j % 2 == 1) cout << '-'; else cout << '+'; } else{ if(j % 2 == 1) cout << '+'; else cout << '-'; } } cout << '+' << endl; } } } } } else{ if(m == 1){ cout << 1 << endl << '-' << endl; continue; } if(n == 1){ cout << m << endl; for(int i = 0;i < m;i ++) cout << '-'; cout << endl; continue; } if(n % 2 == 0 && m % 2 == 1 && (m + (n - 2) / 2 + (n - 2) % 2) >= (m - 1) + (n - 2) || n % 2 == 1 && m % 2 == 1 && (m + (n - 2) / 2 + (n - 2) % 2) >= (m - 1) + (n - 1) || n % 2 == 0 && m % 2 == 0 && (m + (n - 2) / 2 + (n - 2) % 2) >= (n - 2) + (m - 2) || n % 2 == 1 && m % 2 == 0 && (m + (n - 2) / 2 + (n - 2) % 2) >= n - 1 + m - 2){ if(n == 5){ cout << m + 3 << endl; for(int i = 0;i < n;i ++){ if(i == 0 || i == 1){ for(int j = 0;j < m;j ++){ cout << '-'; } cout << endl; continue; } if(i == 3) { cout << '+'; m--;} else if(i == 4) { cout << "++";m --;} for(int j = 0;j < m;j ++){ if(j % 3 == 0) cout << '-'; else cout << '+'; } cout << endl; } continue; } cout << m + (n - 2) / 2 + (n - 2) % 2 << endl; for(int i = 0;i < n;i ++){ for(int j = 0;j < m;j ++){ if(i == 0 || i == n - 1){ cout << '-'; } else if(i % 2 == 1) cout << '+'; else cout << '-'; } cout << endl; } } else{ if(m % 2 == 1){ if(n % 2 == 1){ cout << m - 1 + n - 1 << endl; for(int i = 0;i < n;i ++){ if(i == 0){ for(int j = 0;j < m - 1;j ++) cout << '-'; cout << '+' << endl; continue; } for(int j = 0;j < m - 1;j ++){ if(i % 2 == 1){ if(j % 2 == 0) cout << '+'; else cout << '-'; } else{ if(j % 2 == 0) cout << '-'; else cout << '+'; } } cout << '+' << endl; } } else{ cout << m - 1 + n - 2 << endl; for(int i = 0;i < n;i ++){ if(i == 0 || i == n - 1){ for(int j = 0;j < m - 1;j ++) cout << '-'; cout << '+' << endl; continue; } for(int j = 0;j < m - 1;j ++){ if(i % 2 == 1){ if(j % 2 == 0) cout << '+'; else cout << '-'; } else{ if(j % 2 == 0) cout << '-'; else cout << '+'; } } cout << '+' << endl; } } } else{ if(n % 2 == 1){ cout << m - 2 + n - 1 << endl; for(int i = 0;i < n;i ++){ if(i == 0){ cout << '+'; for(int j = 1;j < m - 1;j ++) cout << '-'; cout << '+' << endl; continue; } cout << '+'; for(int j = 1;j < m - 1;j ++){ if(i % 2 == 1){ if(j % 2 == 0) cout << '+'; else cout << '-'; } else{ if(j % 2 == 0) cout << '-'; else cout << '+'; } } cout << '+' << endl; } } else{ cout << m - 2 + n - 2 << endl; for(int i = 0;i < n;i ++){ if(i == 0 || i == n - 1){ cout << '+'; for(int j = 1;j < m - 1;j ++) cout << '-'; cout << '+' << endl; continue; } cout << '+'; for(int j = 1;j < m - 1;j ++){ if(i % 2 == 1){ if(j % 2 == 0) cout << '+'; else cout << '-'; } else{ if(j % 2 == 0) cout << '-'; else cout << '+'; } } cout << '+' << endl; } } } } } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 340 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 30 ms | 1240 KB | Output is correct |
2 | Correct | 27 ms | 1144 KB | Output is correct |
3 | Correct | 18 ms | 1144 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 1232 KB | Output is correct |
2 | Correct | 21 ms | 1072 KB | Output is correct |
3 | Correct | 17 ms | 980 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 340 KB | Output is correct |
5 | Correct | 30 ms | 1240 KB | Output is correct |
6 | Correct | 27 ms | 1144 KB | Output is correct |
7 | Correct | 18 ms | 1144 KB | Output is correct |
8 | Correct | 20 ms | 1232 KB | Output is correct |
9 | Correct | 21 ms | 1072 KB | Output is correct |
10 | Correct | 17 ms | 980 KB | Output is correct |
11 | Incorrect | 8 ms | 532 KB | Wrong answer in test 26 8: 30 < 31 |
12 | Halted | 0 ms | 0 KB | - |