# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
514062 | Aktan | Red-blue table (IZhO19_stones) | C++17 | 53 ms | 1300 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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define int long long
#define ft first
#define sc second
using namespace std;
const int mod=1e9+7,INF=1e17;
main(){
int t;
cin >> t;
while(t--){
int n,m;
cin >> n >> m;
cout << max(n,m)+((min(n,m)-1)/2) << endl;
int l=max(n,m),r=min(n,m);
if(l==n){
if(m%2==1){
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(j%2==0){
cout << "+";
}
else{
cout << "-";
}
}
cout << endl;
}
}
else{
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(j%2==0){
cout << "+";
}
else if(j==m-1){
cout << "+";
}
else{
cout << "-";
}
}
cout << endl;
}
}
}
else{
if(n%2==1){
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(i%2==0){
cout << "-";
}
else{
cout << "+";
}
}
cout << endl;
}
}
else{
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(i%2==0){
cout << "-";
}
else if(i==n-1){
cout << "-";
}
else{
cout << "+";
}
}
cout << endl;
}
}
}
}
}
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... |