# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
911013 | 2024-01-18T11:14:53 Z | penguin133 | Red-blue table (IZhO19_stones) | C++17 | 27 ms | 1372 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define pi pair<int, int> #define pii pair<int, pi> #define fi first #define se second #ifdef _WIN32 #define getchar_unlocked _getchar_nolock #endif mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); void solve(){ int n, m; cin >> n >> m; cout << max(n, m) + (min(n, m) - 1) / 2 << '\n'; if(n > m){ for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(j <= (m - 1) / 2)cout << '-'; else cout << '+'; } cout << '\n'; } } else{ for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(i <= (n - 1) / 2)cout << '+'; else cout << '-'; } cout << '\n'; } } } main(){ ios::sync_with_stdio(0);cin.tie(0); int tc = 1; cin >> tc; for(int tc1=1;tc1<=tc;tc1++){ // cout << "Case #" << tc1 << ": "; solve(); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Incorrect | 2 ms | 344 KB | Wrong answer in test 5 29: 31 < 32 |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 1372 KB | Wrong answer in test 97 21: 107 < 116 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 27 ms | 1364 KB | Wrong answer in test 24 24: 35 < 44 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Incorrect | 2 ms | 344 KB | Wrong answer in test 5 29: 31 < 32 |
5 | Halted | 0 ms | 0 KB | - |